1 October 2000 Split and merge codebook design algorithms for image compression
Nicolaos B. Karayiannis, Zhiying Liu
Author Affiliations +
This paper introduces two new codebook design algorithms for image data compression applications. The proposed algorithms design codebooks by splitting and merging the prototypes of the training vectors, which play the role of code-vectors in the encoding/decoding process. The split-1 (S1) algorithm begins with a codebook containing a single prototype and designs a codebook of the desired size by splitting one prototype at each iteration. The split-1-merge-2 (S1M2) algorithm begins with a codebook of the desired size and improves its quality in an iterative fashion by splitting one prototype and merging two prototypes at each iteration. The proposed algorithms are used to design codebooks for image data compression based on vector quantization. The experimental results indicate that the proposed algorithms are strong competitors to the popular Linde-Buzo-Gray algorithm in terms of their computational requirements and the quality of the designed codebooks.
Nicolaos B. Karayiannis and Zhiying Liu "Split and merge codebook design algorithms for image compression," Journal of Electronic Imaging 9(4), (1 October 2000). https://doi.org/10.1117/1.1287330
Published: 1 October 2000
Lens.org Logo
CITATIONS
Cited by 4 scholarly publications and 1 patent.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Prototyping

Image compression

Quantization

Reconstruction algorithms

Image quality

Image filtering

Algorithm development

Back to Top