Indexing structures for content-based retrieval of large image databases: a review

Authors:
He Ling;Wu Lingda;Cai Yichao;Liu Yuchi
Affiliations:
Institute of Information System & Management, National University of Defense Technology, Changsha;Institute of Information System & Management, National University of Defense Technology, Changsha;Institute of Information System & Management, National University of Defense Technology, Changsha;Institute of Information System & Management, National University of Defense Technology, Changsha
Venue:
AIRS'05 Proceedings of the Second Asia conference on Asia Information Retrieval Technology
Year:
2005

Citing 24
Cited 1

The R*-tree: an efficient and robust access method for points and rectangles

SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Efficient query processing in geographic information systems

Efficient query processing in geographic information systems
FastMap: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets

SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
The SR-tree: an index structure for high-dimensional nearest neighbor queries

SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
The pyramid-technique: towards breaking the curse of dimensionality

SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Vector approximation based indexing for non-uniform high dimensional data sets

Proceedings of the ninth international conference on Information and knowledge management
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
The TV-tree: an index structure for high-dimensional data

The VLDB Journal — The International Journal on Very Large Data Bases - Spatial Database Systems
Globally Order Preserving Multidimensional Linear Hashing

Proceedings of the Fourth International Conference on Data Engineering
Similarity Indexing with the SS-tree

ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
The LSDh-Tree: An Access Structure for Feature Vectors

ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces

VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation

VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Hilbert R-tree: An Improved R-tree using Fractals

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
The X-tree: An Index Structure for High-Dimensional Data

VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Performance Comparison of Segment Access Methods Implemented on Top of the Buddy-Tree

SSD '91 Proceedings of the Second International Symposium on Advances in Spatial Databases
The Hybrid Tree: An Index Structure for High Dimensional Feature Spaces

ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Independent Quantization: An Index Compression Technique for High-Dimensional Data Spaces

ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Querying high-dimensional data in single-dimensional space

The VLDB Journal — The International Journal on Very Large Data Bases
The D-Tree: An Index Structure for Planar Point Queries in Location-Based Wireless Services

IEEE Transactions on Knowledge and Data Engineering
The ND-tree: a dynamic indexing technique for multidimensional non-ordered discrete data spaces

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
An efficient indexing method for nearest neighbor searches inhigh-dirnensional image databases

IEEE Transactions on Multimedia
The GC-tree: a high-dimensional index structure for similarity search in image databases

IEEE Transactions on Multimedia
Techniques and data structures for efficient multimedia retrieval based on similarity

IEEE Transactions on Multimedia

A hybrid probabilistic framework for content-based image retrieval with feature weighting

Pattern Recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

Content-based image retrieval is a focused problem in current multimedia domain. To obtain better searching results more efficiently in some applications, a proper indexing structure is indispensable. This paper reviews the typical indexing structures in content-based image retrieval at first. Then based on the comparison of their different performance, the paper uncovers the problems in those structures and points out the development direction to improve the performance of CBIR in the future.