.png){kind=icon}
Return
Gray-scale structuring element decomposition
.png){kind=icon}
OA
AI
DOI：10.1109/83.481675.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Efficient implementation of morphological operations requires the decomposition of structuring elements into the dilation of smaller structuring elements, Zhuang and Haralick presented a search algorithm to find optimal decompositions of structuring elements in binary morphology. In this paper, we use the concepts of Top of a set and Umbra of a surface to extend this algorithm to find an optimal decomposition of any arbitrary gray-scale structuring element.
Keywords:
THRESHOLD DECOMPOSITION
MORPHOLOGY
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
13.7
Papers:
1.0W
Citations:
8.4W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSaveShareSaveShareSave
View more