Share Email Print

Proceedings Paper

Classified vector quantizer based on minimum-distance partitioning
Author(s): Dongsik Kim; Sang Uk Lee
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

In this paper, we describe a new classified vector quantization (CVQ) technique employing the minimum-distance classifier to reduce the encoding complexity required in the full search vector quantization (VQ). The determination of the optimal subcodebook sizes for each class is an important task in the CVQ. However, we propose a CVQ technique, which, with an equal subcodebook size, suboptimally satisfies the optimal CVQ condition described in [4]. In addition, a cluster modifying algorithm, which alleviates the local minimum problem in the clustering algorithm, is proposed to ensure the optimal CVQ condition. The proposed CVQ is a kind of the partial search VQ because it requires a search process through each subcodebook only. However, simulation result reveal that the performance of the proposed CVQ is almost comparable to that of the full search VQ, while the encoding complexity is only 6.5 % of that required in the full search VQ.

Paper Details

Date Published: 1 November 1991
PDF: 12 pages
Proc. SPIE 1605, Visual Communications and Image Processing '91: Visual Communication, (1 November 1991); doi: 10.1117/12.50253
Show Author Affiliations
Dongsik Kim, Seoul National Univ. (South Korea)
Sang Uk Lee, Seoul National Univ. (South Korea)

Published in SPIE Proceedings Vol. 1605:
Visual Communications and Image Processing '91: Visual Communication
Kou-Hu Tzou; Toshio Koga, Editor(s)

© SPIE. Terms of Use
Back to Top