Max-polynomials and template decomposition

Dong Li

doi:10.1117/12.49891

1 July 1991 Max-polynomials and template decomposition

Dong Li

Proceedings Volume 1568, Image Algebra and Morphological Image Processing II; (1991) https://doi.org/10.1117/12.49891
Event: San Diego, '91, 1991, San Diego, CA, United States

Abstract

Template decomposition plays an important role in image processing algorithm optimization and parallel image processing. In this paper, a template decomposition technique based on the factorization of max-polynomials is presented. A morphological template may be represented by a max-polynomial, a notation used in combinatorial optimization. The problem of decomposition of a morphological template is thus reduced to the problem of factorization of the corresponding max-polynomial. A sufficient condition for decomposing a one-dimensional morphological template into a set of two-point templates is established. Once the condition is satisfied, the construction of the decomposition is straightforward. A general procedure is also given for testing whether such a decomposition exists for an arbitrary one-dimensional morphological template.

Citation Download Citation

Dong Li "Max-polynomials and template decomposition", Proc. SPIE 1568, Image Algebra and Morphological Image Processing II, (1 July 1991); https://doi.org/10.1117/12.49891

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