Morphological Erosions and Openings: Fast Algorithms Based on Anchors

Several efficient algorithms for computing erosions and openings have been proposed recently. They improve on van Herk’s algorithm in terms of number of comparisons for large structuring elements. In this paper we introduce a theoretical framework of anchors that aims at a better understanding of the process involved in the computation of erosions and openings. It is shown that the knowledge of opening anchors of a signal f is sufficient to perform both the erosion and the opening of f.Then we propose an algorithm for one-dimensional erosions and openings which exploits opening anchors. This algorithm improves on the fastest algorithms available in literature by approximately 30% in terms of computation speed, for a range of structuring element sizes and image contents.

[1]  Jaakko T. Astola,et al.  Improving Gil-Werman Algorithm for Running Min and Max Filters , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[2]  Edward J. Coyle,et al.  Threshold decomposition of multidimensional ranked order operations , 1985 .

[3]  J. Pecht.  Speeding-up successive Minkowski operations with bit-plane computers , 1985, Pattern Recognit. Lett..

[4]  Scott C. Douglas.  Running max/min calculation using a pruned ordered list , 1996, IEEE Trans. Signal Process..

[5]  Ulrich Eckhardt,et al.  Root Images of Median Filters , 2003, Journal of Mathematical Imaging and Vision.

[6]  Marc Van Droogenbroeck.  Traitement d'images numériques au moyen d'algorithmes utilisant la morphologie mathématique et la notion d'objet : application au codage , 1994 .

[7]  Marc Van Droogenbroeck.  On the Implementation of Morphological Operations , 1994, ISMM.

[8]  H. Heijmans.  Morphological image operators , 1994 .

[9]  James B. Wiggins.  Openings and Closings , 1992 .

[10]  Luc Vincent.  Granulometries and Opening Trees , 2000, Fundam. Informaticae.

[11]  Henk J. A. M. Heijmans,et al.  A Lattice-Theoretical Framework for Annular Filters in Morphological Image Processing , 1998, Applicable Algebra in Engineering, Communication and Computing.

[12]  Jaakko Astola,et al.  On root structures of median and median-type filters , 1987, IEEE Trans. Acoust. Speech Signal Process..

[13]  M. Brookes.  Algorithms for max and min filters with improved worst-case performance , 2000 .

[14]  G. Wise,et al.  A theoretical analysis of the properties of median filters , 1981 .

[15]  G. Matheron.  Random Sets and Integral Geometry , 1976 .

[16]  David H. Eberly,et al.  Complete classification of roots to one-dimensional median and rank-order filters , 1991, IEEE Trans. Signal Process..

[17]  Luc Vincent,et al.  Morphological Area Openings and Closings for Grey-scale Images , 1994 .

[18]  Marcel van Herk.  A fast algorithm for local minimum and maximum filters on rectangular and octagonal kernels , 1992, Pattern Recognit. Lett..

[19]  Hitoshi Matsushima,et al.  A fast algorithm for maximum-minimum image filtering , 1996 .

[20]  Luc Vincent,et al.  Watersheds in Digital Spaces: An Efficient Algorithm Based on Immersion Simulations , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

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

[22]  Thomas S. Huang,et al.  A fast two-dimensional median filtering algorithm , 1979 .

[23]  Gonzalo R. Arce,et al.  Theoretical analysis of the max/Median filter , 1987, IEEE Trans. Acoust. Speech Signal Process..

[24]  Ioannis Pitas,et al.  On fast running max-min filtering , 1997 .

[25]  Serge Beucher,et al.  Use of watersheds in contour detection , 1979 .

[26]  Ioannis Pitas,et al.  Fast algorithms for running ordering and max/min calculation , 1989 .

[27]  Petros Maragos,et al.  Pattern Spectrum and Multiscale Shape Representation , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[28]  Hugues Talbot,et al.  Directional Morphological Filtering , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[29]  Henk J. A. M. Heijmans,et al.  The algebraic basis of mathematical morphology. I Dilations and erosions , 1990, Comput. Vis. Graph. Image Process..

[30]  Bidyut Baran Chaudhuri.  An efficient algorithm for running window pel gray level ranking in 2-D images , 1990, Pattern Recognit. Lett..

[31]  Petros Maragos,et al.  Morphological filters-Part II: Their relations to median, order-statistic, and stack filters , 1987, IEEE Trans. Acoust. Speech Signal Process..

[32]  Michael Werman,et al.  Computing 2-D Min, Median, and Max Filters , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[33]  J. W. Modestino,et al.  Flat Zones Filtering, Connected Operators, and Filters by Reconstruction , 1995 .

[34]  Ronald Jones,et al.  Attribute Openings, Thinnings, and Granulometries , 1996, Comput. Vis. Image Underst..

[35]  G. Arce,et al.  State description for the root-signal set of median filters , 1982 .

[36]  Ron Kimmel,et al.  Efficient Dilation, Erosion, Opening and Closing Algorithms , 2000, ISMM.

[37]  Xinhua Zhuang,et al.  Image Analysis Using Mathematical Morphology , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[38]  Henk J. A. M. Heijmans,et al.  The algebraic basis of mathematical morphology : II. Openings and closings , 1991, CVGIP Image Underst..

[39]  Marc Van Droogenbroeck,et al.  Fast computation of morphological operations with arbitrary structuring elements , 1996, Pattern Recognit. Lett..

[40]  Junior Barrera,et al.  Set operations on closed intervals and their applications to the automatic programming of morphological machines , 1996, J. Electronic Imaging.