An improved initialization algorithm for use with the K-means algorithm for code book generation
S. Easwaran, J.N. Gowdy
Abstract
S. Easwaran, J.N. Gowdy
Abstract
A novel algorithm for codebook initialization for use with the K-means algorithm for codebook generation is presented. This algorithm was shown to result in better codebooks at considerably reduced generation time compared to Lloyd's algorithm and to other codebook initialization algorithms. The proposed algorithm generated codebooks with smaller maxima and smaller standard deviations of the codebook vector quantization (VQ) distortions. These outcomes were consistently observed with substantial margins for all cases considered.>
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A novel algorithm for codebook initialization for use with the K-means algorithm for codebook generation is presented. This algorithm was shown to result in better codebooks at considerably reduced generation time compared to Lloyd's algorithm and to other codebook initialization algorithms. The proposed algorithm generated codebooks with smaller maxima and smaller standard deviations of the codebook vector quantization (VQ) distortions. These outcomes were consistently observed with substantial margins for all cases considered.>
Key concepts: Codebook, Linde–Buzo–Gray algorithm, Initialization, Vector quantization, Algorithm, Computer science, Code (set theory), Maxima