Analysing and simplifying histograms using scale-trees

S. Gibson, R. W. Harvey

Research output: Contribution to conferencePaper

2 Citations (Scopus)

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
Original languageEnglish
Pages84-89
Number of pages6
DOIs
Publication statusPublished - Sep 2001
EventProceedings of 11th International Conference on Image Analysis and Processing - Palermo, Italy
Duration: 26 Sep 200128 Sep 2001

Conference

ConferenceProceedings of 11th International Conference on Image Analysis and Processing
Country/TerritoryItaly
CityPalermo
Period26/09/0128/09/01

Cite this