Vector quantization clustering using lattice growing search

Dorin Comaniciu, Cristina Comaniciu

Research output: Contribution to journalConference articlepeer-review

Abstract

In this paper we introduce a non-iterative algorithm for vector quantization clustering based on the efficient search for the two clusters whose merging gives the minimum distortion increase. The search is performed within the K-dimensiona1 cells of a lattice having a generating matrix that changes from one step of the algorithm to another. The generating matrix is modified gradually so that the lattice cells grow in volume, allowing the search of the two closest clusters in an enlarged neighborhood. We call this algorithm Lattice Growing Search (LGS) clustering. Preliminary results on 512 x 512 images encoded at 0.5 bits/pixel showed that the LGS technique can produce codebooks of similar quality in less than 1/10 of the time required by the LBG algorithm [9].

Original languageEnglish
JournalEuropean Signal Processing Conference
StatePublished - 2015
Event8th European Signal Processing Conference, EUSIPCO 1996 - Trieste, Italy
Duration: 10 Sep 199613 Sep 1996

Fingerprint

Dive into the research topics of 'Vector quantization clustering using lattice growing search'. Together they form a unique fingerprint.

Cite this