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

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....

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on image processing : a publication of the IEEE Signal Processing Society. - 1992. - 20(2011), 8 vom: 15. Aug., Seite 2122-34
1. Verfasser: He, Lifeng (VerfasserIn)
Weitere Verfasser: Chao, Yuyan, Suzuki, Kenji
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 2011
Zugriff auf das übergeordnete Werk:IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
Schlagworte:Journal Article Research Support, N.I.H., Extramural Research Support, Non-U.S. Gov't
LEADER 01000naa a22002652 4500
001 NLM20589870X
003 DE-627
005 20231223234823.0
007 cr uuu---uuuuu
008 231223s2011 xx |||||o 00| ||eng c
024 7 |a 10.1109/TIP.2011.2114352  |2 doi 
028 5 2 |a pubmed24n0686.xml 
035 |a (DE-627)NLM20589870X 
035 |a (NLM)21324785 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a He, Lifeng  |e verfasserin  |4 aut 
245 1 0 |a Two efficient label-equivalence-based connected-component labeling algorithms for 3-D binary images 
264 1 |c 2011 
336 |a Text  |b txt  |2 rdacontent 
337 |a ƒaComputermedien  |b c  |2 rdamedia 
338 |a ƒa Online-Ressource  |b cr  |2 rdacarrier 
500 |a Date Completed 07.11.2011 
500 |a Date Revised 20.10.2021 
500 |a published: Print-Electronic 
500 |a Citation Status PubMed-not-MEDLINE 
520 |a 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 
650 4 |a Journal Article 
650 4 |a Research Support, N.I.H., Extramural 
650 4 |a Research Support, Non-U.S. Gov't 
700 1 |a Chao, Yuyan  |e verfasserin  |4 aut 
700 1 |a Suzuki, Kenji  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on image processing : a publication of the IEEE Signal Processing Society  |d 1992  |g 20(2011), 8 vom: 15. Aug., Seite 2122-34  |w (DE-627)NLM09821456X  |x 1941-0042  |7 nnns 
773 1 8 |g volume:20  |g year:2011  |g number:8  |g day:15  |g month:08  |g pages:2122-34 
856 4 0 |u http://dx.doi.org/10.1109/TIP.2011.2114352  |3 Volltext 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 20  |j 2011  |e 8  |b 15  |c 08  |h 2122-34