A Comparison of Algorithms for Connected Set Openings and Closings

The implementation of morphological connected set operators for image filtering and pattern recognition is discussed. Two earlier algorithms based on priority queues and hierarchical queues, respectively, are compared to a more recent union-find approach. Unlike the earlier algorithms which process regional extrema in the image sequentially, the union-find method allows simultaneous processing of extrema. In the context of area openings, closings, and pattern spectra, the union-find algorithm outperforms the previous methods on almost all natural and synthetic images tested. Finally, extensions to pattern spectra and the more general class of attribute operators are presented for all three algorithms, and memory usages are compared.

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

[2]  J. Andrew Bangham,et al.  Scale-Space From Nonlinear Filters , 1996, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  J. Andrew Bangham,et al.  Scale-space from nonlinear filters , 1995, Proceedings of IEEE International Conference on Computer Vision.

[4]  Jos B. T. M. Roerdink,et al.  A disjoint set algorithm for the watershed transform , 1998, 9th European Signal Processing Conference (EUSIPCO 1998).

[5]  Philippe Salembier,et al.  Antiextensive connected operators for image and sequence processing , 1998, IEEE Trans. Image Process..

[6]  Pierre Chardaire,et al.  Multiscale Nonlinear Decomposition: The Sieve Decomposition Theorem , 1996, IEEE Trans. Pattern Anal. Mach. Intell..

[7]  Luc Vincent,et al.  Local Grayscale Granulometries Based on Opening Trees , 1996, ISMM.

[8]  Anastasios N. Venetsanopoulos,et al.  An adaptive morphological filter for image processing , 1992, IEEE Trans. Image Process..

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

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

[11]  Michael H. F. Wilkinson,et al.  Fast Morphological Attribute Operations Using Tarjan's Union-Find Algorithm , 2000, ISMM.

[12]  Michael H. F. Wilkinson,et al.  Fast computation of morphological area pattern spectra , 2001, Proceedings 2001 International Conference on Image Processing (Cat. No.01CH37205).

[13]  J. Andrew Bangham,et al.  Morphological scale-space preserving transforms in many dimensions , 1996, J. Electronic Imaging.

[14]  D. Foster,et al.  Shape in Picture: Mathematical Description Of Shape In Grey-Level Images , 2010 .

[15]  Michael H. F. Wilkinson,et al.  Shape Preserving Filament Enhancement Filtering , 2001, MICCAI.

[16]  Henk J. A. M. Heijmans.  Connected Morphological Operators for Binary Images , 1999, Comput. Vis. Image Underst..

[17]  Hanan Samet,et al.  A general approach to connected-component labeling for arbitrary image representations , 1992, JACM.

[18]  Christophe Fiorio,et al.  Two Linear Time Union-Find Strategies for Image Processing , 1996, Theor. Comput. Sci..

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

[20]  Coenraad Bron,et al.  Concurrent determination of connected components , 2001, Sci. Comput. Program..

[21]  Robert E. Tarjan,et al.  Efficiency of a Good But Not Linear Set Union Algorithm , 1972, JACM.

[22]  José Crespo,et al.  The flat zone approach: A general low-level region merging segmentation method , 1997, Signal Process..

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

[24]  L. Vincent.  Grayscale area openings and closings, their efficient implementation and applications , 1993 .

[25]  Luc Vincent,et al.  Morphological grayscale reconstruction in image analysis: applications and efficient algorithms , 1993, IEEE Trans. Image Process..

[26]  Mohamed A. Deriche,et al.  Scale-Space Properties of the Multiscale Morphological Dilation-Erosion , 1996, IEEE Trans. Pattern Anal. Mach. Intell..

[27]  J. Andrew Bangham,et al.  Nonlinear Scale-Space from n-Dimensional Sieves , 1996, ECCV.