CSB '02 Proceedings of the IEEE Computer Society Conference on Bioinformatics
Rate-Distortion Analysis of Discrete-HMM Pose Estimation via Multiaspect Scattering Data
IEEE Transactions on Pattern Analysis and Machine Intelligence
DCC '02 Proceedings of the Data Compression Conference
Reduced Complexity Quantization Under Classification Constraints
DCC '02 Proceedings of the Data Compression Conference
An adaptive incremental LBG for vector quantization
Neural Networks
Objective speech quality measurement using statistical data mining
EURASIP Journal on Applied Signal Processing
| Hi-index | 0.01 |
Classification and compression play important roles in communicating digital information. Their combination is useful in many applications, including the detection of abnormalities in compressed medical images. In view of the similarities of compression and low-level classification, it is not surprising that there are many similar methods for their design. Because some of these methods are useful for designing vector quantizers, it seems natural that vector quantization (VQ) is explored for the combined goal. We investigate several VQ-based algorithms that seek to minimize both the distortion of compressed images and errors in classifying their pixel blocks. These algorithms are investigated with both full search and tree-structured codes. We emphasize a nonparametric technique that minimizes both error measures simultaneously by incorporating a Bayes risk component into the distortion measure used for the design and encoding. We introduce a tree-structured posterior estimator to produce the class posterior probabilities required for the Bayes risk computation in this design. For two different image sources, we demonstrate that this system provides superior classification while maintaining compression close or superior to that of several other VQ-based designs, including Kohonen's (1992) “learning vector quantizer” and a sequential quantizer/classifier design