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

Celý popis

Podrobná bibliografia

Vydané v:	Pattern recognition letters Ročník 33; číslo 16; s. 2173 - 2180
Hlavní autori:	Trzcinski, Tomasz, Lepetit, Vincent, Fua, Pascal
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.12.2012
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!