2001 · 44 citations · 15 references
ComputingComputer ScienceData StructuresDatabasesInformation RetrievalColor RepresentationColor Space RepresentationHash FunctionsHash TablesImage RetrievalNearest Neighbor SearchFilteringHash-based SearchHashingHistogram MatchingHistogramsSimilarity MetricsSimilarity TheorySimilarity-based Querying
Abstract We propose multi-precision similarity matchingwhere the image is divided into a number of subblocks, each with its associated color histogram.We present experimental results showing that the spatial distribution information recorded by multi-precision color histograms helps to make similarity matching more precise. We also showthat sub-image queries are much better supported with multi-precision color histograms. To mini-mize the overhead, we employ a filtering scheme based on the 3-dimensional average color vectors.We provide a formal result proving that filtering with multi-precision color histograms is complete.Finally, we develop a novel extendible hashing structure for indexing the average color vectors.We give experimental results showing that the proposed structure significantly outperforms theSR-tree.
15
Matthew Turk, Alex Pentland · Journal of Cognitive Neuroscience · 1991 · 13.8K citations · Full text
Michael J. Swain, Dana H. Ballard · International Journal of Computer Vision · 1991 · 5.6K citations
The R*-tree: an efficient and robust access method for points and rectangles
Norbert Beckmann, Hans‐Peter Kriegel, Ralf Schneider et al. · 1990 · 4.2K citations · Full text
Efficient and effective Querying by Image Content
Christos Faloutsos, Ronald Barber, Myron Flickner et al. · Journal of Intelligent Information Systems · 1994 · 1.3K citations
J. Nievergelt, Hans Hinterberger, Kenneth C. Sevcik · ACM Transactions on Database Systems · 1984 · 1.1K citations · Full text