Similarity analysis for shape retrieval by example

This work proposes a query-by-example algorithm for shape retrieval from a color image database. The main contribution of this work is an unified approach for shape matching and similarity ranking using a modal representation. Prior work mostly performed point correspondence determination and similarity ranking of shapes in two distinct steps or performed one of them. We define a new shape-similarity metric and attempt to address the question "how similar two shapes in an image database are", which currently is an important problem in shape-based retrieval systems. Unlike most reported methods, the presented approach does not require extraction of connected boundaries or silhouettes. It is rotation-, and scale-invariant, and can handle mild deformations of objects. The results are promising for using the algorithm in the context of database query by image content.

[1]  A. Murat Tekalp,et al.  Adaptive Bayesian segmentation of color images , 1994, J. Electronic Imaging.

[2]  Alex Pentland,et al.  Modal Matching for Correspondence and Recognition , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  Shih-Fu Chang,et al.  Extracting multidimensional signal features for content-based visual query , 1995, Other Conferences.

[4]  Alex Pentland,et al.  Photobook: tools for content-based manipulation of image databases , 1994, Other Conferences.

[5]  Michael Brady,et al.  Feature-based correspondence: an eigenvector approach , 1992, Image Vis. Comput..

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

[7]  Nuggehally Sampath Jayant,et al.  An adaptive clustering algorithm for image segmentation , 1989, International Conference on Acoustics, Speech, and Signal Processing,.

[8]  Daniel P. Huttenlocher,et al.  Comparing Images Using the Hausdorff Distance , 1993, IEEE Trans. Pattern Anal. Mach. Intell..