A LOSSLESS SMOOTHING ALGORITHM FOR COMPRESSED VIDEO

Interframe coding techniques, such as those used in MPEG video, give r ise 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 fluct uations in the rate at which video packets are sent to a network conne ction, In this paper, we design and specify a lossless smoothing algor ithm, characterized by three parameters: D (delay bound), K (number of pictures with known sizes), and H (lookahead interval), We prove a th eorem which guarantees that, if K greater than or equal to 1, the algo rithm finds a solution that satisfies the delay bound, We present the algorithm's performance from a large number of experiments conducted u sing MPEG video traces, Lastly, we discuss algorithm implementation.