Binary Morphology with Spatially Variant Structuring Elements: Algorithm and Architecture - Mines Paris Accéder directement au contenu
Article Dans Une Revue IEEE Transactions on Image Processing Année : 2009

Binary Morphology with Spatially Variant Structuring Elements: Algorithm and Architecture

Résumé

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.

Dates et versions

hal-00833293 , version 1 (12-06-2013)

Identifiants

Citer

Hugo Hedberg, Petr Dokládal, Viktor Owall. Binary Morphology with Spatially Variant Structuring Elements: Algorithm and Architecture. IEEE Transactions on Image Processing, 2009, 18 (3), pp.562 - 572. ⟨10.1109/TIP.2008.2010108⟩. ⟨hal-00833293⟩
96 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More