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
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
Proceedings of the 24th BCS-IRSG European Colloquium on IR Research: Advances in Information Retrieval
Pivot selection techniques for proximity searching in metric spaces
Pattern Recognition Letters
Evaluation of key frame-based retrieval techniques for video
Computer Vision and Image Understanding - Special isssue on video retrieval and summarization
Dynamic similarity search in multi-metric spaces
MIR '06 Proceedings of the 8th ACM international workshop on Multimedia information retrieval
Unified framework for fast exact and approximate search in dissimilarity spaces
ACM Transactions on Database Systems (TODS)
Indexing 3-D human motion repositories for content-based retrieval
IEEE Transactions on Information Technology in Biomedicine - Special section on computational intelligence in medical systems
Index-supported similarity search using multiple representations
DASFAA'08 Proceedings of the 13th international conference on Database systems for advanced applications
Improving 3D similarity search by enhancing and combining 3D descriptors
Multimedia Tools and Applications
Adapting metric indexes for searching in multi-metric spaces
Multimedia Tools and Applications
Hi-index | 0.00 |
We present a novel indexing schema that provides efficient nearest-neighbor queries in multimedia databases consisting of objects described by multiple feature vectors. The benefits of the simultaneous usage of several (statically or dynamically) weighted feature vectors with respect to retrieval effectiveness have been previously demonstrated. Support for efficient multi-feature vector similarity queries is an open problem, as existing indexing methods do not support dynamically parameterized distance functions. We present a solution for this problem relying on a combination of several pivot-based metric indices. We define the index structure, present algorithms for performing nearest-neighbor queries on these structures, and demonstrate the feasibility by experiments conducted on two real-world image databases. The experimental results show a significant performance improvement over existing access methods.