Content-Based Image Retrieval Using Multiple Representations

Many different approaches for content-based image retrieval have been proposed in the literature. Successful approaches consider not only simple features like color, but also take the structural relationship between objects into account. In this paper we describe two models for image representation which integrate structural features and content features in a tree or a graph structure. The effectiveness of this two approaches is evaluated with real world data, using clustering as means for evaluation. Furthermore, we show that combining those two models can further enhance the retrieval accuracy.

[1]  Marcel Worring,et al.  Content-Based Image Retrieval at the End of the Early Years , 2000, IEEE Trans. Pattern Anal. Mach. Intell..

[2]  H. V. Jagadish,et al.  Evaluating Structural Similarity in XML Documents , 2002, WebDB.

[3]  Hans-Peter Kriegel,et al.  A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise , 1996, KDD.

[4]  Ignatios Vakalis,et al.  Using graph distance in object recognition , 1990, CSC '90.

[5]  Jonathan J. Hull,et al.  Document image database retrieval and browsing using texture analysis , 1997, Proceedings of the Fourth International Conference on Document Analysis and Recognition.

[6]  Michael J. Fischer,et al.  The String-to-String Correction Problem , 1974, JACM.

[7]  Mohan S. Kankanhalli,et al.  Shape Measures for Content Based Image Retrieval: A Comparison , 1997, Inf. Process. Manag..

[8]  Philip N. Klein,et al.  Recognition of Shapes by Editing Shock Graphs , 2001, ICCV.

[9]  James S. Duncan,et al.  Arrangement: A Spatial Relation Between Parts for Evaluating Similarity of Tomographic Section , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[10]  Hans-Peter Kriegel,et al.  Similarity Search in Structured Data , 2003, DaWaK.

[11]  Hans-Peter Kriegel,et al.  Effective similarity search on voxelized CAD objects , 2003, Eighth International Conference on Database Systems for Advanced Applications, 2003. (DASFAA 2003). Proceedings..

[12]  Hans-Peter Kriegel,et al.  Clustering Multi-represented Objects with Noise , 2004, PAKDD.

[13]  Chiou-Shann Fuh,et al.  Hierarchical color image region segmentation for content-based image retrieval system , 2000, IEEE Trans. Image Process..

[14]  Hans-Peter Kriegel,et al.  Efficient Similarity Search for Hierarchical Data in Large Databases , 2004, EDBT.

[15]  Kaizhong Zhang,et al.  Finding approximate patterns in undirected acyclic graphs , 2002, Pattern Recognit..

[16]  Kaizhong Zhang,et al.  On the Editing Distance Between Unordered Labeled Trees , 1992, Inf. Process. Lett..

[17]  Jan Chomicki,et al.  Hippo: A System for Computing Consistent Answers to a Class of SQL Queries , 2004, EDBT.

[18]  Kaizhong Zhang,et al.  On the Editing Distance Between Undirected Acyclic Graphs , 1996, Int. J. Found. Comput. Sci..

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

[20]  Norbert Krüger,et al.  Face recognition by elastic bunch graph matching , 1997, Proceedings of International Conference on Image Processing.

[21]  Vladimir I. Levenshtein,et al.  Binary codes capable of correcting deletions, insertions, and reversals , 1965 .