DocumentCode
3063410
Title
Fast nearest neighbor search for vector quantization of image data
Author
Kamel, M. ; Guan, L.
Author_Institution
Dept. of Syst. Design Eng., Waterloo Univ., Ont., Canada
fYear
1992
fDate
30 Aug-3 Sep 1992
Firstpage
623
Lastpage
626
Abstract
Presents two new methods for the best codeword searching based on different space partitioning strategies: the concentric hypersphere partitioning nearest neighbor search and the equal-average hyperplane partitioning nearest neighbor search
Keywords
image coding; search problems; codeword searching; concentric hypersphere partitioning nearest neighbor search; equal-average hyperplane partitioning nearest neighbor search; image coding; image data; vector quantization; Data engineering; Design engineering; Euclidean distance; Image coding; Nearest neighbor searches; Partitioning algorithms; Prototypes; Sufficient conditions; Systems engineering and theory; Vector quantization;
fLanguage
English
Publisher
ieee
Conference_Titel
Pattern Recognition, 1992. Vol.III. Conference C: Image, Speech and Signal Analysis, Proceedings., 11th IAPR International Conference on
Conference_Location
The Hague
Print_ISBN
0-8186-2920-7
Type
conf
DOI
10.1109/ICPR.1992.202064
Filename
202064
Link To Document