Connectivity analysis of multi-dimensional multi-valued images

Connectivity analysis (maximally connected component labeling plus optional geometric feature collection) has previously been applied to only 2-dimensional (2-D) binary valued images. By carefully examining the property of 6-connectivity, it is found that it may also be applied to 2-D multi-valued (m-ary) images, which, together with thresholders, recognizers or classifiers of multiple valued output, promises more efficient low level processing. The idea is further generalized to multi-dimensional spaces so that the connectivity analysis may be performed on n-D (with n ≥ 1) m-ary (with m ≥ 2) images. Formal definition of 6-connectivity in n-D space and a labeling algorithm is presented followed by a brief discussion of its potential applications.

[1]  K. Preston,et al.  A Study of Multidimensional Multicolor Images , 1982, IEEE Transactions on Biomedical Engineering.

[2]  Hanan Samet,et al.  Connected Component Labeling Using Quadtrees , 1981, JACM.

[3]  Dana H. Ballard,et al.  Computer Vision , 1982 .

[4]  Myron Flickner,et al.  Handling Memory Overflow in Connected Component Labeling Applications , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

[6]  Azriel Rosenfeld,et al.  Digital Picture Processing , 1976 .

[7]  Peter E. Hart,et al.  GRAPHICAL-DATA-PROCESSING RESEARCH STUDY AND EXPERIMENTAL INVESTIGATION , 1964 .

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