Analysing and simplifying histograms using scale-trees

Gibson, S. and Harvey, R. W. ORCID: (2001) Analysing and simplifying histograms using scale-trees. In: 11th International Conference on Image Analysis and Processing, 2001-09-26 - 2001-09-28.

Full text not available from this repository. (Request a copy)


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

Item Type: Conference or Workshop Item (Paper)
Faculty \ School: Faculty of Science > School of Computing Sciences
UEA Research Groups: Faculty of Science > Research Groups > Interactive Graphics and Audio
Faculty of Science > Research Groups > Smart Emerging Technologies
Depositing User: Vishal Gautam
Date Deposited: 18 Aug 2011 11:35
Last Modified: 23 Apr 2023 01:48
DOI: 10.1109/ICIAP.2001.956989

Actions (login required)

View Item View Item