Rapid object indexing using locality sensitive hashing and joint 3D-signature space estimation

By Bogdan C. Matei, Ying Shan, Harpreet S. Sawhney, Yi Tan, Rakesh Kumar, Daniel F. Huber, Martial Hebert. 2006

100 citations recorded by the source corpus.

Subfields: Aerospace Engineering, Computational Mechanics, Computer Vision and Pattern Recognition

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Aerospace Engineering

In Computational Mechanics

In Computer Vision and Pattern Recognition

Citations in the corpus

Product Quantization for Nearest Neighbor Search (2011, methodology): “In this case, one of the most popular ANN algorithms is the Euclidean Locality-Sensitive Hashing (E2LSH) [7], [11], which provides theoretical guarantees on the search quality This work was partly realized as part of the Quaero Programme, funded by OSEO, French State agency for innovation.”
3D Object Recognition in Cluttered Scenes with Local Surface Features: A Survey (2014, methodology): “[69] used the smallest eigenvalue 3 of the covariance matrix of the neighboring points to measure the”
Searching with expectations (2010, methodology): “It has been successfully used for local descriptors [7] and 3D object indexing [12, 9].”
Shape-based recognition of 3D point clouds in urban environments (2009, methodology): “Shape descriptors based on spin images were used by [19] and [18] to categorize objects such as vehicle types in 3D point clouds.”
A Comprehensive Performance Evaluation of 3D Local Feature Descriptors (2015, background): “Local features have proven to be very successful in many vision tasks such as 3D object categorization and recognition (Matei et al. 2006; Mian et al. 2006a; Shang and Greenspan 2010; Lai et al. 2011; Guo et al. 2013b), 3D modeling and scene reconstruction (Mian et al.”
Point feature extraction on 3D range scans taking into account object boundaries (2011, background): “Many approaches compute descriptors exhaustively in every data point or use simple sampling methods ([6], [3], [8]), thereby introducing an unnecessary overhead.”
Searching with quantization: approximate nearest neighbor search using short codes and distance estimators (2009, methodology): “It has been successfully used for local descriptors [10] and 3D object indexing [11, 9].”
Locality sensitive hashing: A comparison of hash function types and querying mechanisms (2010, unknown): “LSH has been successfully used in several multi-media applications (Ke et al., 2004; Shakhnarovich et al., 2006; Matei et al., 2006).”