Translator Disclaimer
9 April 1993 Indecomposability problem in mathematical morphology
Author Affiliations +
Proceedings Volume 1832, Vision Geometry; (1993)
Event: Applications in Optical Science and Engineering, 1992, Boston, MA, United States
The indecomposable sets are those which cannot be expressed as a Minkowski sum in any nontrivial manner. In this paper we concentrate on the indecomposability problem for sets in the domain of binary images. We show that, it is possible to express a binary image as a hypercomplex algebraic number. More interestingly, if we restrict our domain of binary images then Minkowski addition (direct sum) (also called dilation) turns out to be the addition of two such hypercomplex numbers. In that process the indecomposability problem is transformed into a number theoretic problem. As a by-product our treatment of the problem produces an efficient algorithm for computing Minkowski addition of two binary images.
© (1993) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Pijush K. Ghosh and Robert M. Haralick "Indecomposability problem in mathematical morphology", Proc. SPIE 1832, Vision Geometry, (9 April 1993);


Statistical characterization of digital lines
Proceedings of SPIE (April 09 1993)
Morphological Cellular Logic Image Processor Architectures
Proceedings of SPIE (January 09 1984)
Directional fibers analysis
Proceedings of SPIE (August 21 1996)
Automatic micropropagation of plants
Proceedings of SPIE (December 18 1996)
Applications of matrix morphology
Proceedings of SPIE (November 01 1990)

Back to Top