一种改进的等高线并行细化算法  

An Improved Fast Parallel Thinning Algorithm for Contours

作　　者：井元伟[1] 李海燕[1] 

机构地区：[1]东北大学信息科学与工程学院,辽宁沈阳110004

出　　处：《东北大学学报（自然科学版）》2006年第9期945-948,共4页Journal of Northeastern University(Natural Science)

基　　金：国家自然科学基金资助项目(60274099);国家高技术研究发展计划项目(2004AA412030)

摘　　要：讨论了经过分色提取之后等高线的细化问题,以减少数据的处理量,为矢量化过程做前期处理准备.针对军事地图等高线,提出了一种改进的快速并行细化算法.采用两步法细化算法对等高线进行细化处理.在已有的两个逻辑规则基础上,增加了若干限制条件,处理了模板的对称性问题.同时还给出了删除数组,提高了算法的运行速度.从运行结果看,没有发生骨架畸变现象,避免了过度腐蚀,具有较好的连通性,此方法的细化效果较为理想.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.

关 键 词：等高线 细化 并行算法 骨架 连通性 

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