.png){kind=icon}
Return
Decomposition of arbitrary gray-scale morphological structuring elements
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patcog.2005.04.003.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Mathematical morphology has been widely used for many applications in image processing and analysis. Most image processing architectures adapted to morphological operations use structuring elements of a limited size. Therefore, difficulties arise when we deal with a large-sized structuring element. In this paper, we present algorithms for the decomposition of arbitrary gray-scale structuring elements into combined dilations or maximum operators of smaller structuring components. Our method does not need to perform additional pre-processes, such as checking the type of structuring elements and the decomposition rules. Furthermore, it is suited for a parallel pipelined architecture. (c) 2005 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.
Keywords:
mathematical morphology
image processing
structuring element
decomposition
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.6
Papers:
1.3W
Citations:
4.5W
Organization
No organization information available
Cited Papers
ShareSave
Atomistic Study of the Role of Defects on α → ϵ Phase Transformations in Iron under Hydrostatic Compression.png)
Metals
OAAI
MetalsIF0
OAAIShareSaveShareSaveShareSaveShareSave
View more