一种改进的二值图像边界跟踪与边界链码获取算法  

Improved Algorithm for Boundary Trackingand Boundary Chain Code Acquisition of Binary Image

作　　者：邓仕超[1] 李伟明 龙芋宏[1] 高兴宇[1] Deng Shichao;Li Weiming;Long Yuhong;Gao Xingyu(Guangxi Key Laboratory of Manufacturing Systems and Advanced Manufacturing Technology Guilin University of Electronic Technology, Guilin, Guangxi 541004, China)

机构地区：[1]桂林电子科技大学广西制造系统与先进制造技术重点实验室,广西桂林541004

出　　处：《激光与光电子学进展》2018年第6期141-147,共7页Laser & Optoelectronics Progress

基　　金：广西自然科学基金(2015jjBA70017)

摘　　要：为了克服传统二值图像边界跟踪速度慢和边界漏跟踪等问题,基于Freeman链码提出一种通用性强的多起点分段二值图像边界跟踪与边界链码获取算法。在借鉴前人对传统Freeman链码搜索算法的改进,将平均搜索方向减少为2.5就可以找到新边界点的基础上,进一步将复杂的边界分段处理,令前一边界链的起点作为待跟踪边界链搜索的起点,同时把跟踪后的边界点填充,这样自上而下自左而右的对图像扫描,只需一次即可跟踪完所有的边界,并通过设定阈值消除了单像素冗余点。实验论证结果表明,本文算法能够对复杂网状边界、内部孔洞进行有效地跟踪,同时具有抗噪去除冗余点的能力和较快的速度。In order to overcome the shortcomings of the traditional binary image boundary tracking, including slow speed and leakage tracking, an algorithm of binary image boundary tracking and boundary chain code acquisition with strong generality is proposed based on the Freeman chain code. Based on the improvement of traditional Freeman chain code search algorithm, the average search direction is reduced to 2.5 when a new boundary point is {ound. Further the complex boundary segment is processed, and the starting point of the previous boundary chain is used as the starting point for the following boundary chain search, and fills the following boundary points, so that the image scanning from top to down and left to right is only one time to track all the boundaries, and eliminates the single pixel redundancy by setting the thresholds. The experimental results show that the proposed algorithm can effectively track the complex mesh boundary and internal holes, and it has the ability to remove the redundant points with anti-noise and faster speed.

关 键 词：图像处理 边界跟踪 分段 二值图像 链码 

分 类 号：TP391.4[自动化与计算机技术—计算机应用技术]