| 一种快速的一次扫描细化算法（OSSTA） |
| |
| 引用本文： | 吴晓芸,张太怡.一种快速的一次扫描细化算法（OSSTA）[J].重庆大学学报(自然科学版),1994,17(3):13-17. |
| |
| 作者姓名： | 吴晓芸 张太怡 |
| |
| 作者单位： | 重庆大学电子信息工程学院 |
| |
| 摘 要： | 提出了一种快速的一次扫描细化算法，通过骨架点的预测分析，得到骨架点，对非骨架点的像素不作判断，并通过插补连接得到骨架。另给出了细化实例。
|
| 关 键 词： | 图像 细化 连通性 骨架 OSSTA算法 |
A Fast One-Step Scanning Thinning Algorithm |
| |
| Wu xiaoyun,Zhang Taiyi,Liu Pin.A Fast One-Step Scanning Thinning Algorithm[J].Journal of Chongqing University(Natural Science Edition),1994,17(3):13-17. |
| |
| Authors: | Wu xiaoyun Zhang Taiyi Liu Pin |
| |
| Institution: | Wu xiaoyun;Zhang Taiyi;Liu Pin |
| |
| Abstract: | A new quick thinning algorithm was presented in this paper,which assigneddifferent weights to different pixels near the skeleton pixels and rules out the im possible pixels in thethinning procedure. It needs neither iteration on pixel panel nor detection on every pixel such thatthe time consumed is greatly lessened. A filling algorithm is also offered for better results.Experiment on variety of binary patterns showed that it could get both a high speed and a goodskeleton shape compared with other algorithms,This new algorithm reaches perfect result. |
| |
| Keywords: | thinning connectivity skeleton inscribed-circle neighbor |
| 本文献已被 CNKI 维普 等数据库收录！ |
| 点击此处可从《重庆大学学报(自然科学版)》浏览原始摘要信息 |
| 点击此处可从《重庆大学学报(自然科学版)》下载免费的PDF全文 |
