Optimizing two-pass connected-component labeling algorithms

Pattern Analysis and Applications

Volumn 12, Issue 2, 2009, Pages 117-135

  Wu, Kesheng ^a   Otoo, Ekow ^a   Suzuki, Kenji ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF CHICAGO   (United States)

Author keywords

Connected component labeling; Decision tree; Equivalence relation; Optimization; Union find algorithm

Indexed keywords

EID: 60949084344     PISSN: 14337541     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10044-008-0109-y     Document Type: Article

References (47)

1. Agarwal PK, Arge L, Ke Yi (2006) I/O-efficient batched union-find and its applications to terrain analysis. In: SCG '06: Proceedings of the 22nd annual symposium on computational geometry. ACM Press, New York, pp 167-176
2. Aho AV, Hopcroft JE, Ullman JD (1974) The design and analysis of computer algorithms. Addison-Wesley, Reading
3. Aho AV, Ullman JD, Hopcroft JE (1983) Data structures and algorithms. Addison-Wesley, Reading
4. HM Alnuweiri VK Prasanna 1992 Parallel architectures and algorithms for image component labeling IEEE Trans Pattern Anal Mach Intell 14 10 1014 1034
5. Alstrup S, Ben-Amram AM, Rauhe T (1999) Worst-case and amortised optimality in union-find. In: Proceedings of 31th Annual ACM symposium on theory of computing (STOC'99). ACM Press, New York, pp 499-506
6. A Amin S Fisher 2000 A document skew detection method using the Hough transform Pattern Anal Appl 3 3 243 253
7. Ballard DH (1982) Computer vision. Prentice-Hall, Englewood
8. Bollobás B, Simon I (1985) On the expected behavior of disjoint set union algorithms. In: STOC '85: Proceedings of the 17th annual ACM symposium on theory of computing. ACM Press, New York, pp 224-231
9. F Chang C-J Chen C-J Lu 2004 A linear-time component-labeling algorithm using contour tracing technique Comput Vis Image Underst 93 2 206 220
10. MB Dillencourt H Samet M Tamminen 1992 A general approach to connected-component labeling for arbitrary image representations J ACM 39 2 253 280
11. J Doyle RL Rivest 1976 Linear expected time of a simple union-find algorithm Inf Process Lett 5 5 146 148
12. C Fiorio J Gustedt 1996 Two linear time union-find strategies for image processing Theor Comput Sci 154 2 165 181
13. Fiorio C, Gustedt J (1997) Memory management for union-find algorithms. In: Proceedings of 14th symposium on theoretical aspects of computer Science. Springer, New York, pp 67-79
14. Gabow HN, Tarjan RE (1983) A linear-time algorithm for a special case of disjoint set union. In: STOC '83: Proceedings of the 15th annual ACM symposium on theory of computing. ACM Press, New York, pp 246-251
15. Z Galil GF Italiano 1991 Data structures and algorithms for disjoint set union problems ACM Comput Surv 23 3 319 344
16. BA Galler MJ Fisher 1964 An improved equivalence algorithm Commun ACM 7 5 301 303
17. Gonzalez RC, Woods RE (2002) Digital Image Processing, 2nd edn. Prentice-Hall, New Jersy
18. Gotoh T, Ohta Y, Yoshida M, Shirai Y (1987) Component labeling algorithm for video rate processing. In: Proceedings of SPIE 1987. Advances in image processing, vol 804, pp 217-224
19. Haralick RM (1981) Some neighborhood operations. Plenum Press, New York, pp 11-35
20. RM Haralick LG Shapiro 1985 Image segmentation techniques Comput Vis Graph Image Process 29 1 100 132
21. H Hayashi M Kudo J Toyama M Shimbo 2001 Fast labelling of natural scenes using enhanced knowledge Pattern Anal Appl 4 1 20 27
22. H Qingmao Q Guoyu WL Nowinski 2005 Fast connected-component labelling in three-dimensional binary images based on iterative recursion Comput Vis Image Underst 99 414 434
23. J-H Kim KK Kim CY Suen 2000 An HMM-MLP hybrid model for cursive script recognition Pattern Anal Appl 3 4 314 324
24. F Knop V Rego 1998 Parallel labeling of three-dimensional clusters on networks of workstations J Parallel Distrib Comput 49 2 182 203
25. DE Knuth A Schönhage 1978 The expected linearity of a simple equivalence algorithm Theor Comput Sci 6 281 315
26. JM Lucas 1990 Postorder disjoint set union is linear SIAM J Comput 19 5 868 882
27. R Lumia 1983 A new three-dimensional connected components algorithm Comput Vis Graph Image Process 23 2 207 217
28. R Lumia L Shapiro O Zungia 1983 A new connected components algorithm for virtual memory computers Comput Vis Graph Image Process 22 2 287 300
29. AN Moga M Gabbouj 1997 Parallel image component labeling with watershed transformations IEEE Trans Pattern Anal Mach Intell 19 5 441 450
30. Naoi S (1995) High-speed labeling method using adaptive variable window size for character shape feature. In: IEEE Asian Conference on computer vision, vol 1, pp 408-411
31. N Otsu 1979 A threshold selection method from gray level histograms IEEE Trans Syst Man Cybern 9 62 66
32. E Regentova S Latifi S Deng D Yao 2002 An algorithm with reduced operations for connected components detection in itu-t group 3/4 coded images IEEE Trans Pattern Anal Mach Intell 24 8 1039 1047
33. A Rosenfeld 1970 Connectivity in digital pictures J ACM 17 1 146 160
34. Rosenfeld A, Kak AC (1982) Digital picture processing, 2nd edn. Academic Press, San Diego
35. J Shi J Malik 2000 Normalized cuts and image segmentation IEEE Trans Pattern Anal Mach Intell 22 8 888 905
36. Stockman GC, Shapiro LG (2001) Computer Vision. Prentice-Hall, Englewood
37. JS Suri B Singh L Reden 2002 Computer vision and pattern recognition techniques for 2-d and 3-d MR cerebral cortical segmentation: a state-of-the-art review Pattern Analy Appl 5 1 46 76
38. K Suzuki I Horiba N Sugie 2003 Linear-time connected-component labeling based on sequential local operations Comput Vis Image Underst 89 1 1 23
39. RE Tarjan J van Leeuwen 1984 Worst-case analysis of set union algorithms J ACM 31 2 245 281
40. RE Tarjan 1975 Efficiency of a good but not linear set union algorithm J ACM 22 2 215 225
41. Tarjan RE (1977) Reference machines require non-linear time to maintain disjoint sets. In: STOC '77: Proceedings of the 9th annual ACM symposium on theory of computing. ACM Press, pp 18-29
42. JK Udupa VG Ajjanagadde 1990 Boundary and object labelling in three-dimensional images Comput Vis Graph Image Process 51 3 355 369
43. K-B Wang T-L Chia Z Chen D-C Lou 2003 Parallel execution of a connected component labeling operation on a linear array architecture J Inf Sci Eng 19 353 370
44. Y Wang P Bhattacharya 2003 Using connected components to guide image understanding and segmentation Mach Graph Vis 12 2 163 186
45. Wu K, Otoo E, Shoshani A (2005) Optimizing connected component labeling algorithms. In: Proceedings of SPIE medical imaging conference 2005, San Diego, CA, 2005. LBNL report LBNL-56864
46. AC Yao 1985 On the expected performance of path compression algorithms SIAM J Comput 14 1 129 133
47. Yapa RD, Koichi H (2007) A connected component labeling algorithm for grayscale images and application of the algorithm on mammograms. In: SAC'07: Proceedings of the 2007 ACM symposium on applied computing. ACM Press, New York, pp 146-152