Computationally efficient, one-pass algorithm for morphological filters - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Visual Communication and Image Representation Année : 2011

Computationally efficient, one-pass algorithm for morphological filters

Petr Dokládal
Eva Dokladalova

Résumé

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.
Fichier principal
Vignette du fichier
Efficient_Morpho_Filters_JVCI_2011_preprint.pdf (278.94 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00692897 , version 1 (05-07-2013)

Identifiants

Citer

Petr Dokládal, Eva Dokladalova. Computationally efficient, one-pass algorithm for morphological filters. Journal of Visual Communication and Image Representation, 2011, 22 (5), pp.411--420. ⟨10.1016/j.jvcir.2011.03.005⟩. ⟨hal-00692897⟩
1489 Consultations
4407 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More