Year: 2001
Type: conference-paper
Abstract: Very fast tree-structured vector quantization employs scalar quantization decisions at each level, but chooses the dimension on which to quantize based on the coordinate direction of maximum variance. Because the quantization is scalar, searches are no more complex than scalar quantization - providing significant improvement in complexity over full-searched or even tree-structured vector quantization - but the method preserves the shape and memory advantages of conventional vector quantization. However, the space filling advantage of VQ is forfeited, since each Voronoi cell is a rectangular cuboid.
Authors: Todd K. Moon, C.B. Peel, Scott E. Budge
Institution: Utah State University
Language: English
Subfield: Computer Vision and Pattern Recognition
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1848988875
