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.<>


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Efficient color histogram indexing


    Contributors:


    Publication date :

    1994-01-01


    Size :

    513427 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Efficient Color Histogram Indexing

    Sawhney, H. S. / Hafner, J. L. / IEEE; Signal Processing Society | British Library Conference Proceedings | 1994


    The capacity of color histogram indexing

    Stricker / Swain | IEEE | 1994


    Adaptive color histogram indexing [2606-20]

    Ng, V. / Cheung, D. W. / Fu, A. et al. | British Library Conference Proceedings | 1995


    Image Indexing using Weighted Color Histogram

    Park, D. / Park, J. / Kim, T. et al. | British Library Conference Proceedings | 1999


    The Capacity of Color Histogram Indexing

    Stricker, M. / Swain, M. / Institute of Electrical and Electronics Engineers; Computer Society | British Library Conference Proceedings | 1994