Scalable compression based on tree structured vector quantization of perceptually weighted block, lapped, and wavelet transforms

Authors:
N. Chaddha;P. A. Chou;T. H. Y. Meng
Affiliations:
-;-;-
Venue:
ICIP '95 Proceedings of the 1995 International Conference on Image Processing (Vol. 3)-Volume 3 - Volume 3
Year:
1995

Citing 0
Cited 3

Rendering from compressed textures

SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Real-time applications on the Internet

BT Technology Journal
A low power video encoder with power, memory and bandwidth scalability

VLSID '96 Proceedings of the 9th International Conference on VLSI Design: VLSI in Mobile Communication

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an algorithm for scalable compression using tree structured vector quantization (TSVQ) of perceptually weighted block, lapped, or wavelet transforms. The algorithm produces an embedded bit-stream to support decoders with various spatial and temporal resolutions. Bandwidth scalability with a dynamic range from a few kbps to several Mbps is provided. The algorithm further supports decoders with varying alphabet size, computation, memory, latency and power requirements. The embedded bit-stream produced is prioritized with bits arranged in order of visual importance. The algorithm also allows easy joint-source channel coding on heterogenous networks. The subjective quality of compressed images improves significantly by the use of perceptual distortion measures.