Share Email Print
cover

Proceedings Paper

Movie approximation technique for the implementation of fast bandwidth-smoothing algorithms
Author(s): Wu-chi Feng; Chi Chung Lam; Ming Liu
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

Bandwidth smoothing algorithms can effectively reduce the network resource requirements for the delivery of compressed video streams. For stored video, a large number of bandwidth smoothing algorithms have been introduced that are optimal under certain constraints but require access to all the frame size data in order to achieve their optimal properties. This constraint, however, can be both resource and computationally expensive, especially for moderately priced set-top-boxes. In this paper, we introduce a movie approximation technique for the representation of the frame sizes of a video, reducing the complexity of the bandwidth smoothing algorithms and the amount of frame data that must be transmitted prior to the start of playback. Our results show that the proposed approximation technique can accurately approximate the frame data with a small number of piece-wise linear segments without affecting the performance measures that the bandwidth soothing algorithms are attempting to achieve by more than 1%. In addition, we show that implementations of this technique can speed up execution times by 100 to 400 times, allowing the bandwidth plan calculation times to be reduced to tens of milliseconds. Evaluation using a compressed full-length motion-JPEG video is provided.

Paper Details

Date Published: 29 December 1997
PDF: 15 pages
Proc. SPIE 3310, Multimedia Computing and Networking 1998, (29 December 1997); doi: 10.1117/12.298432
Show Author Affiliations
Wu-chi Feng, The Ohio State Univ. (United States)
Chi Chung Lam, The Ohio State Univ. (United States)
Ming Liu, The Ohio State Univ. (United States)


Published in SPIE Proceedings Vol. 3310:
Multimedia Computing and Networking 1998
Kevin Jeffay; Dilip D. Kandlur; Timothy Roscoe, Editor(s)

© SPIE. Terms of Use
Back to Top