An efficient method to obtain the chain code of contours for a bi-level image is proposed. The method hinges on the clustering property of an image. The search sequence of each boundary pixel is determined dynamically, according to the direction of the preceding boundary pixel. The computational efficiency of the proposed method is then compared to those of conventional methods, by processing the contour-following of Chinese characters. It indicates that the proposed algorithm can, in general, save three times in speed. An efficient method to obtain the chain code of contours for a bi-level image is proposed. The method hinges on the clustering property of an image. The search sequence of each boundary pixel is determined dynamically, according to the direction of the preceding boundary pixel. The computational efficiency of the proposed method is then compared to those of conventional methods, by processing the contour-following of Chinese characters. It indicates that the proposed algorithm can, in general, save three times in speed.
關聯:
一九九二年電腦視覺、圖學、暨影像處理研討會論文集=Proceedings of 1992 IPPR Conference on Computer Vision, Graphics and Ima ge=Processing，頁253-257
