By Topic

Multiscale nonlinear decomposition: the sieve decomposition theorem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Bangham, J.A. ; Sch. of Inf. Syst., East Anglia Univ., Norwich, UK ; Chardaire, P. ; Pye, C.J. ; Ling, P.D.

Sieves decompose one dimensional bounded functions (dm) m=1R 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ˆ} maps to fˆ and back to {dˆ} where the granule functions {dˆ} are obtained from {d} by applying any operator α 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 α. 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

Published in:

Pattern Analysis and Machine Intelligence, IEEE Transactions on  (Volume:18 ,  Issue: 5 )