A new three-dimensional connected components labeling algorithm with simultaneous object feature extraction capability

Abstract A new algorithm for performing connected component labeling of volume data is presented in this paper. The algorithm uses a table that combines efficient handling of label equivalences with the flexibility to add the calculation of features for each labeled component as well as to set various feature thresholds. The volume of each component is calculated in our implementation and it is possible to set a volume threshold for discarding small regions. The reuse of storage in the table is implemented in a simple but natural way.

[1]  Azriel Rosenfeld,et al.  Digital topology: Introduction and survey , 1989, Comput. Vis. Graph. Image Process..

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

[3]  Jayaram K. Udupa,et al.  Fast surface tracking in three-dimensional binary images , 1989, Comput. Vis. Graph. Image Process..

[4]  Jayaram K. Udupa,et al.  Boundary and object labelling in three-dimensional images , 1990, Comput. Vis. Graph. Image Process..

[5]  T. Greitz,et al.  A computerized brain atlas: construction, anatomical content, and some applications. , 1991, Journal of computer assisted tomography.

[6]  T. Greitz,et al.  Adjustable computerized stereotaxic brain atlas for transmission and emission tomography. , 1983, AJNR. American journal of neuroradiology.

[7]  Linda G. Shapiro,et al.  A new connected components algorithm for virtual memory computers , 1983, Comput. Vis. Graph. Image Process..

[8]  Ronald Lumia A new three-dimensional connected components algorithm , 1983, Comput. Vis. Graph. Image Process..