Paper
19 April 2000 New class of VQ codebook design algorithms using adjacency maps
Andreas Constantinou, David R. Bull, Cedric Nishan Canagarajah
Author Affiliations +
Abstract
We propose a new class of vector quantization (VQ) codebook design algorithms, which alleviate many of the drawbacks associated with the well-known LBG and its variants. We introduce the notion of an adjacency map (AM), which provides a heuristic template for improved codebook design, by reducing the search space required for exhaustive optimization, while providing solutions close to the globally optimum, independent of the initial codewords or a target codebook size. An iterative adjacency merge (IAM) algorithm is presented, which outperforms the pairwise-nearest-neighbor (PNN) approach, through conformance to the minimum adjacency map. Additionally, an exhaustive search algorithm is presented that reduces the search complexity to the minimum without introducing heuristics.
© (2000) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Andreas Constantinou, David R. Bull, and Cedric Nishan Canagarajah "New class of VQ codebook design algorithms using adjacency maps", Proc. SPIE 3974, Image and Video Communications and Processing 2000, (19 April 2000); https://doi.org/10.1117/12.382997
Lens.org Logo
CITATIONS
Cited by 3 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Optimization (mathematics)

Genetic algorithms

Distortion

Signal to noise ratio

Quantization

Detection and tracking algorithms

Distance measurement

Back to Top