Fast streaming algorithm for 1-D morphological opening and closing on 2-D support

Authors:
Jan Bartovsky;Petr Dokladal;Eva Dokladalova;Michel Bilodeau
Affiliations:
Center of Mathematical Morphology, Mines ParisTech, Fontainebleau and Laboratoire d'Informatique Gaspard Monge, University Paris-Est, Noisy le Grand Cedex, France and Faculty of Electrical Enginee ...;Center of Mathematical Morphology, Mines ParisTech, Fontainebleau, France;Laboratoire d'Informatique Gaspard Monge, University Paris-Est, Noisy le Grand Cedex, France;Center of Mathematical Morphology, Mines ParisTech, Fontainebleau, France
Venue:
ISMM'11 Proceedings of the 10th international conference on Mathematical morphology and its applications to image and signal processing
Year:
2011

Citing 7
Cited 0

A fast algorithm for local minimum and maximum filters on rectangular and octagonal kernels

Pattern Recognition Letters
Granulometries and opening trees

Fundamenta Informaticae - Special issue on mathematical morphology
Efficient Dilation, Erosion, Opening, and Closing Algorithms

IEEE Transactions on Pattern Analysis and Machine Intelligence
Morphological Erosions and Openings: Fast Algorithms Based on Anchors

Journal of Mathematical Imaging and Vision
Image Analysis and Mathematical Morphology

Image Analysis and Mathematical Morphology
Streaming maximum-minimum filter using no more than three comparisons per element

Nordic Journal of Computing
Grey-Scale Morphology with Spatially-Variant Rectangles in Linear Time

ACIVS '08 Proceedings of the 10th International Conference on Advanced Concepts for Intelligent Vision Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new streaming algorithm for 1-D morphological opening and closing transformations on 2-D support. Thanks to a recursive computation technique, the algorithm processes an image in constant time irrespective of the Structuring Element (SE) size, with a minimal latency and very low memory requirements, supporting various input data types. It reads and writes data strictly sequentially in the same (horizontal) scan order for both the horizontal and vertical SE. Aforementioned properties allow an efficient implementation in embedded hardware opening a new opportunity of a parallel computation.