A simplified algorithm for approximate separable decomposition of morphological templates

摘要

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.