Efficient Shape Retrieval Under Partial Matching

Indexing into large database systems is essential for a number of applications. This paper presents a new indexing structure, which overcomes an important restriction of a previous indexing technique using a recently developed theorem from the domain of matrix analysis. Specifically, given a set of distance values computed by distance function, which do not necessarily satisfy the triangle inequality, this paper shows that computing its nearest distance values that obey the properties of a metric enables us to overcome the limitations of the previous indexing algorithm. We demonstrate the proposed framework in the context of a recognition task.

[1]  Ali Shokoufandeh,et al.  Shock Graphs and Shape Matching , 1998, International Journal of Computer Vision.

[2]  Remco C. Veltkamp,et al.  State of the Art in Shape Matching , 2001, Principles of Visual Information Retrieval.

[3]  Remco C. Veltkamp,et al.  Efficient image retrieval through vantage objects , 1999, Pattern Recognit..

[4]  Dana H. Ballard,et al.  Generalizing the Hough transform to detect arbitrary shapes , 1981, Pattern Recognit..

[5]  Josef Kittler,et al.  Efficient and Robust Retrieval by Shape Content through Curvature Scale Space , 1998, Image Databases and Multi-Media Search.

[6]  Leonidas J. Guibas,et al.  The Earth Mover's Distance as a Metric for Image Retrieval , 2000, International Journal of Computer Vision.

[7]  Robert C. Bolles,et al.  Parametric Correspondence and Chamfer Matching: Two New Techniques for Image Matching , 1977, IJCAI.

[8]  Haim J. Wolfson,et al.  Geometric hashing: an overview , 1997 .

[9]  Gunilla Borgefors,et al.  Hierarchical Chamfer Matching: A Parametric Edge Matching Algorithm , 1988, IEEE Trans. Pattern Anal. Mach. Intell..

[10]  Alex Pentland,et al.  Photobook: Content-based manipulation of image databases , 1996, International Journal of Computer Vision.

[11]  M. Fatih Demirci,et al.  Object Recognition as Many-to-Many Feature Matching , 2006, International Journal of Computer Vision.

[12]  Azriel Rosenfeld,et al.  Point pattern matching by relaxation , 1980, Pattern Recognit..

[13]  Inderjit S. Dhillon,et al.  The Metric Nearness Problem , 2008, SIAM J. Matrix Anal. Appl..