By Topic

Interval hash tree: an efficient index structure for searching object queries in large image databases

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Syeda-Mahmood, T.F. ; IBM Almaden Res. Center, San Jose, CA, USA ; Raghaan, P. ; Megiddo, N.

As image databases grow large in size, index structures for fast navigation become important. In particular, when the goal is to locate object queries in image databases under changes in pose, occlusions and spurious data, traditional index structures used in database become unsuitable. This paper presents a novel index structure called the interval hash tree, for locating multi-region object queries in image databases. The utility of the index structure is demonstrated for query localization in a large image database

Published in:

Content-based Access of Image and Video Libraries, 2000. Proceedings. IEEE Workshop on

Date of Conference: