Binary Morphology With Spatially Variant Structuring Elements: Algorithm and Architecture

Summary, in English

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.

• Author: Hugo Hedberg; Petr Dokladal; Viktor Öwall
• Department/s: Department of Electrical and Information Technology
• Publishing year: 2009
• Language: English
• Pages: 562-572
• Publication/Series: IEEE Transactions on Image Processing
• Volume: 18
• Issue: 3
• Full text: - 889 kB; Download statistics
• Links: http://dx.doi.org/10.1109/TIP.2008.2010108
• Document type: Journal article
• Publisher: IEEE - Institute of Electrical and Electronics Engineers Inc.
• Topic: Electrical Engineering, Electronic Engineering, Information Engineering
• Keywords: Mathematical Morphology; spatially-variant structuring elements; hardware implementation
• Status: Published
• Research group: Elektronikkonstruktion; Digital ASIC
• ISBN/ISSN/Other: ISSN: 1941-0042