计算机工程与应用2017，Vol.53Issue(5)：207-211,5.DOI:10.3778/j.issn.1002-8331.1508-0007
二值图像膨胀腐蚀的快速算法
Fast algorithm of dilation and erosion for binary image
摘要
Abstract
Traditional binary dilation and erosion with large structure element are hard to apply in practical application since the redundant operations and low efficiency. A fast algorithm for dilation and erosion is present. First, it makes a direction-position offset table for structure element, and then extracts the borders of targets, describes each border with a starting point and a chain of direction. To dilate the border, it looks up the offset pixels in the direction-position offset ta-ble according to the direction of the chain, and then fills the pixels. It takes the union of border dilation and original image as the result of dilation for original image. The rapid erosion algorithm also can be realized according to the duality of dila-tion and erosion. Experimental results show that, compared with the traditional algorithm and other optimization algo-rithm, this algorithm is faster and more practical.关键词
膨胀/腐蚀/快速算法/数学形态学Key words
dilation/erosion/fast algorithm/mathematical morphology分类
信息技术与安全科学引用本文复制引用
邓仕超,黄寅..二值图像膨胀腐蚀的快速算法[J].计算机工程与应用,2017,53(5):207-211,5.基金项目
国家自然科学基金(No.61265010) （No.61265010）
广西制造系统与先进制造技术重点实验室主任基金(No.桂科能10-046-07_007) （No.桂科能10-046-07_007）
广西信息实验科学中心基金(No.LD13104X). （No.LD13104X）
