Abstract
Soft morphological filters are used for smoothing signals with the advantage of being less sensitive to additive noises and to small variations in the shape of the objects to be transformed as compared to standard morphological filters. In this paper, we present the properties of soft morphological operations and the new definitions of binary soft morphological operations. It is shown that soft morphological filtering an arbitrary signal is equivalent to decomposing the signal into binary signals, filtering each binary signal with a binary soft morphological filter, and then reversing the decomposition. This equivalence allows problems in the analysis and the implementation of soft morphological operations in real time by using only logic gates for binary signals instead of sorting numbers.
| Original language | English (US) |
|---|---|
| Title of host publication | IEEE Computer Vision and Pattern Recognition |
| Editors | Anon |
| Publisher | Publ by IEEE |
| Pages | 672-673 |
| Number of pages | 2 |
| ISBN (Print) | 0818638826 |
| State | Published - Dec 1 1993 |
| Event | Proceedings of the 1993 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - New York, NY, USA Duration: Jun 15 1993 → Jun 18 1993 |
Other
| Other | Proceedings of the 1993 IEEE Computer Society Conference on Computer Vision and Pattern Recognition |
|---|---|
| City | New York, NY, USA |
| Period | 6/15/93 → 6/18/93 |
All Science Journal Classification (ASJC) codes
- Engineering(all)