This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Comparison of Algorithms for Connected Set Openings and Closings
April 2002 (vol. 24 no. 4)
pp. 484-494

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] J.A. Bangham, P. Chardaire, C.J. Pye, and P.D. Ling, “Mulitscale Nonlinear Decomposition: The Sieve Decomposition Theorem,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 18, no. 5, pp. 529-539, May 1996.
[2] J.A. Bangham, R. Harvey, P.D. Ling, and R.V. Aldridge, “Morphological Scale-Space Preserving Transforms in Many Dimensions,” J. Electronic Imaging, vol. 5, pp. 283-299, 1996.
[3] J.A. Bangham, R. Harvey, P. Ling, and R.V. Aldridge, “Nonlinear Scale-Space fromn-Dimensional Sieves,” Proc. European Conf. Computer Vision, vol. 1, pp. 189-198, 1996.
[4] J.A. Bangham, P. Ling, and R. Harvey, “Scale-Space from Nonlinear Filters,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 18, no. 5, pp. 520-528, May 1996.
[5] E.J. Breen and R. Jones, “Attribute Openings, Thinnings, and Granulometries,” Computer Vision and Image Understanding, vol. 64, no. 3, pp. 377-389, 1996.
[6] F. Cheng and A.N. Venetsanopoulos, “An Adaptive Morphological Filter for Image Processing,” IEEE Trans. Image Processing, vol. 1, pp. 533-539, 1992.
[7] J. Crespo, R.W. Schafer, J. Serra, C. Gratin, and F. Meyer, “The Flat Zone Approach: A General Low-Level Region Merging Segmentation Method,” Signal Processing, vol. 62, pp. 37-60, 1997.
[8] M.B. Dillencourt, H. Samet, and M. Tamminen, “A General Approach to Connected-Component Labeling for Arbitrary Image Representations,” J. ACM, vol. 39, pp. 253-280, 1992.
[9] C. Fiorio and J. Gustedt, “Two Linear Time Union-Find Strategies for Image Processing,” Theoretical Computer Science A, vol. 154, pp. 165-181, 1996.
[10] H.J.A.M. Heijmans, “Connected Morphological Operators for Binary Images,” Computer Vision and Image Understanding, vol. 73, pp. 99-120, 1999.
[11] W.H. Hesselink, A. Meijster, and C. Bron, “Concurrent Determination of Connected Components,” Science of Computer Programming, vol. 41, pp. 173-194, 2001.
[12] P.T. Jackway and M. Deriche, “Scale-Space Properties of the Multiscale Morphological Dilation-Erosion,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 18, no. 1, pp. 38-51, Jan. 1996.
[13] G. Matheron, Random Sets and Integral Geometry. John Wiley, 1975.
[14] A. Meijster and J.B.T.M. Roerdink, “A Disjoint Set Algorithm for the Watershed Transform,” Proc. EUSIPCO '98, IX European Signal Processing Conf., pp. 1665-1668, 1998.
[15] A. Meijster and M.H.F. Wilkinson, “Fast Computation of Morphological Area Pattern Spectra,” Proc. Int'l Conf. Image Processing 2001, pp. 668-671, 2001.
[16] P. Salembier, A. Oliveras, and L. Garrido, “Anti-Extensive Connected Operators for Image and Sequence Processing,” IEEE Trans. Image Processing, vol. 7, pp. 555-570, 1998.
[17] P. Salembier and J. Serra, "Flat Zones Filtering, Connected Operators and Filters by Reconstruction," IEEE Trans. Image Processing, vol. 8, no. 4, pp. 1,153-1,160, Aug. 1995.
[18] R.E. Tarjan, “Efficiency of a Good but Not Linear Set Union Algorithm,” J. ACM, vol. 22, no. 2, pp. 215-225, 1975.
[19] E.R. Urbach and M.H.F. Wilkinson, “Shape Distributions and Decomposition of Gray Scale Images,” IWI-report 2000-9-15, Inst. Math. and Computing Science, Univ. of Groningen, 2001.
[20] L. Vincent, “Grayscale Area Openings and Closings, Their Efficient Implementation and Applications,” Proc. EURASIP Workshop Math. Morphology and Its Application to Signal Processing, pp. 22-27, 1993.
[21] L. Vincent, “Morphological Area Openings and Closings for Gray-Scale Images,” Shape in Picture: Mathematical Description of Shape in Grey-Level Images, Y.-L. O, A. Toet, D. Foster, H.J.A.M. Heijmans, and P. Meer, eds., pp. 197-208, 1993.
[22] L. Vincent, “Morphological Gray Scale Reconstruction in Image Analysis: Applications and Efficient Algorithms,” IEEE Trans. Image Processing, vol. 2, pp. 176-201, 1993.
[23] R. Szeliski and S.B. Kang, "Recovering 3D Shape and Motion from Image Streams Using Non-Linear Least Squares," IEEE CS, Conf. Computer Vision and Pattern Recognition,New York, N.Y., pp. 752-753, June 1993.
[24] M.H.F. Wilkinson and J.B.T.M. Roerdink, “Fast Morphological Attribute Operations Using Tarjan's Union-Find Algorithm,” Proc. Int'l Symp. Memory Management 2000, pp. 311-320, June 2000.
[25] M.H.F. Wilkinson and M.A. Westenberg, “Shape Preserving Filament Enhancement Filtering,” Medical Image Computing and Computer-Assisted Intervention, W.J. Niessen and M.A. Viergever, eds., pp. 770-777, 2001.

Index Terms:
mathematical morphology, connected set operators, attribute filters, pattern spectra, multiscale analysis, union-find
Citation:
A. Meijster, M.H.F. Wilkinson, "A Comparison of Algorithms for Connected Set Openings and Closings," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 24, no. 4, pp. 484-494, April 2002, doi:10.1109/34.993556
Usage of this product signifies your acceptance of the Terms of Use.