3D object recognition using Bayesian geometric hashing and pose clustering

✍ Scribed by Anshul Sehgal; U.B. Desai

• Publisher: Elsevier Science
• Year: 2003
• Tongue: English
• Weight: 779 KB
• Volume: 36
• Category: Article
• ISSN: 0031-3203
• DOI: 10.1016/s0031-3203(02)00102-4

✦ Synopsis

Geometric hashing (GH) and partial pose clustering are well-known algorithms for pattern recognition. However, the performance of both these algorithms degrades rapidly with an increase in scene clutter and the measurement uncertainty in the detected features. The primary contribution of this paper is the formulation of a framework that uniÿes the GH and the partial pose clustering paradigms for pattern recognition in cluttered scenes. The proposed scheme has a better discrimination capability as compared to the GA algorithm, thus improving recognition accuracy. The scheme is incorporated in a Bayesian MLE framework to make it robust to the presence of sensor noise. It is able to handle partial occlusions, is robust to measurement uncertainty in the data features and to the presence of spurious scene features (scene clutter). An e cient hash table representation of 3D features extracted from range images is also proposed. Simulations with real and synthetic 2D=3D objects show that the scheme performs better than the GH algorithm in scenes with a large amount of clutter.