Paper
15 January 1997 Multiscale branch-and-bound image database search
Author Affiliations +
Abstract
This paper presents a formal framework for designing search algorithms which can identify target images by the spatial distribution of color, edge and texture attributes. The framework is based on a multiscale representation of both the image data, and the associated parameter space that must be searched. We defined a general form for the distance function which insures that branch and bound search can be used to find the globally optimal match. Our distance function depends on the choice of a convex measure of feature distance. For this purpose, we propose the L1 norm and some other alternative choices such as the Kullback-Liebler and divergence distances. Experimental results indicate that the multiscale approach can improve search performance with minimal computational cost.
© (1997) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Jau-Yuen Chen, Charles A. Bouman, and Jan P. Allebach "Multiscale branch-and-bound image database search", Proc. SPIE 3022, Storage and Retrieval for Image and Video Databases V, (15 January 1997); https://doi.org/10.1117/12.263402
Lens.org Logo
CITATIONS
Cited by 25 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Databases

Image retrieval

Image resolution

Detection and tracking algorithms

Distance measurement

Multiscale representation

Image quality

Back to Top