Interval Hash Tree: An Efficient Index Structure for Searching Object Queries in Large Image Databases

Authors:
T. F. Syeda-Mahmood;P. Raghavan;N. Megiddo
Affiliations:
-;-;-
Venue:
CBAIVL '00 Proceedings of the IEEE Workshop on Content-based Access of Image and Video Libraries (CBAIVL'00)
Year:
2000

Citing 0
Cited 1

Detecting topical events in digital video

MULTIMEDIA '00 Proceedings of the eighth ACM international conference on Multimedia

Quantified Score

Hi-index	0.00

Visualization

Abstract

As image databases grow large, 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 databases 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.