期刊文献+

基于动态规划算法的矢量压缩方法研究与改进 被引量:4

Research and improvement of method for vector data compression based on dynamic programming
下载PDF
导出
摘要 将动态规划算法应用于矢量数据压缩是一种非常有效的优化压缩方法,可以得到压缩误差最小的压缩曲线,但是会导致局部失真明显。针对该缺点提出一种改进算法,通过在动态规划算法执行过程中设定阈值限制最大位移来防止局部失真,同时对A.KOLESNIKOV等提出的原动态规划算法公式的错误进行了纠正。实验表明,改进算法在保持原算法优势的同时,可以较好地解决压缩曲线局部失真问题。 The application of dynamie programming to vector data compression is a very. effective method of optimized compression. The error of the result compressed by this method is minimal. But it can lead to local distortion. Aiming at this disadvantage, an improved algorithm was proposed. The improved algorithm prevents from local distortion by setting threshold to limit the maximum displacement in the process of executing and corrects the problem existing in the formula of dynamic programming in the scheme presented by A. KOLESNIKOV et al. The experimental results show that the improved algorithm can deal well with the problem of local distortion while maintaining the advantage of the dynamic programming algorithm.
出处 《计算机应用》 CSCD 北大核心 2009年第4期966-968,1007,共4页 journal of Computer Applications
关键词 动态规划算法 矢量数据压缩 压缩误差 局部失真 dynamic programming algorithm vector data compression compressing error local distortion
  • 相关文献

参考文献5

二级参考文献18

  • 1钟尚平,高庆狮.一类矢量地图的无损压缩算法[J].系统仿真学报,2004,16(10):2189-2194. 被引量:13
  • 2杨建宇,杨崇俊,明冬萍,任应超,李津平.WebGIS系统中矢量数据的压缩与化简方法综述[J].计算机工程与应用,2004,40(32):36-38. 被引量:26
  • 3刘晓红,李树军.矢量数据压缩的角度分段道格拉斯算法研究[J].四川测绘,2005,28(2):51-52. 被引量:25
  • 4Perez J C,Vidal E.Optimum polygonal approximation of digitized eurves[J].Pattern Recognition Letters, 1994,15:743-750.
  • 5Kolesnikov A,Franti P.Reduced-search dynamic programming for approximation of polygonal curves[J].Pattern Recognition Letters,2003, 24: 2243-2254.
  • 6Kolesnikov A,Franti P.Data reduction of large vector graphics[J]. Pattern Recognition, 2005,38 : 381-394.
  • 7李德仁,数字地球与3S技术,中国地理信息系统协会论文集,1999
  • 8郑海鹰.计算机地图制图[M].郑州:中国人民解放军测绘学院出版社,1997.59-60.
  • 9朱子豪.地理资讯系统技术[EB/OL].[2006-03].http://www.geog.ntu.edu.tw/course/gistech.
  • 10DOUGLAS D H, PEUCKER T K. Algorithm for the reduction of the number of points required to represent a digitized line or its caricature [ J ]. The Canadian Cartographer, 1973,10 (2) : 112-122.

共引文献29

同被引文献38

引证文献4

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部