The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—Sieves decompose one dimensional bounded functions, e.g., <it>f</it> to a sequence of increasing scale granule functions, <tmath>$\{d_m\}_{m=1}^R$</tmath> 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 (<it>M</it> and <it>N</it> filters) map <it>f</it> to {<it>d</it>} and the re-composition, consisting of adding up all the granule functions, maps {<it>d</it>} to <it>f</it>. Experiments show that a more general property exists such that <tmath>$\{\hat d\}$</tmath> maps to <tmath>$\hat f$</tmath> and back to <tmath>$\{\hat d\}$,</tmath> where the granule functions <tmath>$\{\hat d\}$,</tmath> are obtained from {<it>d</it>} 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.</p>
Mathematical morphology, median filters, ordinal filters, rank, granularity, granulometry.
Paul D. Ling, C. Jeremy Pye, Pierre Chardaire, J. Andrew Bangham, "Multiscale Nonlinear Decomposition: The Sieve Decomposition Theorem", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 18, no. , pp. 529-539, May 1996, doi:10.1109/34.494642
99 ms
(Ver 3.3 (11022016))