SamMatch: a flexible and efficient sampling-based image retrieval technique for large image databases

The rapid growth of digital image data increases the need for efficient and effective image retrieval systems. Such systems should provide functionality that tailors to the user's need at the query time. In this paper, we propose a new image retrieval technique that allows users to control the relevantness of the results. For each image, the color contents of its regions are captured and used to compute similarity. Various factors, assigned automatically or by the user, allow high recall and precision to be obtained. We implemented the proposed technique for a large database of 16,000 images. Our experimental results show that this technique is not only space-time efficient but also more effective than recently proposed color histogram techniques.

[1]  Stephen A. Dyer,et al.  Digital signal processing , 2018, 8th International Multitopic Conference, 2004. Proceedings of INMIC 2004..

[2]  Christos Faloutsos,et al.  QBIC project: querying images by content, using color, texture, and shape , 1993, Electronic Imaging.

[3]  Christos Faloutsos,et al.  Searching Multimedia Databases by Content , 1996, Advances in Database Systems.

[4]  Michael J. Swain,et al.  Interactive indexing into image databases , 1993, Electronic Imaging.

[5]  A. Guttman,et al.  A Dynamic Index Structure for Spatial Searching , 1984, SIGMOD 1984.

[6]  Shih-Fu Chang,et al.  Tools and techniques for color image retrieval , 1996, Electronic Imaging.

[7]  Beng Chin Ooi,et al.  Fast signature-based color-spatial image retrieval , 1997, Proceedings of IEEE International Conference on Multimedia Computing and Systems.

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

[9]  Tat-Seng Chua,et al.  An integrated color-spatial approach to content-based image retrieval , 1995, MULTIMEDIA '95.

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

[11]  Neill W. Campbell,et al.  Iterative refinement by relevance feedback in content-based digital image retrieval , 1998, MULTIMEDIA '98.

[12]  James Lee Hafner,et al.  Efficient Color Histogram Indexing for Quadratic Form Distance Functions , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

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

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

[15]  Jing Huang,et al.  Image indexing using color correlograms , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[16]  Clu-istos Foutsos,et al.  Fast subsequence matching in time-series databases , 1994, SIGMOD '94.

[17]  Antonin Guttman,et al.  R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.

[18]  Makoto Miyahara,et al.  Mathematical Transform Of (R, G, B) Color Data To Munsell (H, V, C) Color Data , 1988, Other Conferences.

[19]  Beng Chin Ooi,et al.  Efficient Image Retrieval By Color Contents , 1994, ADB.