Reduced comparison search for the exact GLA

Author

Kaukoranta, Timo ; Fränti, Pasi ; Nevalainen, Olli

Author_Institution

Dept. of Comput. Sci., Turku Univ., Finland

fYear

1999

fDate

29-31 Mar 1999

Firstpage

33

Lastpage

41

Abstract

This paper introduces a new method for reducing the number of distance calculations in the generalized Lloyd algorithm (GLA), which is a widely used method to construct a codebook in vector quantization. The reduced comparison search detects the activity of the code vectors and utilizes it on the classification of the training vectors. For training vectors whose current code vector has not been modified, we calculate distances only to the active code vectors. A large proportion of the distance calculations can be omitted without sacrificing the optimality of the partition. The new method is included in several fast GLA variants reducing their running times over 50% on average

Keywords

image coding; table lookup; vector quantisation; code vectors; codebook; distance calculations; exact GLA; generalized Lloyd algorithm; image compression; reduced comparison search; training vectors; vector quantization; Clustering algorithms; Computer science; Euclidean distance; Genetic algorithms; Image coding; Image generation; Iterative algorithms; Partitioning algorithms; Testing; Vector quantization;

fLanguage

English

Publisher

ieee

Conference_Titel

Data Compression Conference, 1999. Proceedings. DCC '99

Conference_Location

Snowbird, UT

ISSN

1068-0314

Print_ISBN

0-7695-0096-X

Type

conf

DOI

10.1109/DCC.1999.755651

Filename

755651