.png){kind=icon}
.png){kind=icon}
Return
Two Efficient Label-Equivalence-Based Connected-Component Labeling Algorithms for 3-D Binary Images
.png){kind=icon}
OA
AI
DOI：10.1109/TIP.2011.2114352.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Whenever one wants to distinguish, recognize, and/or measure objects (connected components) in binary images, labeling is required. This paper presents two efficient label-equivalence-based connected-component labeling algorithms for 3-D binary images. One is voxel based and the other is run based. For the voxel-based one, we present an efficient method of deciding the order for checking voxels in the mask. For the run-based one, instead of assigning each foreground voxel, we assign each run a provisional label. Moreover, we use run data to label foreground voxels without scanning any background voxel in the second scan. Experimental results have demonstrated that our voxel-based algorithm is efficient for 3-D binary images with complicated connected components, that our run-based one is efficient for those with simple connected components, and that both are much more efficient than conventional 3-D labeling algorithms.
Keywords:
Connected component
label equivalence
labeling algorithm
run
3-D binary image
Journal
IF:
13.7
Papers:
1.0W
Citations:
8.4W