Ubiquitous use of real-time video communication on the Internet requires adaptive applications that can provide different levels of quality depending on the amount of resources available. For video coding this means that the algorithms must be designed to be scalable in terms of bandwidth, processing requirements and quality of the reconstructed signal. This paper presents a novel video compression and coding algorithm targeted at delay-sensitive applications in heterogeneous network and computing environments. The algorithm, based on the embedded zerotree wavelet algorithm for still image compression, generates a highly scalable layered bitstream that can be decoded at different qualities in terms of spatial resolution, frame rate and compression distortion. Furthermore, the algorithm is designed to require only a minimal coding delay, making it suitable for highly interactive applications like videoconferencing. The performance of the proposed algorithm is evaluated by comparison with a nonscalable codec and the penalty in compression efficiency that the scalability requirement imposes is analyzed. The codec is shown to produce a scalable bitstream ranging from about 10 kbps to 10 Mbps, while the computational complexity is kept at a level that makes software implementation on CPU-constrained equipment feasible.
A scalable video compression algorithm for real-time Internet applications
2003-01-01
403808 byte
Conference paper
Electronic Resource
English
A Scalable Video Compression Algorithm for Real-time Internet Applications
British Library Conference Proceedings | 2003
|Highly Scalable, Low-Delay Video Compression
British Library Conference Proceedings | 1994
|Real-Time Compression Of Digital Video
NTRS | 1995
|Real-Time Compression of Digital Video
Online Contents | 1995