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.
|Number of pages||6|
|Publication status||Published - Dec 2001|
|Event||Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Kauai, HI, United States|
Duration: 8 Dec 2001 → 14 Dec 2001
|Conference||Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition|
|Period||8/12/01 → 14/12/01|