Skip to main content
Log in

Morphological template decomposition with max-polynomials

  • Published:
Journal of Mathematical Imaging and Vision Aims and scope Submit manuscript

Abstract

Template decomposition is important 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. G.X. Ritter and P.D. Gader, “Image Algebra Techniques for Parallel Image Processing,” Parallel Dist. Comput., vol. 4(5), 1987, pp. 7–44.

    Google Scholar 

  2. J.S. Wiejak, H. Buxton, and B.F. Buxton, “Convolution with Separable masks for Early Image Processing,” Comput. Vis., Graph., Image Proces., vol. 32, 1985, pp. 279–290.

    Google Scholar 

  3. X. Zhuang and R. M. Haralick, “Morphological Structuring Element Decomposition,” Comput. Vis., Graph., Image Process., vol. 35, 1986, pp. 370–382.

    Google Scholar 

  4. S.Y. Lee and J.K. Aggarwal, “Parallel 2-D Convolution on a Mesh Connected Array Processor,” IEEE Trans. Patt. Anal. Mach. Intell., vol. 9, 1987, pp. 590–594.

    Google Scholar 

  5. J. Xu, “Optimal Morphological Structuring Element Decomposition for Neighborhood Connected Array Processors,” in Proc. International Conference on Pattern Recognition, 1989.

  6. J.L. Davidson, “Lattice Structures in the Image Algebra and Their Applications to Image Processing,” Ph.D. thesis, University of Florida, Gainesville, FL, 1989.

  7. D. Li and G.X. Ritter, “Decomposition of Separable and Symmetric Convex Templates,” in Proc. SPIE 1990 International Symposium on Optical Applied Science and Engineering, San Diego, CA, July 1990.

  8. R.R. Cuninghame-Green and P.F.J. Meijer, “An Algebra for Piecewise-Linear Minimax Problems,” Discrete Appl. Math., vol. 2, 1980, pp. 267–294.

    Google Scholar 

  9. G.X. Ritter, J.N. Wilson, and J.L. Davidson, “Image Algebra: An Overview,” Comput. Vis., Graph., Image Process., vol. 49, 1990, pp. 297–331.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, D. Morphological template decomposition with max-polynomials. J Math Imaging Vis 1, 215–221 (1992). https://doi.org/10.1007/BF00129876

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00129876

Key Words

Navigation