论文信息 - A thinning algorithm for discrete binary images - 字舞流文

A thinning algorithm for discrete binary images

[1] Theo Pavlidis,et al. Filling algorithms for raster graphics , 1979 .

[2] Irvin Sobel,et al. Neighborhood coding of binary images for fast contour following and general binary array processing , 1978 .

[3] T. Morrin. Chain-link compression of arbitrary black-white images , 1976 .

[4] Azriel Rosenfeld,et al. A Characterization of Parallel Thinning Algorithms , 1975, Inf. Control..

[5] T. Fukumura,et al. An Analysis of Topological Properties of Digitized Binary Pictures Using Local Features , 1975 .

[6] R. D. Merrill. Representation of contours and regions for efficient computer search , 1973, CACM.

[7] Azriel Rosenfeld,et al. Some Parallel Thinning Algorithms for Digital Pictures , 1971, JACM.

[8] Azriel Rosenfeld,et al. Connectivity in Digital Pictures , 1970, JACM.

[9] Ugo Montanari,et al. Continuous Skeletons from Digitized Images , 1969, JACM.

[10] C. J. Hilditch,et al. Linear Skeletons From Square Cupboards , 1969 .

[11] Azriel Rosenfeld,et al. Computer representation of planar regions by their skeletons , 1967, CACM.

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