Optimally Small Operator Supports for Fully Parallel Thinning Algorithms
暂无分享,去创建一个
[1] Richard W. Hall,et al. Abstract of paper accepted for publication PaperParallel shrinking algorithms using 2-subfield approaches , 1990 .
[2] R. W. Hall. Tests for connectivity preservation for parallel reduction operators , 1992 .
[3] Kendall Preston,et al. Modern Cellular Automata , 1984, Advanced Applications in Pattern Recognition.
[4] Roland T. Chin,et al. A one-pass thinning algorithm and its parallel implementation , 1987, Comput. Vis. Graph. Image Process..
[5] Azriel Rosenfeld,et al. A Characterization of Parallel Thinning Algorithms , 1975, Inf. Control..
[6] Malcolm J. Shute,et al. Multiprocessor Computer Architectures , 1990 .
[7] Zicheng Guo,et al. Parallel thinning with two-subiteration algorithms , 1989, Commun. ACM.
[8] Christian Ronse,et al. A Topological Characterization of Thinning , 1986, Theor. Comput. Sci..
[9] Zicheng Guo,et al. Fast fully parallel thinning algorithms , 1991, CVGIP Image Underst..
[10] Christian Ronse,et al. Minimal test patterns for connectivity preservation in parallel thinning algorithms for binary digital images , 1988, Discret. Appl. Math..
[11] Ronald H. Perrott,et al. An improved parallel thinning algorithm , 1987, CACM.
[12] Azriel Rosenfeld,et al. Digital topology: Introduction and survey , 1989, Comput. Vis. Graph. Image Process..
[13] Azriel Rosenfeld,et al. Some Parallel Thinning Algorithms for Digital Pictures , 1971, JACM.
[14] Richard W. Hall,et al. Fast parallel thinning algorithms: parallel speed and connectivity preservation , 1989, CACM.
[15] Terry J. Fountain,et al. Cellular logic image processing , 1986 .
[16] Stefano Levialdi,et al. Parallel thinning of binary pictures , 1975 .