Geometric hashing for query localization in image databases

Tanveer F. Syeda-Mahmood

doi:10.1117/12.257310

1 November 1996 Geometric hashing for query localization in image databases

Tanveer F. Syeda-Mahmood

Proceedings Volume 2916, Multimedia Storage and Archiving Systems; (1996) https://doi.org/10.1117/12.257310
Event: Photonics East '96, 1996, Boston, MA, United States

Abstract

image indexing, namely, the problem of retrieving content information from images in response to queries, is a key problem underlying several operations in image databases. Indexing for object queries, in particular, is a difficult problem, as it requires localizing an unanticipated object in unsegmented images. This inevitably involves search, a computationally intensive operation when based entirely on image features. It is desirable to have efficient data structures that avoid the need for sequential search through images and their features for query localization. Conventional data structures used for database organization are not adequate for image indexing where the object query has to be located in images depicting changed imaging conditions that include pose changes and occlusions. In this paper, we explore the use of a geometric hash table as a suitable data structure for fast image indexing. The technique of geometric hashing has been used in computer vision for indexing a library of models to find candidate model objects for recognition in the isolated image region. Here, however, we use geometric hashing as a technique of fast query localization in unsegmented images of a database. Specifically, we show that by using three consecutive features along a curve as basis points for affine invariance, a hash table can be constructed for images that is quadratic in the number of features. The resulting indexing method is also quadratic in the number of features. The query localization by geometric hashing is demonstrated for the problem of indexing of handwritten documents based on handwriting pattern queries.

Citation Download Citation

Tanveer F. Syeda-Mahmood "Geometric hashing for query localization in image databases", Proc. SPIE 2916, Multimedia Storage and Archiving Systems, (1 November 1996); https://doi.org/10.1117/12.257310

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

Members: $17.00

Non-members: $21.00 ADD TO CART

PROCEEDINGS
13 PAGES

DOWNLOAD PAPER SAVE TO MY LIBRARY

GET CITATION

RIGHTS & PERMISSIONS

Get copyright permission Get copyright permission on Copyright Marketplace

KEYWORDS

Databases

Affine motion model

Visual process modeling

Computer vision technology

Image processing

Machine vision

Data modeling

Show All Keywords

Keywords/Phrases

Search In:

Publication Years