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.
Interval hash tree: an efficient index structure for searching object queries in large image databases
2000-01-01
238461 byte
Conference paper
Electronic Resource
English
British Library Conference Proceedings | 2000
|Efficient processing of spatial queries in line segment databases
Tema Archive | 1991
|An Effective Directory Index Framework Taking Advantages of Hash Table and B^+-Tree
British Library Online Contents | 2013
|Efficient search scheme for very large image databases [3964-08]
British Library Conference Proceedings | 2000
|