logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

A lossless smoothing algorithm for compressed video

delete1996-01-01
delete20
PRE
AI
S
Simon S. Lam *
S
Simon Kwoon‐Ho Chow
D
David K. Y. Yau
DOI：10.1109/90.541318delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
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, In this paper, we design and specify a lossless smoothing algorithm, characterized by three parameters: D (delay bound), K (number of pictures with known sizes), and H (lookahead interval), We prove a theorem which guarantees that, if K greater than or equal to 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.
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

I
IEEE-ACM Transactions on Networking
IF:
3.6
Papers:
4.4K
Citations:
9.5K

Organization

No organization information available