论文信息 - Parallel 3D shrinking algorithms using subfields notions

Parallel 3D shrinking algorithms using subfields notions

The parallel shrinking of 3D binary images to single point residues is addressed using two subfields notions (A subfield is a partition of the image space into two disjoint subsets). Sufficient conditions for connectivity preservation are developed and convergence issues are discussed. An example two subfields algorithm is illustrated and evaluated.<<ETX>>

Richard W. Hall | Senol Küçük

[1] Christian Ronse,et al. Minimal test patterns for connectivity preservation in parallel thinning algorithms for binary digital images , 1988, Discret. Appl. Math..

[2] Kendall Preston,et al. Three-dimensional skeletonization of elongated solids , 1983, Comput. Vis. Graph. Image Process..

[3] Stefano Levialdi,et al. On shrinking binary picture patterns , 1972, CACM.

[4] Stefano Levialdi,et al. Parallel shrinking in three dimensions , 1972, Comput. Graph. Image Process..

[5] Jorge L. C. Sanz,et al. Algorithms for Image Component Labeling on SIMD Mesh-Connected Computers , 1987, IEEE Trans. Computers.

[6] Richard W. Hall,et al. Parallel shrinking algorithms using 2-subfields approaches , 1990, Comput. Vis. Graph. Image Process..

[7] R. W. Hall. Tests for connectivity preservation for parallel reduction operators , 1992 .

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

[9] Zicheng Guo,et al. Parallel thinning with two-subiteration algorithms , 1989, Commun. ACM.