Retrieval by shape using multidimensional indexing structures

In modern visual information retrieval systems, visual content is directly addressed by features such as color, texture, shape and spatial relationship. While a large amount of work is being done around the perceptual soundness of models and around the automatic extraction of features, only a limited amount of attention is being placed on the combination of useful representations and similarity models with efficient index structures for shape. In this paper, we discuss retrieval by shape similarity using local features and metric indexing. Shape is partitioned into tokens in correspondence with its protrusions, following curvature analysis. Each token is modeled by a set of perceptually salient attributes, and two distinct distance functions are used to model token similarity and shape similarity. Shape indexing is obtained by arranging shape tokens into a M-tree index structure, suitably modified. Examples from a prototype system are expounded with considerations about the effectiveness of the approach and a comparative performance analysis.

[1]  Ramesh C. Jain,et al.  Similarity indexing with the SS-tree , 1996, Proceedings of the Twelfth International Conference on Data Engineering.

[2]  Pavel Zezula,et al.  M-tree: An Efficient Access Method for Similarity Search in Metric Spaces , 1997, VLDB.

[3]  Rajiv Mehrotra,et al.  Similar-Shape Retrieval in Shape Data Management , 1995, Computer.

[4]  Hanan Samet,et al.  Hierarchical representations of collections of small rectangles , 1988, CSUR.

[5]  Hideyuki Tamura,et al.  Textural Features Corresponding to Visual Perception , 1978, IEEE Transactions on Systems, Man, and Cybernetics.

[6]  F. Attneave Some informational aspects of visual perception. , 1954, Psychological review.

[7]  William I. Grosky,et al.  A pictorial index mechanism for model-based matching , 1989, [1989] Proceedings. Fifth International Conference on Data Engineering.

[8]  Alex Pentland,et al.  Photobook: tools for content-based manipulation of image databases , 1994, Electronic Imaging.

[9]  Toshikazu Kato,et al.  Query by Visual Example - Content based Image Retrieval , 1992, EDBT.

[10]  Shi-Kuo Chang,et al.  Iconic Indexing by 2-D Strings , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[11]  Alberto Del Bimbo,et al.  Visual Image Retrieval by Elastic Matching of User Sketches , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[12]  Hanan Samet,et al.  The Design and Analysis of Spatial Data Structures , 1989 .

[13]  Hans-Peter Kriegel,et al.  The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.

[14]  William I. Grosky,et al.  Index-based object recognition in pictorial data management , 1990, Comput. Vis. Graph. Image Process..

[15]  Fang Liu,et al.  Periodicity, Directionality, and Randomness: Wold Features for Image Modeling and Retrieval , 1996, IEEE Trans. Pattern Anal. Mach. Intell..

[16]  K. Wakimoto,et al.  Efficient and Effective Querying by Image Content , 1994 .