Skip to Main content Skip to Navigation
Conference papers

Fast streaming algorithm for 1-D morphological opening and closing on 2-D support

Abstract : This paper presents a new streaming algorithm for 1-D morphological opening and closing transformations on 2-D support. Thanks to a recursive computation technique, the algorithm processes an image in constant time irrespective of the Structuring Element (SE) size, with a minimal latency and very low memory requirements, supporting various input data types. It reads and writes data strictly sequentially in the same (horizontal) scan order for both the horizontal and vertical SE. Aforementioned properties allow an efficient implementation in embedded hardware opening a new opportunity of a parallel computation.
Document type :
Conference papers
Complete list of metadata

https://hal-mines-paristech.archives-ouvertes.fr/hal-00658959
Contributor : Bibliothèque Mines Paristech Connect in order to contact the contributor
Submitted on : Wednesday, January 11, 2012 - 4:21:50 PM
Last modification on : Wednesday, February 3, 2021 - 7:54:26 AM

Links full text

Identifiers

Citation

Jan Bartovsky, Petr Dokládal, Eva Dokladalova, Michel Bilodeau. Fast streaming algorithm for 1-D morphological opening and closing on 2-D support. 10th International Symposium on Mathematical Morphology and Its Application to Signal and Image Processing, ISMM 2011, Jul 2011, Verbania-Intra, Italy. pp.296-305, ⟨10.1007/978-3-642-21569-8_26⟩. ⟨hal-00658959⟩

Share

Metrics

Record views

1503