Robust multiresolution coding

Authors:
Jun Chen;Sorina Dumitrescu;Ying Zhang;Jia Wang
Affiliations:
Department of Electrical and Computer Engineering, McMaster University, Hamilton, ON, Canada;Department of Electrical and Computer Engineering, McMaster University, Hamilton, ON, Canada;Department of Electrical and Computer Engineering, McMaster University, Hamilton, ON, Canada;Department of Electronic Engineering, Shanghai Jiao Tong University, Shanghai, China
Venue:
IEEE Transactions on Communications
Year:
2010

Citing 10
Cited 0

The rate-distortion region for multiple descriptions without excess rate

IEEE Transactions on Information Theory
New results in binary multiple descriptions

IEEE Transactions on Information Theory
Fixed-rate successively refinable scalar quantizers

DCC '96 Proceedings of the Conference on Data Compression
Algorithms for optimal multi-resolution quantization

Journal of Algorithms
Achieving the rate-distortion bound with low-density generator matrix codes

IEEE Transactions on Communications
Design of successively refinable trellis-coded quantizers

IEEE Transactions on Information Theory
Multiple description coding with many channels

IEEE Transactions on Information Theory
Multiresolution vector quantization

IEEE Transactions on Information Theory
High performance scalable image compression with EBCOT

IEEE Transactions on Image Processing
A new, fast, and efficient image codec based on set partitioning in hierarchical trees

IEEE Transactions on Circuits and Systems for Video Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

In multiresolution coding a source sequence is encoded into a base layer and a refinement layer. The refinement layer, constructed using a conditional codebook, is in general not decodable without the correct reception of the base layer. By relating multiresolution coding with multiple description coding, we show that it is in fact possible to construct multiresolution codes in certain ways so that the refinement layer alone can be used to reconstruct the source to achieve a nontrivial distortion. As a consequence, one can improve the robustness of the existing multiresolution coding schemes without sacrificing the efficiency. Specifically, we obtain an explicit expression of the minimum distortion achievable by the refinement layer for arbitrary finite alphabet sources with Hamming distortion measure. Experimental results show that the information-theoretic limits can be approached using a practical robust multiresolution coding scheme based on low-density generator matrix codes.