16 September 1994 Side-match vector quantization design for noisy channel
Author Affiliations +
Proceedings Volume 2308, Visual Communications and Image Processing '94; (1994) https://doi.org/10.1117/12.185931
Event: Visual Communications and Image Processing '94, 1994, Chicago, IL, United States
Abstract
Side-match vector quantization is an attractive finite-state coding technique for images. This research shows that the side-match vector quantization is similar to catastrophic code where infinite number of decoding errors is caused by a finite number of channel errors. A 1D side- match vector quantization is first proposed to limit the error propagation across different row of blocks when the channel is noisy. Then three tests are proposed for noisy rows detection with minimum overhead information. These tests include the 1D side-match vector quantization decoding test, double-row test, and triple-row test. Finally, a modified Viterbi algorithm is proposed to decode the images encoded by the 1D side-match vector quantization.
© (1994) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Chung Jung Kuo, Chung Jung Kuo, Chang S. Lin, Chang S. Lin, } "Side-match vector quantization design for noisy channel", Proc. SPIE 2308, Visual Communications and Image Processing '94, (16 September 1994); doi: 10.1117/12.185931; https://doi.org/10.1117/12.185931
PROCEEDINGS
10 PAGES


SHARE
Back to Top