首页 | 本学科首页   官方微博 | 高级检索  
     

一种改进的等高线并行细化算法
引用本文:井元伟,李海燕. 一种改进的等高线并行细化算法[J]. 东北大学学报(自然科学版), 2006, 27(9): 945-948. DOI: -
作者姓名:井元伟  李海燕
作者单位:东北大学信息科学与工程学院,辽宁沈阳110004
基金项目:国家自然科学基金,国家高技术研究发展计划(863计划)
摘    要:讨论了经过分色提取之后等高线的细化问题,以减少数据的处理量,为矢量化过程做前期处理准备.针对军事地图等高线,提出了一种改进的快速并行细化算法.采用两步法细化算法对等高线进行细化处理.在已有的两个逻辑规则基础上,增加了若干限制条件,处理了模板的对称性问题.同时还给出了删除数组,提高了算法的运行速度.从运行结果看,没有发生骨架畸变现象,避免了过度腐蚀,具有较好的连通性,此方法的细化效果较为理想.

关 键 词:等高线  细化  并行算法  骨架  连通性  
文章编号:1005-3026(2006)09-0945-04
收稿时间:2005-10-09
修稿时间:2005-10-09

An Improved Fast Parallel Thinning Algorithm for Contours
JING Yuan-wei,LI Hai-yan. An Improved Fast Parallel Thinning Algorithm for Contours[J]. Journal of Northeastern University(Natural Science), 2006, 27(9): 945-948. DOI: -
Authors:JING Yuan-wei  LI Hai-yan
Affiliation:(1) School of Information Science and Engineering, Northeastern University, Shenyang 110004, China
Abstract:The problem of thinning contours obtained via segmentation is discussed to reduce the quantity of data processing and prepare for the pre-processing of vectorization.An improved fast parallel thinning algorithm is therefore proposed to the contours in military maps.Two-step thinning algorithm is adopted to process the contour thinning.Some restrictive conditions are added to the existing logistic rules,thus enabling the algorithm to deal with the symmetry problem of module board with the deleting look-up table given to improve the operation speed of the algorithm.The simulation result shows that there is no distorted skeleton and excessive corrosion and the connectedness is satisfactory.The proposed algorithm is proved ideal to deal with contour thinning.
Keywords:contour  thinning  parallel algorithm  skeleton  connectedness
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《东北大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《东北大学学报(自然科学版)》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号