Efficient Indexing For Articulation Invariant Shape Matching And Retrieval

Most shape matching methods are either fast but too simplistic to give the desired performance or promising as far as performance is concerned but computationally demanding. In this paper, we present a very simple and efficient approach that not only performs almost as good as many stateof-the-art techniques but also scales up to large databases. In the proposed approach, each shape is indexed based on a variety of simple and easily computable features which are invariant to articulations and rigid transformations. The features characterize pairwise geometric relationships between interest points on the shape, thereby providing robustness to the approach. Shapes are retrieved using an efficient scheme which does not involve costly operations like shape-wise alignment or establishing correspondences. Even for a moderate size database of 1000 shapes, the retrieval process is several times faster than most techniques with similar performance. Extensive experimental results are presented ...

• Type: Conference
• Year: 2007
• Where: CVPR
• Authors: Soma Biswas, Gaurav Aggarwal, Rama Chellappa
• Keywords: Computer Vision, CVPR 2007, Efficient Approach, Efficient Scheme, Moderate Size Database, Pairwise Geometric Relationships, Shape Matching Methods