Thick boundaries in binary space and their influence on nearest-neighbor search

► We show that binary-space Voronoi diagrams have very thick boundaries. ► This leads to a performance loss of the binary nearest neighbor search algorithms. ► We present two effective ways to overcome this limitation. ► They are based on randomized data partitioning. Binary descriptors allow faster...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Pattern recognition letters Jg. 33; H. 16; S. 2173 - 2180
Hauptverfasser:	Trzcinski, Tomasz, Lepetit, Vincent, Fua, Pascal
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.12.2012
Schlagworte:	Approximate nearest neighbor search Binary vectors Hierarchical k-means Locality sensitive hashing Locality sensitive hashing Hierarchical k-means Approximate nearest neighbor search Binary vectors
ISSN:	0167-8655, 1872-7344
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!