Computationally efficient, one-pass algorithm for morphological filters

Abstract : Many useful morphological filters are built as long concatenations of erosions and dilations: openings, closings, size distributions, sequential filters, etc. This paper proposes a new algorithm implementing morphological dilation and erosion of functions. It supports rectangular structuring element, runs in linear time w.r.t. the image size and constant time w.r.t. the structuring element size, and has minimal memory usage. It has zero algorithm latency and processes data in stream. These properties are inherited by operators composed by concatenation, and allow their efficient implementation. We show how to compute in one pass an Alternate Sequential Filter (ASF(n)) regardless the number of stages n. This algorithm opens the way to such time-critical applications where the complexity and memory requirements of serial morphological operators represented a bottleneck limiting their usability. (C) 2011 Elsevier Inc. All rights reserved.
Type de document :
Article dans une revue
Journal of Visual Communication and Image Representation, Elsevier, 2011, 22 (5), pp.411--420. <10.1016/j.jvcir.2011.03.005>
Liste complète des métadonnées


https://hal-upec-upem.archives-ouvertes.fr/hal-00692897
Contributeur : Eva Dokladalova <>
Soumis le : vendredi 5 juillet 2013 - 15:11:31
Dernière modification le : mardi 12 septembre 2017 - 11:41:37
Document(s) archivé(s) le : dimanche 6 octobre 2013 - 03:05:10

Fichier

Efficient_Morpho_Filters_JVCI_...
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

Petr Dokládal, Eva Dokladalova. Computationally efficient, one-pass algorithm for morphological filters. Journal of Visual Communication and Image Representation, Elsevier, 2011, 22 (5), pp.411--420. <10.1016/j.jvcir.2011.03.005>. <hal-00692897>

Partager

Métriques

Consultations de
la notice

305

Téléchargements du document

963