检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张鸿刚 李成名 殷勇[2] 郭沛沛[2] ZHANG Honggang;LI Chengming;YIN Yong;GUO Peipei(Shandong University of Technology,Zibo,Shandong 255049,China;Chinese Academy of Surveying&Mapping,Beijing 100036,China;Guizhou Third Surveying and Mapping Institute,Guiyang 550004,China)
机构地区:[1]山东理工大学,山东淄博255049 [2]中国测绘科学研究院,北京100036 [3]贵州省第三测绘院,贵阳550004
出 处:《测绘科学》2020年第3期128-134,共7页Science of Surveying and Mapping
基 金:国家自然科学基金面上项目(41871375);贵州省科技计划项目(2018-2788)。
摘 要:针对传统曲线特征点的提取方法均采用Douglas-Peucher(D-P)算法给定阈值的思路,在曲度较大处易造成一些重要特征点缺失,在弯曲的水平距离较小处易造成非特征点保留的问题,该文提出一种改进的曲线特征点提取方法,通过自适应来提取曲线的全局特征点,即通过标准差分别计算出间隔点连线的参考值和中间点到该线垂线的参考值,比较曲线上每个点的弯曲程度与曲线整体弯曲程度的大小,来提取曲线的全局特征点。以道路和河流的实际线数据进行了实验,结果表明,该方法不仅很好地保持了曲线整体形状特征,而且大幅降低了压缩误差、提高了精度。Aiming at the problem that Douglas-Peucher(D-P) algorithm that had been widely used for the curve feature points extraction,usually caused some important feature points to be missing in the large curvature,and leaded to non-feature point retention when the horizontal distance of bending was small. In this paper,an improved method of extracting curve characteristic points was proposed.The global feature points of the curve were extracted adaptively.The reference value of the interval point connection and the reference value from the middle point to the vertical line were calculated by standard deviation,and the bending degree of each point on the curve and the overall bending degree of the curve were compared to extract the global feature points of the curve finally.The experiment was implemented by using the actual line data of roads and rivers.The experiment results showed that the method could not only maintain the overall shape characteristics of the curve,but also greatly reduced the compression error and improved the accuracy.
分 类 号:P283.7[天文地球—地图制图学与地理信息工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.118.31.32