| 一种新的基于链码的填充算法 |
| |
| 引用本文： | 巨志勇,陈优广. 一种新的基于链码的填充算法[J]. 计算机工程, 2007, 33(17): 211-212,215 |
| |
| 作者姓名： | 巨志勇 陈优广 |
| |
| 作者单位： | [1]同济大学电子与信息工程学院,上海200092 [2]上海理工大学计算机工程学院,上海200093 [3]华东师范大学信息科学技术学院,上海200062 |
| |
| 摘 要： | 将计算机图形学的栅栏填充算法移植到链码的填充算法中，发展出了一种新的基于链码的填充算法。利用边界Freeman链码，定义了一种新的边界点分类方法，通过对边界上的左右端点到栅栏间的像素取补填充该区域，算法能填充任意复杂图像区域，不需要辅助内存空间和标记边界色。与现有的算法进行了对比实验，实验表明该文提供的算法对于图像具有填充速度快、效率高等优点。
|
| 关 键 词： | Freeman链码 栅栏 区域填充 |
| 文章编号： | 1000-3428（2007）17-0200-02 |
| 修稿时间： | 2007-03-15 |
New Filling Algorithm Based on Chain Code |
| |
| JU Zhi-yong,CHEN You-guang. New Filling Algorithm Based on Chain Code[J]. Computer Engineering, 2007, 33(17): 211-212,215 |
| |
| Authors: | JU Zhi-yong CHEN You-guang |
| |
| Affiliation: | 1. College of Electronics and Information Engineering, Tongji University, Shanghai 200092; 2. College of Computer Engineering, University of Shanghai for Science and Technology, Shanghai 200093 3. School of Information Science and Technology, East China Normal University, Shanghai 200062 |
| |
| Abstract: | A new filling algorithm based on chain code is transplanted from raster filling algorithm in computer graphics. A new boundary point classifying method is defined by using boundary Freeman chain code. The algorithm fills pixels between left point or right point of contour and raster line with complement operation, thus it can handle arbitrary complicated region without supplementary memory space or additional labeling. Experiments show that the proposed algorithm is faster and more efficient than existing ones. |
| |
| Keywords: | Freeman chain code raster region filling |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载免费的PDF全文 |
