Efficient and effective querying by image content
Journal of Intelligent Information Systems - Special issue: advances in visual information management systems
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
A cost model for nearest neighbor search in high-dimensional data space
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
An optimal algorithm for approximate nearest neighbor searching
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
The TV-tree: an index structure for high-dimensional data
The VLDB Journal — The International Journal on Very Large Data Bases - Spatial Database Systems
Similarity Indexing with the SS-tree
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
The X-tree: An Index Structure for High-Dimensional Data
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
| Hi-index | 0.00 |
In this paper, we propose an efficient high-dimensional index structure using cell signatures for similarity search in multimedia database applications. Our index structure partitions a high-dimensional feature space into a group of cells and represents a feature vector as its corresponding cell signature. By using cell signatures rather than real feature vectors, it is possible to reduce the height of our high-dimensional index structure, leading to efficient retrieval performance. In addition, we present a similarity search metric for efficiently pruning search spaces based on cell signatures. Finally, we compare the performance of our index structure with that of its competitor like the X-tree. It is shown from experimental results that our index structure is better on retrieval performance than the X-tree.