Multiresolution subimage similarity matching for large image databases

Kai-Sang Leung; Raymond T. Ng

doi:10.1117/12.298459

23 December 1997 Multiresolution subimage similarity matching for large image databases

Kai-Sang Leung, Raymond T. Ng

Proceedings Volume 3312, Storage and Retrieval for Image and Video Databases VI; (1997) https://doi.org/10.1117/12.298459
Event: Photonics West '98 Electronic Imaging, 1998, San Jose, CA, United States

Abstract

Many database management systems support whole-image matching. However, users may only remember certain subregions 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 dissimilarity measure between the query and the image. By making use of multiresolution representation, this lower bound becomes tighter as the scale becomes finer. Because image contents are usually pre- extracted and stored, a key issue is how to determine the number of levels used in the representation. 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 resolutions. 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 using Padding and Reduction Algorithms in the preferred 3-level multiresolution representation. The best 10 desired images can be retrieved efficiently and effectively from a collection of a thousand images in about 3.5 seconds.

Citation Download Citation

Kai-Sang Leung and Raymond T. Ng "Multiresolution subimage similarity matching for large image databases", Proc. SPIE 3312, Storage and Retrieval for Image and Video Databases VI, (23 December 1997); https://doi.org/10.1117/12.298459

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available