Fast Morphological Attribute Operations Using Tarjan’s Union-Find Algorithm

1. E. J. Breen and R. Jones. Attribute openings, thinnings and granulometries. Computer Vision and Image Understanding, 64(3):377–389, 1996.

   Article  Google Scholar 

2. M. Dillencourt, H. Samet, and M. Tamminen. A general approach to connectedcomponent labeling for arbitrary image representations. Journal of the ACM, 39:253–280, 1992.

   Article  MathSciNet  Google Scholar 

3. C. Fiorio and J. Gustedt. Two linear time union-find strategies for image processing. Theoretical Computer Science (A), 154:165–181, 1996.

   MathSciNet  Google Scholar 

4. A. Meijster and J. B. T. M. Roerdink. A disjoint set algorithm for the watershed transform. In Proc. EUSIPC0’98, IX European Signal Processing Conference, pages 1665–1668, Rhodes, Greece, 1998.

   Google Scholar 

5. A. Meijster and M. H. F. Wilkinson. An efficient algorithm for morphological area operators. Technical Report 99-9-07, Institute for Mathematics and Computing Science, University of Groningen, submitted.

   Google Scholar 

6. P. Salembier, A. Oliveras, and L. Garrido. Anti-extensive connected operators for image and sequence processing. IEEE Transactions on Image Processing, 7:555–570, 1998.

   Article  Google Scholar 

7. R. E. Tarjan. Efficiency of a good but not linear set union algorithm. Journal of the. ACM, 22:215–225, 1975.

   Article  MathSciNet  MATH  Google Scholar 

8. L. Vincent. Grayscale area openings and closings, their efficient implementation and applications. In Proc. EURASIP Workshop on Mathematical Morphology and its Application to Signal Processing, pages 22–27, Barcelona, Spain, 1993.

   Google Scholar 

9. L. Vincent. Morphological area openings and closings for grey-scale images. In Y.-L. O, A. Toet, D. Foster, H. J. A. M. Heijmans, and P. Meer, editors, Shape in Picture: Mathematical Description of Shape in Grey-level Images, pages 197–208. NATO, 1993.

   Google Scholar 

Download references