A correction on “further considerations of a 1‐subcycle parallel thinning algorithm”
暂无分享,去创建一个
Abstract A disconnectedness problem which appeared in the 1‐subcycle parallel thinning algorithm [1] is shown and a correct condition is presented to overcome this problem. As a result, to preserve the connectivity of a P8ET‐type thin line, the removal of a (quasi) T‐junction should be guaranteed by its neighbors that do not belong to any one of the commonly used subwindows, mutually opposite subwindows, and T‐junction cases.
[1] Yung-Sheng Chen,et al. Systematic approach for designing 2-subcycle and pseudo 1-subcycle parallel thinning algorithms , 1989, Pattern Recognit..
[2] Yung-Sheng Chen,et al. Further considerations of a 1-subcycle parallel thinning algorithm , 1992 .
[3] Yung-Sheng Chen,et al. A 1-subcycle parallel thinning algorithm for producing perfect 8-curves and obtaining isotropic skeleton of an L-shape pattern , 1989, Proceedings CVPR '89: IEEE Computer Society Conference on Computer Vision and Pattern Recognition.