loading...
Analysing and Simplifying Histograms Using Scale-Trees
Palermo, Italy September 26-September 28
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICIAP.2001.95698911th International Conference on Imag ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Stuart Gibson, University of East Anglia
Richard Harvey, University of East Anglia
Abstract: 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.
Citation:
Stuart Gibson, Richard Harvey, "Analysing and Simplifying Histograms Using Scale-Trees," iciap, pp.0084, 11th International Conference on Image Analysis and Processing (ICIAP'01), 2001
Usage of this product signifies your acceptance of the Terms of Use.