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
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
VideoQ: an automated content based video search system using visual cues
MULTIMEDIA '97 Proceedings of the fifth ACM international conference on Multimedia
An efficient nearest-neighbour search while varying Euclidean metrics
MULTIMEDIA '98 Proceedings of the sixth ACM international conference on Multimedia
Efficient and cost-effective techniques for browsing and indexing large video databases
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Searching Multimedia Databases by Content
Searching Multimedia Databases by Content
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Fast and Effective Retrieval of Medical Tumor Shapes
IEEE Transactions on Knowledge and Data Engineering
Efficient Retrieval of Similar Time Sequences Under Time Warping
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
MindReader: Querying Databases Through Multiple Examples
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Hi-index | 0.00 |
In this paper, we present a novel approach for efficient search of shots by the colors of objects that exist in the wanted shots. The idea is to map the color histogram, which represents the color content, of each object in the shot from the high-dimensional feature space into a point in a low-dimensional distance space. Then, a spatial access method, such as an R-tree, is used to cluster these points based on their distances in the low-dimensional space. Our mapping method, called topological mapping, guarantees no false dismissals in the result of a query. However, the result of a query might contain some false alarms. Hence, two refinement steps are performed to remove these false alarms. Comparative experiments show the superiority in efficiency of the topological mapping method over other methods.