Minimizing the Search Space for Shape Retrieval Algorithms

To provide satisfactory accuracy and flexibility, most of the existing shape retrieval methods make use of different alignments and translations of the objects that introduce much computational complexity. The most computationally expensive part of these algorithms is measuring the degree of match (or mismatch) of the query object with the objects stored in database. In this paper, we present an approach to cut down a large portion of this search space (number of objects in database) that retrieval algorithms need to take into account. This method is applicable in clustering based approaches also. Moreover, this minimization is done keeping the accuracy of the retrieval algorithms intact and its efficiency is not severely affected in high dimensionalities.

[1]  Simone Santini,et al.  Similarity Measures , 1999, IEEE Trans. Pattern Anal. Mach. Intell..

[2]  Ezzatollah Salari,et al.  Successive elimination algorithm for motion estimation , 1995, IEEE Trans. Image Process..

[3]  Shin'ichi Satoh,et al.  The SR-tree: an index structure for high-dimensional nearest neighbor queries , 1997, SIGMOD '97.

[4]  Malcolm P. Atkinson,et al.  Issues Raised by Three Years of Developing PJama: An Orthogonally Persistent Platform for Java , 1999, ICDT.

[5]  Alan L. Yuille,et al.  FORMS: A flexible object recognition and modelling system , 1996, International Journal of Computer Vision.

[6]  Jonathan Goldstein,et al.  When Is ''Nearest Neighbor'' Meaningful? , 1999, ICDT.

[7]  Ezzatollah Salari,et al.  A fast quadtree motion segmentation for image sequence coding , 1999, Signal Process. Image Commun..

[8]  Daphna Weinshall,et al.  Flexible Syntactic Matching of Curves and Its Application to Automatic Hierarchical Classification of Silhouettes , 1999, IEEE Trans. Pattern Anal. Mach. Intell..

[9]  Anil K. Jain,et al.  Extended Attributed String Matching for Shape Recognition , 1998, Comput. Vis. Image Underst..

[10]  Hans-Peter Kriegel,et al.  The X-tree : An Index Structure for High-Dimensional Data , 2001, VLDB.

[11]  Dragutin Petkovic,et al.  Query by Image and Video Content: The QBIC System , 1995, Computer.

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

[13]  Boaz J. Super,et al.  Fast Retrieval of Isolated Visual Shapes , 2002, Comput. Vis. Image Underst..

[14]  C.-C. Jay Kuo,et al.  Wavelet descriptor of planar curves: theory and applications , 1996, IEEE Trans. Image Process..

[15]  Jan P. Allebach,et al.  Fast image database search using tree-structured VQ , 1997, Proceedings of International Conference on Image Processing.

[16]  Hans-Jörg Schek,et al.  A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces , 1998, VLDB.

[17]  Longin Jan Latecki,et al.  Shape Similarity Measure Based on Correspondence of Visual Parts , 2000, IEEE Trans. Pattern Anal. Mach. Intell..

[18]  Boaz J. Super,et al.  Fast correspondence-based system for shape retrieval, , 2004, Pattern Recognit. Lett..

[19]  Gérard G. Medioni,et al.  Structural Indexing: Efficient 3-D Object Recognition , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[20]  Arnold W. M. Smeulders,et al.  Image Databases and Multi-Media Search , 1998, Image Databases and Multi-Media Search.

[21]  Christian Böhm,et al.  Fast parallel similarity search in multimedia databases , 1997, SIGMOD '97.

[22]  Michael A. Greenspan,et al.  A nearest neighbor method for efficient ICP , 2001, Proceedings Third International Conference on 3-D Digital Imaging and Modeling.