Minimax non-redundant channel coding for vector quantization

Authors:
DaMing Chiang;Lee C. Potter
Affiliations:
Department of Electrical Engineering, The Ohio State University, Columbus, OH;Department of Electrical Engineering, The Ohio State University, Columbus, OH
Venue:
ICASSP'93 Proceedings of the 1993 IEEE international conference on Acoustics, speech, and signal processing: image and multidimensional signal processing - Volume V
Year:
1993

Citing 3
Cited 0

Topological Properties of Hypercubes

IEEE Transactions on Computers
Competitive learning algorithms for vector quantization

Neural Networks
Assignment and Matching Problems: Solution Methods with FORTRAN-Programs

Assignment and Matching Problems: Solution Methods with FORTRAN-Programs

Quantified Score

Hi-index	0.00

Visualization

Abstract

The distortion of a vector quantized image due to channel noise can be alleviated significantly without any redundant control bits by judicious assignment of binary codes to the codevectors. We consider the index assignment problem and adopt a minimax design criterion instead of the usual mean squared measure. The problem is related to the classical Quadratic Assignment Problem and is found to be NP-hard. An effective, heuristic, polynomial-time algorithm is presented for computing approximate solutions. The minimax criterion yields greatly improved worst case performance with very little degradation of average performance.