1 March 1992 Optimal decomposition of arbitrary-shaped structuring elements into neighborhood subsets
Author Affiliations +
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.
© (1992) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Xiaoyi Jiang, Xiaoyi Jiang, Horst Bunke, Horst Bunke, } "Optimal decomposition of arbitrary-shaped structuring elements into neighborhood subsets", Proc. SPIE 1708, Applications of Artificial Intelligence X: Machine Vision and Robotics, (1 March 1992); doi: 10.1117/12.58615; https://doi.org/10.1117/12.58615
PROCEEDINGS
12 PAGES


SHARE
RELATED CONTENT


Back to Top