In image retrieval based on color, the weighted distance between color histograms of two images, represented as a quadratic form, may be defined as a match measure. However, this distance measure is computationally expensive (naively O(N/sup 2/) and at best O(N) in the number N of histogram bins) and it operates on high dimensional features (O(N)). We propose the use of low-dimensional, simple to compute distance measures between the color distributions, and show that these are lower bounds on the histogram distance measure. Results on color histogram matching in large image databases show that pre-filtering with the simpler distance measures leads to significantly less time complexity because the quadratic histogram distance is now computed on a smaller set of images. The low-dimensional distance measure can also be used for indexing into the database.<>
Efficient color histogram indexing
Proceedings of 1st International Conference on Image Processing ; 2 ; 66-70 vol.2
1994-01-01
513427 byte
Conference paper
Electronic Resource
English
Efficient Color Histogram Indexing
British Library Conference Proceedings | 1994
|The capacity of color histogram indexing
IEEE | 1994
|Adaptive color histogram indexing [2606-20]
British Library Conference Proceedings | 1995
|Image Indexing using Weighted Color Histogram
British Library Conference Proceedings | 1999
|The Capacity of Color Histogram Indexing
British Library Conference Proceedings | 1994
|