Modified K-means algorithm for vector quantizer design

IEEE Signal Processing Letters

Volumn 4, Issue 1, 1997, Pages 2-4

  Lee, Daeryong ^a   Back, Seongjoon ^a   Sung, Koengmo ^a  

^a Seoul National University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); CONVERGENCE OF NUMERICAL METHODS; ITERATIVE METHODS; OPTIMIZATION;

CENTROID CONDITION; CLUSTERING ANALYSIS; CODEBOOKS; CODEVECTORS; K MEANS ALGORITHM; PARTITION CONDITION;

VECTOR QUANTIZATION;

EID: 0030834989     PISSN: 10709908     EISSN: None     Source Type: Journal    
DOI: 10.1109/97.551685     Document Type: Article

References (7)

1. Y. Linde, A. Buzo, and R. M. Gray, "An algorithm for vector quantizer design.," IEEE. Trans. Commun., vol. COM-28, pp. 84-95, Jan. 1980.
2. A. Gersho and R. M. Gray, Vector Quantization and Signal Compression. Boston, MA: Kluwer, 1992.
3. K. Zeger, J. Vaisey, and A. Gersho, "Globally optimal vector quantizer design by stochastic relaxation," IEEE Trans. Signal Processing, vol. 40, pp. 310-322, Feb. 1992.
4. M. R. Anderberg, Cluster Analysis for Applications. New York: Academic, 1973.
5. S. Z. Selim and M. A. Ismail, "K-means-type algorithms: A generalized convergence theorem and characterization of local optimally," IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-6, pp. 81-87, Jan. 1984.
6. I. Katsavounidis, C.-C. J. Kuo, and Z. Zhang, "A new initialization technique for generalized Lloyd iteration," IEEE Signal Processing Lett., vol. 1, pp. 144-146, Oct. 1994.
7. S. T. Bow, Pattern Recognition and Image Preprocessing. New York: Marcel Dekker, 1992.