Two efficient label-equivalence-based connected-component labeling algorithms for 3-D binary images

IEEE Trans Image Process. 2011 Aug;20(8):2122-34. doi: 10.1109/TIP.2011.2114352. Epub 2011 Feb 14.

Abstract

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.

Publication types

  • Research Support, N.I.H., Extramural
  • Research Support, Non-U.S. Gov't