Share Email Print

Proceedings Paper

New class of VQ codebook design algorithms using adjacency maps
Author(s): Andreas Constantinou; David R. Bull; Cedric Nishan Canagarajah
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper 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.

Paper Details

Date Published: 19 April 2000
PDF: 10 pages
Proc. SPIE 3974, Image and Video Communications and Processing 2000, (19 April 2000); doi: 10.1117/12.382997
Show Author Affiliations
Andreas Constantinou, Univ. of Bristol (United Kingdom)
David R. Bull, Univ. of Bristol (United Kingdom)
Cedric Nishan Canagarajah, Univ. of Bristol (United Kingdom)

Published in SPIE Proceedings Vol. 3974:
Image and Video Communications and Processing 2000
Bhaskaran Vasudev; T. Russell Hsing; Andrew G. Tescher; Robert L. Stevenson, Editor(s)

© SPIE. Terms of Use
Back to Top