Computationally efficient, one-pass algorithm for morphological filters
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.
Mots clés
Computationally efficient
Constant time
Efficient implementation
Image sizes
Linear time
Memory requirements
Memory usage
Morphological dilation
Morphological filters
Morphological operator
Nonlinear filter
One-pass
Real-time implementations
Sequential filter
Structuring element
Time-critical applications
Algorithm
Mathematical morphology
Nonlinear filters
Real-time implementation
Serial filters
Streaming
Domaines
Automatique
Fichier principal
Efficient_Morpho_Filters_JVCI_2011_preprint.pdf (278.94 Ko)
Télécharger le fichier
Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...