Translator Disclaimer
1 November 1989 Representation Theorems In A L-Fuzzy Set Theory Based Algebra For Morphology
Author Affiliations +
Proceedings Volume 1199, Visual Communications and Image Processing IV; (1989) https://doi.org/10.1117/12.970055
Event: 1989 Symposium on Visual Communications, Image Processing, and Intelligent Robotics Systems, 1989, Philadelphia, PA, United States
Abstract
Perhaps the most promising area of morphological image processing is that dealing with morphological filters. An image to image mapping is called a morphological filter if it is increasing and translation compatible. In other words, morphological filters preserve the natural set theoretic ordering and are space invariant. Examples of such filters are the convex hull operator, the topological closure, the umbra transform and various other topological algorithms [2-4]. Matheron showed that all such mappings can be characterized by the set theoretic operations erosion and dilation. His representation theorems has been adapted to digital images with great success [4].
© (1989) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Divyendu Sinha and Charles R. Giardina "Representation Theorems In A L-Fuzzy Set Theory Based Algebra For Morphology", Proc. SPIE 1199, Visual Communications and Image Processing IV, (1 November 1989); https://doi.org/10.1117/12.970055
PROCEEDINGS
11 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT

Morphological Networks
Proceedings of SPIE (November 01 1989)
Mathematical Morphology On Graphs
Proceedings of SPIE (October 25 1988)
Gray-scale image processing using topological operators
Proceedings of SPIE (September 23 1999)
Modeling of automobile part based on CCD camera system
Proceedings of SPIE (September 13 1995)
Collusion attack to a scalable AND-ACC fingerprinting scheme
Proceedings of SPIE (January 29 2007)
Morphological Convolution Operations For Image Processing
Proceedings of SPIE (November 01 1989)

Back to Top