By Topic

A lossless smoothing algorithm for compressed video

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
S. S. Lam ; Dept. of Comput. Sci., Texas Univ., Austin, TX, USA ; S. Chow ; D. K. Y. Yau

Interframe coding techniques, such as those used in MPEG video, give rise to a sequence of encoded pictures whose sizes (in number of bits) differ by a factor of ten or more. Buffering is needed to reduce fluctuations in the rate at which video packets are sent to a network connection. We design and specify a lossless smoothing algorithm, characterized by three parameters: D (delay bound), X (number of pictures with known sizes), and H (lookahead interval). We prove a theorem which guarantees that, if K⩾1, the algorithm finds a solution that satisfies the delay bound. We present the algorithm's performance from a large number of experiments conducted using MPEG video traces. Lastly, we discuss algorithm implementation

Published in:

IEEE/ACM Transactions on Networking  (Volume:4 ,  Issue: 5 )