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.
Type de document :
Communication dans un congrès
Pierre Soille, Martino Pesaresi, and Georgios K. Ouzounis. 10th International Symposium on Mathematical Morphology and Its Application to Signal and Image Processing, ISMM 2011, Jul 2011, Verbania-Intra, Italy. Springer, 6671, pp.296-305, 2011, Lecture Notes in Computer Science. 〈10.1007/978-3-642-21569-8_26〉
Liste complète des métadonnées

https://hal-mines-paristech.archives-ouvertes.fr/hal-00658959
Contributeur : Bibliothèque Mines Paristech <>
Soumis le : mercredi 11 janvier 2012 - 16:21:50
Dernière modification le : vendredi 27 octobre 2017 - 17:36:02

Identifiants

Citation

Jan Bartovsky, Petr Dokládal, Eva Dokladalova, Michel Bilodeau. Fast streaming algorithm for 1-D morphological opening and closing on 2-D support. Pierre Soille, Martino Pesaresi, and Georgios K. Ouzounis. 10th International Symposium on Mathematical Morphology and Its Application to Signal and Image Processing, ISMM 2011, Jul 2011, Verbania-Intra, Italy. Springer, 6671, pp.296-305, 2011, Lecture Notes in Computer Science. 〈10.1007/978-3-642-21569-8_26〉. 〈hal-00658959〉

Partager

Métriques

Consultations de la notice

290