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

Full description

Bibliographic Details

Published in:	Pattern recognition letters Vol. 33; no. 16; pp. 2173 - 2180
Main Authors:	Trzcinski, Tomasz, Lepetit, Vincent, Fua, Pascal
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.12.2012
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!