Paper
17 December 1998 Location hashing: an efficient indexing method for locating object queries in image databases
Tanveer F. Syeda-Mahmood
Author Affiliations +
Abstract
Queries referring to content embedded within images are an essential component of content-based search, browse, or summarize operations in image databases. Localization of such queries under changes in appearance, occlusions and background clutter, is a difficult problem, for which current spatial access structures in databases are not suitable. In this paper, we present a new method of indexing image databases, called location hashing, that uses a special data structure, called the location hash tree, for organizing feature information from images of a database. Location hashing is based on the principle of geometric hashing. It simultaneously determines the relevant images in the database, and the regions within them, which are most likely to contain 2D pattern query, without incurring a detailed search of either. The location hash tree being a red-black tree, allows for efficient search for candidate locations using pose-invariant feature information derived from the query.
© (1998) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Tanveer F. Syeda-Mahmood "Location hashing: an efficient indexing method for locating object queries in image databases", Proc. SPIE 3656, Storage and Retrieval for Image and Video Databases VII, (17 December 1998); https://doi.org/10.1117/12.333856
Lens.org Logo
CITATIONS
Cited by 3 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Databases

Low-intensity laser therapy

Image segmentation

Nanoimprint lithography

Data modeling

Quantization

Affine motion model

Back to Top