메뉴 건너뛰기




Volumn 99, Issue 3, 2005, Pages 414-434

Fast connected-component labelling in three-dimensional binary images based on iterative recursion

Author keywords

Connected components; Iteration; Iterative recursion; Labelling; Recursion

Indexed keywords

ALGORITHMS; BRAIN; DATA ACQUISITION; ITERATIVE METHODS; RECURSIVE FUNCTIONS; STORAGE ALLOCATION (COMPUTER);

EID: 23844454047     PISSN: 10773142     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cviu.2005.04.001     Document Type: Article
Times cited : (52)

References (11)
  • 1
    • 0042293547 scopus 로고    scopus 로고
    • Connected component labeling for binary images on a reconfigurable mesh architectures
    • P. Bhattacharya Connected component labeling for binary images on a reconfigurable mesh architectures J. Syst. Architect. 42 4 1996 309 313
    • (1996) J. Syst. Architect. , vol.42 , Issue.4 , pp. 309-313
    • Bhattacharya, P.1
  • 3
    • 0742322178 scopus 로고    scopus 로고
    • A linear-time component-labeling algorithm using contour tracing technique
    • F. Chang, C.J. Chen, and C.J. Lu A linear-time component-labeling algorithm using contour tracing technique Comput. Vis. Image Und. 93 2004 206 220
    • (2004) Comput. Vis. Image Und. , vol.93 , pp. 206-220
    • Chang, F.1    Chen, C.J.2    Lu, C.J.3
  • 4
    • 0020972137 scopus 로고
    • A new three-dimensional connected components algorithm
    • R. Lumia A new three-dimensional connected components algorithm Comput. Vis. Graph. Image Process. 22 2 1983 207 220
    • (1983) Comput. Vis. Graph. Image Process. , vol.22 , Issue.2 , pp. 207-220
    • Lumia, R.1
  • 5
    • 0020125052 scopus 로고
    • A new connected components algorithm for virtual memory computers
    • R. Lumia, L. Shapiro, and O. Zungia A new connected components algorithm for virtual memory computers Comput. Vis. Graph. Image Process. 22 2 1983 230 287
    • (1983) Comput. Vis. Graph. Image Process. , vol.22 , Issue.2 , pp. 230-287
    • Lumia, R.1    Shapiro, L.2    Zungia, O.3
  • 6
    • 0018306059 scopus 로고
    • A threshold selection method from gray-level histogram
    • N. Otsu A threshold selection method from gray-level histogram IEEE Trans. Syst. Man Cybernet. 9 1979 62 66
    • (1979) IEEE Trans. Syst. Man Cybernet. , vol.9 , pp. 62-66
    • Otsu, N.1
  • 7
    • 0024053187 scopus 로고
    • Efficient component labeling of images of arbitrary dimension represented by linear bintrees
    • H. Samet, and M. Taminen Efficient component labeling of images of arbitrary dimension represented by linear bintrees IEEE Trans. Pattern Anal. Mach. Intell. 10 4 1988 579 586
    • (1988) IEEE Trans. Pattern Anal. Mach. Intell. , vol.10 , Issue.4 , pp. 579-586
    • Samet, H.1    Taminen, M.2
  • 8
    • 0036429375 scopus 로고    scopus 로고
    • Automated histogram-based brain segmentation in T1-weighted three-dimensional magnetic resonance head images
    • Z.Y. Shan, G.H. Yue, and J.Z. Liu Automated histogram-based brain segmentation in T1-weighted three-dimensional magnetic resonance head images Neuroimage 17 2002 1587 1598
    • (2002) Neuroimage , vol.17 , pp. 1587-1598
    • Shan, Z.Y.1    Yue, G.H.2    Liu, J.Z.3
  • 9
    • 0041527213 scopus 로고    scopus 로고
    • Linear-time connected-component labeling based on sequential local operations
    • K. Suzuki, I. Horiba, and N. Sugie Linear-time connected-component labeling based on sequential local operations Comput. Vis. Image Und. 89 2003 1 23
    • (2003) Comput. Vis. Image Und. , vol.89 , pp. 1-23
    • Suzuki, K.1    Horiba, I.2    Sugie, N.3
  • 10
    • 0000790002 scopus 로고
    • A new three-dimensional connected components labelling algorithm with simultaneous object feature extraction capability
    • L. Thurfjell, E. Bengtsson, and B. Nordin A new three-dimensional connected components labelling algorithm with simultaneous object feature extraction capability CVGIP: Graph. Models Image Process. 54 4 1992 357 364
    • (1992) CVGIP: Graph. Models Image Process. , vol.54 , Issue.4 , pp. 357-364
    • Thurfjell, L.1    Bengtsson, E.2    Nordin, B.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.