Linear openings in arbitrary orientation in O(1) per pixel

Abstract : Openings constitute one of the fundamental operators in mathematical morphology. They can be applied to a wide range of applications, including noise reduction and feature extraction and enhancement. In this paper, we introduce a new, efficient and adaptable algorithm to compute one dimensional openings along discrete lines, in arbitrary orientation. The complexity of this algorithm is linear with respect to the number of pixels of the image. More interestingly, the average complexity per pixel is constant, with respect to the size of the opening.
Type de document :
Communication dans un congrès
36th IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2011, May 2011, Prague, Czech Republic. pp.Article number 5946767, Pages 1457-1460, 2011, <10.1109/ICASSP.2011.5946767>
Liste complète des métadonnées

https://hal-mines-paristech.archives-ouvertes.fr/hal-00658922
Contributeur : Doriane Ibarra <>
Soumis le : mercredi 11 janvier 2012 - 15:49:06
Dernière modification le : mardi 12 septembre 2017 - 11:40:48

Identifiants

Collections

Citation

Vincent Morard, Petr Dokládal, Etienne Decencière. Linear openings in arbitrary orientation in O(1) per pixel. 36th IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2011, May 2011, Prague, Czech Republic. pp.Article number 5946767, Pages 1457-1460, 2011, <10.1109/ICASSP.2011.5946767>. <hal-00658922>

Partager

Métriques

Consultations de la notice

101