ACM Computing Surveys (CSUR)
VQ-index: an index structure for similarity searching in multimedia databases
Proceedings of the tenth ACM international conference on Multimedia
VLDB '98 Proceedings of the 24rd 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
On Dimension Reduction Mappings for Approximate Retrieval of Multi-dimensional Data
Progress in Discovery Science, Final Report of the Japanese Discovery Science Project
Approximate similarity retrieval with M-trees
The VLDB Journal — The International Journal on Very Large Data Bases
Searching in metric spaces by spatial approximation
The VLDB Journal — The International Journal on Very Large Data Bases
Properties of Embedding Methods for Similarity Searching in Metric Spaces
IEEE Transactions on Pattern Analysis and Machine Intelligence
Index-driven similarity search in metric spaces (Survey Article)
ACM Transactions on Database Systems (TODS)
Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling)
A compact space decomposition for effective metric indexing
Pattern Recognition Letters
Similarity Search: The Metric Space Approach (Advances in Database Systems)
Similarity Search: The Metric Space Approach (Advances in Database Systems)
A Data Structure and an Algorithm for the Nearest Point Problem
IEEE Transactions on Software Engineering
A metric cache for similarity search
Proceedings of the 2008 ACM workshop on Large-Scale distributed systems for information retrieval
Hi-index | 0.00 |
Recently, the amount of multi-media data, such as movies, has been increasing rapidly. We often encounter situations which require fast and approximate retrieval of movies. A video is composed of multiple still images(frames). In this paper, we identify videos in real-time by performing retrieval of still images successively. When we use hierarchical similarity search indexes, results that are far away from a query are more costly to obtain than results that are close to a query. Far results are not useful for video identification. Nevertheless, it is important to know that no close results exist to correctly identify a video. The similarity between consecutive images is usually high because of the nature of video data. In this paper we propose a type of cache that exploits this fact by skipping queries that are likely not to have close results. We also employ an early termination strategy that avoids unnecessary distance computations to retrieve far results while preserving the quality of the video identification. By conducting experiments, we show that both methods provide considerable improvements. The proposed caching technique is able to skip up to 40% of the queries. The early termination strategy is able to reduce the number of distance computations to 0.5%. The combination of both techniques provides even greater gains.