Skip to Main content Skip to Navigation
Journal articles

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.
Document type :
Journal articles
Complete list of metadata

Cited literature [40 references]  Display  Hide  Download
Contributor : Eva Dokladalova Connect in order to contact the contributor
Submitted on : Friday, July 5, 2013 - 3:11:31 PM
Last modification on : Saturday, January 15, 2022 - 3:57:39 AM
Long-term archiving on: : Sunday, October 6, 2013 - 3:05:10 AM


Files produced by the author(s)



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⟩



Record views


Files downloads