Indecomposability problem in mathematical morphology

Pijush K. Ghosh; Robert M. Haralick

doi:10.1117/12.142162

9 April 1993 Indecomposability problem in mathematical morphology

Pijush K. Ghosh, Robert M. Haralick

Proceedings Volume 1832, Vision Geometry; (1993) https://doi.org/10.1117/12.142162
Event: Applications in Optical Science and Engineering, 1992, Boston, MA, United States

Abstract

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.

Citation Download Citation

Pijush K. Ghosh and Robert M. Haralick "Indecomposability problem in mathematical morphology", Proc. SPIE 1832, Vision Geometry, (9 April 1993); https://doi.org/10.1117/12.142162

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available