A 1-subcycle parallel thinning algorithm for producing perfect 8-curves and obtaining isotropic skeleton of an L-shape pattern
暂无分享,去创建一个
[1] Azriel Rosenfeld,et al. Some Parallel Thinning Algorithms for Digital Pictures , 1971, JACM.
[2] Keiichi Abe,et al. Binary picture thinning by an iterative parallel two-subcycle operation , 1987, Pattern Recognit..
[3] Ronald H. Perrott,et al. An improved parallel thinning algorithm , 1987, CACM.
[4] T. Fukumura,et al. An Analysis of Topological Properties of Digitized Binary Pictures Using Local Features , 1975 .
[5] V. K. Govindan,et al. A pattern adaptive thinning algorithm , 1987, Pattern Recognit..
[6] Yung-Sheng Chen,et al. Systematic approach for designing 2-subcycle and pseudo 1-subcycle parallel thinning algorithms , 1989, Pattern Recognit..
[7] Edward S. Deutsch,et al. Thinning algorithms on rectangular, hexagonal, and triangular arrays , 1972, Commun. ACM.
[8] Raymond W. Smith,et al. Computer processing of line images: A survey , 1987, Pattern Recognit..
[9] C. J. Hilditch,et al. Linear Skeletons From Square Cupboards , 1969 .
[10] Ching Y. Suen,et al. A fast parallel algorithm for thinning digital patterns , 1984, CACM.
[11] Roland T. Chin,et al. A one-pass thinning algorithm and its parallel implementation , 1987, Comput. Vis. Graph. Image Process..
[12] Yung-Sheng Chen,et al. A modified fast parallel algorithm for thinning digital patterns , 1988, Pattern Recognit. Lett..
[13] Azriel Rosenfeld,et al. Connectivity in Digital Pictures , 1970, JACM.
[14] Tony Kasvand,et al. Critical points on a perfectly 8- or 6-connected thin binary line , 1983, Pattern Recognit..