.png){kind=icon}
.png){kind=icon}
Return
Binary Morphology With Spatially Variant Structuring Elements: Algorithm and Architecture
.png){kind=icon}
OA
AI
DOI：10.1109/TIP.2008.2010108.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Mathematical morphology with spatially variant structuring elements outperforms translation-invariant structuring elements in various applications and has been studied in the literature over the years. However, supporting a variable structuring element shape imposes an overwhelming computational complexity, dramatically increasing with the size of the structuring element. Limiting the supported class of structuring elements to rectangles has allowed for a fast algorithm to be developed, which is efficient in terms of number of operations per pixel, has a low memory requirement, and a low latency. These properties make this algorithm useful in both software and hardware implementations, not only for spatially variant, but also translation-invariant morphology. This paper also presents a dedicated hardware architecture intended to be used as an accelerator in embedded system applications, with corresponding implementation results when targeted for both field programmable gate arrays and application specific integrated circuits.
Keywords:
Hardware implementation
mathematical morphology
spatially variant structuring elements
Journal
IF:
13.7
Papers:
1.0W
Citations:
8.4W