论文信息 - A Novel Connected Component Labeling Algorithm Using Depth-First Search

A Novel Connected Component Labeling Algorithm Using Depth-First Search

In this paper, we proposed a new connected component labeling algorithm using Depth-first Search, and select 195 images to compare the runtime between the algorithm and the connected component labeling function in Matlab, the experiment shows the runtime of the algorithm has been reduced 18.8% than Matlab.

Wenjun Zhang | Genfang Chen

[1] Der-Chyuan Lou,et al. Parallel Execution of a Connected Component Labeling Operation on a Linear Array Architecture , 2003, J. Inf. Sci. Eng..

[2] Chun-Jen Chen,et al. A linear-time component-labeling algorithm using contour tracing technique , 2004, Comput. Vis. Image Underst..

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

[4] Azriel Rosenfeld,et al. Connectivity in Digital Pictures , 1970, JACM.

[5] Dana H. Ballard,et al. Computer Vision , 1982 .

[6] Kenji Suzuki,et al. Linear-time connected-component labeling based on sequential local operations , 2003, Comput. Vis. Image Underst..

[7] Azriel Rosenfeld,et al. Sequential Operations in Digital Picture Processing , 1966, JACM.