Development of morphological operators for real‐time applications

Purpose – Classically, the mathematical morphology operators (i.e. erosion, dilation and its combinations) have not been implemented when working in real‐time constraints, as its computation time is often too high for this kind of applications. There are currently some approaches in order to solve this problem. The purpose of this paper is to present an alternative for this classical operators so as to speed up effectively their running time.Design/methodology/approach – The paper shows the algorithm, calculate the computational complexity and finally, implement the fast operators to compare the increasing velocity of this choice using different kind of gray‐scale images.Findings – The experimental results verify the theoretical results, as is pointed out throughout this work.Originality/value – Highlights two techniques for image processing using mathematical morphology.

[1]  Henk J. A. M. Heijmans,et al.  Theoretical Aspects of Gray-Level Morphology , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[2]  Jean Serra,et al.  Image Analysis and Mathematical Morphology , 1983 .

[3]  Jean Paul Frédéric Serra Connectivity on Complete Lattices , 2004, Journal of Mathematical Imaging and Vision.

[4]  Edward R. Dougherty,et al.  An introduction to morphological image processing , 1992 .

[5]  Pierre Soille,et al.  Morphological Image Analysis , 1999 .

[6]  Jos B. T. M. Roerdink,et al.  Computer Vision and Mathematical Morphology , 1994, Theoretical Foundations of Computer Vision.

[7]  Henk J. A. M. Heijmans,et al.  Fundamenta Morphologicae Mathematicae , 2000, Fundam. Informaticae.