A new method for analysing image histograms is introduced. The technique decomposes a histogram into probability level sets. The relationships between these level sets are encoded using a tree. The tree has fewer nodes than the histogram and so is a compressed feature. When used in image retrieval experiments the tree is shown to have a performance that is superior to many methods and no worse than the best alternatives. The tree is efficient because it can be built using a computationally efficient algorithm known as a sieve.
Analysing and simplifying histograms using scale-trees
2001-01-01
778679 byte
Conference paper
Electronic Resource
English
Analysing and Simplifying Histograms Using Scale-Trees
British Library Conference Proceedings | 2001
|NTRS | 1979
|Automotive engineering | 2001
|Automotive engineering | 2015
|Sports Classification Using Cross-Ratio Histograms
Springer Verlag | 2007
|