On L∞ properties of multiresolution scalar quantizers

Authors:
Nima Sarshar;Xiaolin Wu
Affiliations:
Faculty of Engineering, University of Regina, Regina, SK, Canada;Department of Electrical and Computer Engineering, McMaster University, Hamilton, ON, Canada
Venue:
IEEE Transactions on Information Theory
Year:
2010

Citing 10
Cited 0

Introduction to algorithms

Introduction to algorithms
The Construction of Huffman Codes is a Submodular ("Convex") Optimization Problem Over a Lattice of Binary Trees

SIAM Journal on Computing
Fixed-rate successively refinable scalar quantizers

DCC '96 Proceedings of the Conference on Data Compression
Entropy-Constrained Successively Refinable Scaler Quantization

DCC '97 Proceedings of the Conference on Data Compression
Practical Multi-Resolution Source Coding: TSVQ

DCC '98 Proceedings of the Conference on Data Compression
Quantization as Histogram Segmentation: Globally Optimal Scalar Quantizer Design in Network Systems

DCC '02 Proceedings of the Data Compression Conference
On Optimal Multi-resolution Scalar Quantization

DCC '02 Proceedings of the Data Compression Conference
Codecell Contiguity in Optimal Fixed-Rate and Entropy-Constrained Network Scalar Quantizers

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

Journal of Algorithms
L∞ constrained high-fidelity image compression via adaptive context modeling

IEEE Transactions on Image Processing

Quantified Score

Hi-index	754.84

Visualization

Abstract

We investigate the max-norm (L∞) properties of multiresolution scalar quantizers (MRSQ). The multiresolution requirement imposes nontrivial constraints on the maximum distortion at each level of the quantizer. To quantify these constraints, we define the overall multiresolution L∞ distortion of an MRSQ to be a weighted sum of L∞ distortions over all refinement levels of the MRSQ. We then seek MRSQ constructions that minimize this average-max distortion measure. An interesting relationship between this problem and the structure of Huffman code trees is established. Lower bounds for the average-max distortion are derived based on this relationship. The derivation of these lower bounds also lead to efficient dynamic programming heuristic solutions.