Abstract
Many image database management systems support whole-image queries. However, in some situations, users may only remember certain portions of the images. In this paper, we develop Padding and Reduction Algorithms to support subimage queries of arbitrary size based on local color information. The idea is to estimate the best-case lower bound to the distance between the query and the image. To improve the efficiency and effectiveness of content-based retrieval, a multiscale representation is proposed. Since image contents are usually pre-extracted and stored, the number of levels used in such a representation needs to be determined. We address this issue analytically by estimating the CPU and I/O costs, and experimentally by comparing the performance and accuracy of the outcomes of various filtering schemes. Our findings suggest that a 3-level hierarchy is preferred.
We also study three strategies for searching multiple scales. Our studies indicate that the hybrid strategy with horizontal filtering on the coarse level and vertical filtering on remaining levels is the best choice. When used with Padding and Reduction Algorithms in the preferred 3-level multiscale representation, desired images can be retrieved efficiently and effectively.
Chapter PDF
Similar content being viewed by others
References
Bach, J.R. et al. (1996) The Virage Image Search Engine: An Open Framework for Image Management. Proceedings of SPIE Conference on Storage and Retrieval for Still Image and Video Databases IV (Vol. 2670): 76–87. San Jose CA, USA.
Barber, R. et al. (1994) Ultimedia Manager: Query By Image Content and its Applications. Digest of Papers of the Spring COMPCON ‘94: 424–429. San Francisco CA, USA.
Castelli, V. et al. (1997) Searching Image Databases at Multiple Levels of Abstraction. Research Report RC 20702, IBM T. J. Watson Research Center, Yorktown Heights NY, USA.
Chen, J.-Y. et al. (1997) Multiscale Branch and Bound Image Database Search. Proceedings of SPIE Conference on Storage and Retrieval for Image and Video Databases V (Vol. 3022): 133–144. San Jose CA, USA.
Faloutsos, C. et al. (1994) Efficient and Effective Querying by Image Content. Journal of Intelligent Information Systems 3 (3–4): 231–262.
Faulus, D.S. and Ng, R.T. (1997) An Expressive Language and Interface for Image Querying. Machine Vision and Applications 10 (2): 74–85.
Flickner, M. et al. (1995) Query by Image and Video Content: The QBIC System. IEEE Computer 28 (9): 23–31.
Gudivada, V.N. and Raghavan, V.V. (1995) Content-based Image Retrieval Systems. IEEE Computer 28 (9): 18–22.
Guttman, A. (1984) R-trees: A Dynamic Index Structure for Spatial Searching. Proceedings of ACM SIGMOD Conference on Management of Data: 47–57. Boston MA, USA.
Jacobs, C.E. et al. (1995) Fast Multiresolution Image Querying. Proceedings of ACM SIGGRAPH Conference on Computer Graphics zhaohuan Interactive Techniques: 277–286. Los Angeles CA, USA.
Jain, R., editor (1993) NSF Workshop on Visual Information Management Systems. SIGMOD Record 22 (3): 57–75.
Leung, K.S. (1997) Efficient and Effective Subimage Similarity Matching for Large Image Databases. Master’s Thesis, The University of British Columbia, Vancouver BC, Canada.
Lin, K.-I. et al. (1994) The TV-tree — An Index Structure for High-dimensional Data. VLDB Journal 3 (4): 517–549.
Ng, R.T. and Tain, D. (1997) An Analysis of Multi-level Color Histograms. Proceedings of SPIE Conference on Storage and Retrieval for Image and Video Databases V (Vol. 3022): 22–34. San Jose CA, USA.
Petkovic, D. et al. (1996) Recent Applications of IBM’s Query By Image Content (QBIC). Research Report RJ 10006, IBM Almaden Research Center, San Jose CA, USA.
Samet, H. (1990) The Design and Analysis of Spatial Data Structures. Addison-Wesley.
Sawhney, H.S. and Hafner, J.L. (1993) Efficient Color Histogram Indexing for Quadratic Form Distance Functions. Research Report RJ 9572, IBM Almaden Research Center, San Jose CA, USA.
Stricker, M. and Dimai, A. (1996) Color Indexing with Weak Spatial Constraints. Proceedings of SPIE Conference on Storage and Retrieval for Still Image and Video Databases IV (Vol. 2670): 29–40. San Jose CA, USA.
Swain, M.J. and Ballard, D.H. (1991) Color Indexing. International Journal of Computer Vision 7 (1): 11–32.
Thomasian, A. et al. (1997) RCSVD: Recursive Clustering with Singular Value Decomposition for Dimension Reduction in Content-based Retrieval of Large Image/Video Databases. Research Report RC 20704, IBM T. J. Watson Research Center, Yorktown Heights NY, USA.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media New York
About this chapter
Cite this chapter
Leung, KS., Ng, R. (1998). Multiscale Similarity Matching for Subimage Queries of Arbitrary Size. In: Ioannidis, Y., Klas, W. (eds) Visual Database Systems 4 (VDB4). VDB 1998. IFIP — The International Federation for Information Processing. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35372-2_21
Download citation
DOI: https://doi.org/10.1007/978-0-387-35372-2_21
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-6939-5
Online ISBN: 978-0-387-35372-2
eBook Packages: Springer Book Archive