Optimal decomposition of arbitrary-shaped structuring elements into neighborhood subsets

摘要

Abstract: To efficiently perform morphological operations on neighborhood-processing- based parallel image computers, we need to decompose structuring elements larger than the neighborhood that can be directly handled into neighborhood subsets. In this paper we give an algorithm for the optimal decomposition of arbitrary-shaped structuring elements. !16