Algorithms for fast vector quantization

Sunil Arya; David M. Mount

doi:10.1109/DCC.1993.253111

Algorithms for fast vector quantization

Sunil Arya, David M. Mount

Research output: Chapter in Book/Conference Proceeding/Report › Conference Paper published in a book › peer-review

95 Citations (Scopus)

Abstract

This paper shows that if one is willing to relax the requirement of finding the true nearest neighbor, it is possible to achieve significant improvements in running time and at only a very small loss in the performance of the vector quantizer. The authors present three algorithms for nearest neighbor searching: standard and priority k-d tree search algorithms and a neighborhood graph search algorithm in which a directed graph is constructed for the point set and edges join neighboring points.

Original language	English
Title of host publication	Proceedings - DCC 1993
Subtitle of host publication	Data Compression Conference
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	381-390
Number of pages	10
ISBN (Electronic)	0818633921
DOIs	https://doi.org/10.1109/DCC.1993.253111
Publication status	Published - 1993
Externally published	Yes
Event	1993 Data Compression Conference, DCC 1993 - Snowbird, United States Duration: 30 Mar 1993 → 2 Apr 1993

Publication series

Name	Data Compression Conference Proceedings
ISSN (Print)	1068-0314

Conference

Conference	1993 Data Compression Conference, DCC 1993
Country/Territory	United States
City	Snowbird
Period	30/03/93 → 2/04/93

Bibliographical note

Publisher Copyright:
© 1993 IEEE.

Access to Document

10.1109/DCC.1993.253111

Cite this

@inproceedings{e124a3ef75914059a8f67da0fb6ce068,

title = "Algorithms for fast vector quantization",

abstract = "This paper shows that if one is willing to relax the requirement of finding the true nearest neighbor, it is possible to achieve significant improvements in running time and at only a very small loss in the performance of the vector quantizer. The authors present three algorithms for nearest neighbor searching: standard and priority k-d tree search algorithms and a neighborhood graph search algorithm in which a directed graph is constructed for the point set and edges join neighboring points.",

author = "Sunil Arya and Mount, \{David M.\}",

note = "Publisher Copyright: {\textcopyright} 1993 IEEE.; 1993 Data Compression Conference, DCC 1993 ; Conference date: 30-03-1993 Through 02-04-1993",

year = "1993",

doi = "10.1109/DCC.1993.253111",

language = "English",

series = "Data Compression Conference Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "381--390",

booktitle = "Proceedings - DCC 1993",

}

TY - GEN

T1 - Algorithms for fast vector quantization

AU - Arya, Sunil

AU - Mount, David M.

PY - 1993

Y1 - 1993

N2 - This paper shows that if one is willing to relax the requirement of finding the true nearest neighbor, it is possible to achieve significant improvements in running time and at only a very small loss in the performance of the vector quantizer. The authors present three algorithms for nearest neighbor searching: standard and priority k-d tree search algorithms and a neighborhood graph search algorithm in which a directed graph is constructed for the point set and edges join neighboring points.

AB - This paper shows that if one is willing to relax the requirement of finding the true nearest neighbor, it is possible to achieve significant improvements in running time and at only a very small loss in the performance of the vector quantizer. The authors present three algorithms for nearest neighbor searching: standard and priority k-d tree search algorithms and a neighborhood graph search algorithm in which a directed graph is constructed for the point set and edges join neighboring points.

UR - https://openalex.org/W2147647517

UR - https://www.scopus.com/pages/publications/85063460545

U2 - 10.1109/DCC.1993.253111

DO - 10.1109/DCC.1993.253111

M3 - Conference Paper published in a book

T3 - Data Compression Conference Proceedings

SP - 381

EP - 390

BT - Proceedings - DCC 1993

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 1993 Data Compression Conference, DCC 1993

Y2 - 30 March 1993 through 2 April 1993

ER -

Algorithms for fast vector quantization

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this