A contour characterization for multiply connected figures
暂无分享,去创建一个
Abstract The characterization of a digital figure in terms of the multiple pixels, i.e., the pixels placed where the contour selfinteracts, can provide useful shape cues. These pixels can satisfactorily be detected if a suitable definition of contour simplicity is available. Such a definition is given in this paper, for the case of multiply connected figures. The multiple pixels are those where the contour fails to be simple, and they can be identified by using 3 × 3 local operations.
[1] T. Pavlidis. A thinning algorithm for discrete binary images , 1980 .
[2] Carlo Arcelli,et al. Pattern thinning by contour tracing , 1981 .
[3] Azriel Rosenfeld,et al. Connectivity in Digital Pictures , 1970, JACM.
[4] C. Arcelli,et al. Finding Multiple Pixels , 1986 .
[5] T. Pavlidis. Algorithms for Graphics and Image Processing , 1981, Springer Berlin Heidelberg.