A width-independent parallel thinning algorithm
暂无分享,去创建一个
[1] Ugo Montanari,et al. A Method for Obtaining Skeletons Using a Quasi-Euclidean Distance , 1968, J. ACM.
[2] Azriel Rosenfeld,et al. Some Parallel Thinning Algorithms for Digital Pictures , 1971, JACM.
[3] P. Danielsson. Euclidean distance mapping , 1980 .
[4] Ching Y. Suen,et al. A fast parallel algorithm for thinning digital patterns , 1984, CACM.
[5] Gabriella Sanniti di Baja,et al. A Width-Independent Fast Thinning Algorithm , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[6] Roland T. Chin,et al. A one-pass thinning algorithm and its parallel implementation , 1987, Comput. Vis. Graph. Image Process..
[7] Azriel Rosenfeld,et al. Parallel computation of geometric properties from the medial axis transform , 1988, Comput. Vis. Graph. Image Process..
[8] Carlo Arcelli,et al. Skeletonizing The Distance Transform Parallelwise , 1988, Optics & Photonics.
[9] Zicheng Guo,et al. Parallel thinning with two-subiteration algorithms , 1989, Commun. ACM.
[10] Wayne Niblack,et al. Generating skeletons and centerlines from the medial axis transform , 1990, [1990] Proceedings. 10th International Conference on Pattern Recognition.
[11] Richard M. Karp,et al. Parallel Algorithms for Shared-Memory Machines , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.
[12] Sung Kwon Kim. Optimal Parallel Algorithms for Region Labeling and Medial Axis Transform of Binary Images , 1991, SIAM J. Discret. Math..
[13] Wayne Niblack,et al. Generating connected skeletons for exact and approximate reconstruction , 1992, Proceedings 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
[14] Wayne Niblack,et al. Generating skeletons and centerlines from the distance transform , 1992, CVGIP Graph. Model. Image Process..