Fast implementation of the ultimate opening

Abstract : We present an efficient implementation of the ultimate attribute opening operator. In this implementation, the ultimate opening is computed by processing the image maxtree representation. To show the efficiency of this implementation, execution time is given for various images at different scales. A quasi-linear dependency with the number of pixels is observed. This new implementation makes the ultimate attribute opening usable in real time. Moreover, the use of the maxtree allows us to process specific zones of the image independently, with a negligible additional computation time.
Type de document :
Communication dans un congrès
Michael H. F. Wilkinson and Jos B. T. M. Roerdink. 9th International Symposium on Mathematical Morphology and Its Application to Signal and Image Processing, ISMM 2009, Aug 2009, Groningen, Netherlands. Springer, 5720, pp.272-281, 2009, Lecture Notes in Computer Science. <10.1007/978-3-642-03613-2_25>
Liste complète des métadonnées

https://hal-mines-paristech.archives-ouvertes.fr/hal-00834197
Contributeur : Doriane Ibarra <>
Soumis le : vendredi 14 juin 2013 - 14:27:34
Dernière modification le : mardi 12 septembre 2017 - 11:41:06

Identifiants

Collections

Citation

Jonathan Fabrizio, Beatriz Marcotegui. Fast implementation of the ultimate opening. Michael H. F. Wilkinson and Jos B. T. M. Roerdink. 9th International Symposium on Mathematical Morphology and Its Application to Signal and Image Processing, ISMM 2009, Aug 2009, Groningen, Netherlands. Springer, 5720, pp.272-281, 2009, Lecture Notes in Computer Science. <10.1007/978-3-642-03613-2_25>. <hal-00834197>

Partager

Métriques

Consultations de la notice

132