Connectivity preservation tests for parallel reduction-augmentation algorithms
暂无分享,去创建一个
[1] Richard W. Hall,et al. Parallel 3D shrinking algorithms using subfields notions , 1992, [1992] Proceedings. 11th IAPR International Conference on Pattern Recognition.
[2] Jorge L. C. Sanz,et al. Algorithms for Image Component Labeling on SIMD Mesh-Connected Computers , 1987, IEEE Trans. Computers.
[3] Christian Ronse,et al. Minimal test patterns for connectivity preservation in parallel thinning algorithms for binary digital images , 1988, Discret. Appl. Math..
[4] R. W. Hall. Tests for connectivity preservation for parallel reduction operators , 1992 .
[5] Azriel Rosenfeld,et al. Digital topology: Introduction and survey , 1989, Comput. Vis. Graph. Image Process..
[6] Richard W. Hall,et al. Parallel shrinking algorithms using 2-subfields approaches , 1990, Comput. Vis. Graph. Image Process..
[7] Linda G. Shapiro,et al. Computer and Robot Vision , 1991 .
[8] Azriel Rosenfeld,et al. A Characterization of Parallel Thinning Algorithms , 1975, Inf. Control..
[9] Zicheng Guo,et al. Parallel thinning with two-subiteration algorithms , 1989, Commun. ACM.
[10] Luigi P. Cordella,et al. Parallel Detection of Concavities in Cellular Blobs , 1976, IEEE Transactions on Computers.
[11] Stefano Levialdi,et al. On shrinking binary picture patterns , 1972, CACM.
[12] Viktor K. Prasanna,et al. Fast Image Labeling Using Local Operators on Mesh-Connected Computers , 1991, IEEE Trans. Pattern Anal. Mach. Intell..