Color histograms are a central feature in many image retrieval systems. Indeed they are part of the MPEG-7 standard. But histograms suffer from the "curse of dimensionality " in which the number of bins increases exponentially with the number of dimensions. There is therefore an imperative for methods for simplifying histograms. This paper presents a new method for simplifying histograms based on a cascade of increasing-scale graph morphology filters. The system we choose preserves scale space causality and so preserves the modes of the histogram. The method is quick to compute so is therefore a practically useful feature. We present results using the MPEG-7 Common Color Dataset that show that these new compressed features have a retrieval performance that is equivalent to full histograms.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Morphological color quantization


    Contributors:
    Gibson, S. (author) / Harvey, R. (author)


    Publication date :

    2001-01-01


    Size :

    682851 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Morphological Color Quantization

    Gibson, S. / Harvey, R. / IEEE | British Library Conference Proceedings | 2001


    Contextual Color Quantization Algorithm

    Yu, M. / Lo, K. / IEEE | British Library Conference Proceedings | 2001


    Contextual color quantization algorithm

    Yu, M.P. / Lo, K.C. | IEEE | 2001


    Color Image Quantization Using Color Variation Measure

    Chang, Yu-Chou / Lee, Dah-Jye | IEEE | 2007


    Contextual algorithm for color quantization

    Yu, M. P. / Lo, K. C. | British Library Online Contents | 2003