Multiscale nonlinear decomposition: The sieve decomposition theorem

J. A. Bangham, P. Chardaire, C. J. Pye, P. D. Ling

Research output: Contribution to journalArticle

54 Citations (Scopus)


Sieves decompose one dimensional bounded functions (d/sub m/)/sub m=1//sup R/ that represent the information in a manner that is analogous to the pyramid of wavelets obtained by linear decomposition. Sieves based on sequences of increasing scale open-closings with flat structuring elements (M and N filters) map f to {d} and the recomposition, consisting of adding up all the granule functions, maps {d} to f. Experiments show that a more general property exists such that {d/spl circ/} maps to f/spl circ/ and back to {d/spl circ/} where the granule functions {d/spl circ/} are obtained from {d} by applying any operator /spl alpha/ consisting of changing the amplitudes of some granules, including zero, without changing their signs. In other words, the set of granule function vectors produced by the decomposition is closed under the operation /spl alpha/. An analytical proof of this property is presented. This property means that filters are useful in the context of feature recognition and, in addition, opens the way for an analysis of the noise resistance of sieves.
Original languageEnglish
Pages (from-to)529-539
Number of pages11
JournalIEEE Transactions on Pattern Analysis and Machine Intelligence
Issue number5
Publication statusPublished - May 1996

Cite this