Elsevier

Pattern Recognition

Volume 29, Issue 9, September 1996, Pages 1519-1522
Pattern Recognition

A simplified algorithm for approximate separable decomposition of morphological templates

https://doi.org/10.1016/0031-3203(96)00012-XGet rights and content

Abstract

Decomposition of morphological templates is a useful technique for enhancing the computational efficiency of morphological image processing operations. This paper presents a simplified algorithm for obtaining approximate separable decomposition of grayscale morphological templates. This algorithm is computationally less intensive as compared to Gader's(1 2) algorithm in yielding the separable parts of a given template. Further, it overcomes the drawback of Gader's algorithm by providing integer weight separable parts for integer weight morphological separable templates.

References (15)

There are more references available in the full text version of this article.

Cited by (2)

  • Image Analysis and Computer Vision: 1996

    1997, Computer Vision and Image Understanding
  • Statistical characterization of morphological operator sequences

    2002, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
View full text