Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Chaddha et al. (2002) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: