Share Email Print

Proceedings Paper

Max-polynomials and template decomposition
Author(s): Dong Li
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 1 July 1991
PDF: 8 pages
Proc. SPIE 1568, Image Algebra and Morphological Image Processing II, (1 July 1991); doi: 10.1117/12.49891
Show Author Affiliations
Dong Li, Embry-Riddle Aeronautical Univ. (United States)

Published in SPIE Proceedings Vol. 1568:
Image Algebra and Morphological Image Processing II
Paul D. Gader; Edward R. Dougherty, Editor(s)

© SPIE. Terms of Use
Back to Top