地球信息科学学报 ›› 2015, Vol. 17 ›› Issue (1): 15-21.doi: 10.3724/SP.J.1047.2015.00015

• • 上一篇    下一篇

一种以等差分级的DEM填洼算法

高翔(), 蔡国林, 徐柱*(), 蔡伟娣   

  1. 西南交通大学遥感信息工程系,成都 611756
  • 收稿日期:2014-02-11 修回日期:2014-04-02 出版日期:2015-01-10 发布日期:2015-01-05
  • 通讯作者: 徐柱 E-mail:15281063584@163.com;xuzhucn@gmail.com
  • 作者简介:

    作者简介:高 翔(1989-),男,江苏盐城人,硕士生,研究方向为地图制图学与地理信息系统。E-mail:15281063584@163.com

  • 基金资助:
    教育部“新世纪优秀人才支持计划”(NCET-12-0942);“2011计划”轨道交通安全协同创新中心西南交通大学先行先试项目;国家测绘地理信息局重点实验室开放基金项目(DM2013SC03)

A New Algorithm to Fill Depressions in Digital Elevation Model Based on Arithmetic Arrays

GAO Xiang(), CAI Guolin, XU Zhu*(), CAI Weidi   

  1. Department of RS and GIS, Southwest Jiaotong University, Chengdu 611756, China
  • Received:2014-02-11 Revised:2014-04-02 Online:2015-01-10 Published:2015-01-05
  • Contact: XU Zhu E-mail:15281063584@163.com;xuzhucn@gmail.com
  • About author:

    *The author: CHEN Nan, E-mail:fjcn99@163.com

摘要:

DEM的填洼是水系提取中最耗时的过程。真实的地表低高程点通常在空间上相邻,在对低高程栅格进行填洼时,少数栅格的高程值更新会导致级内大量栅格的循环迭代,从而消耗大量运算时间。为了提高DEM的填洼效率,在分级填洼的基础上,提出一种等差分级填洼算法,该算法顾及DEM各级填洼时间呈幂函数逐级递减这一地形规律。算法首先创建一系列数组,数组大小随等差数列递增;然后依次将排序后的DEM数据存放至数组中,由于定义的数组大小逐渐增大,因此,低高程区域被“分割”得很细;最后,当填洼运算从级内转至数组内时,低高程区域细致的划分极大缩短了栅格循环迭代时间,从而使得算法获得了较高的效率。新算法既能有效缩短填洼过程中的迭代时间,又能保证所提取水系的完整性与连贯性。为验证算法的有效性,选用四川省不同地区的SRTM 90 m分辨率DEM作为实验数据,并与已有的DEM分级填洼算法进行对比分析。实验结果显示:当研究区域栅格总数达到两千万个时,本文算法填洼效率提升了50%左右,且随着DEM数据量的增大,算法效率的提升更为明显,与此同时,利用新方法进行填洼后,DEM水文线连续性较强,表明了新方法的有效性。

关键词: DEM, 洼地填充, 等差分级

Abstract:

Depressions cause errors or breaks when extracting rivers from DEM. Filling the depressions in the initial DEM is important. Low elevated surface areas in space are usually adjacent, and high elevated surface areas in space are always discrete. Therefore, when the grids of low elevated areas are filled, a large number of grids in low elevated areas will have to be recalculated, which makes the process of depression filling more complex. This paper investigates a new ranking algorithm for improving the efficiency of filling the depressions of DEM. First, considering the fact that the depression filling time in different pieces decreases in the form of power function, the algorithm creates a list of variable arrays. Then the data of DEM, which has been ranked using quicksort algorithm, is put into the arrays successively. Finally, grids are filled within the variable arrays, whose lengths are increased with respect to arithmetic sequence. As the lengths of the arrays are increased, the low elevated areas are divided finely. With the increase of elevation, the arrays will contain more numbers of grids, which will reduce the depth of seeking path in iterations for the unfilled grids. The new algorithm keeps the integrity and continuity of the drainage networks extracted by the pits-removed DEM and well reduces the depth of seeking path in iterations to accelerate pits-removing process. To illustrate this approach, the algorithm has been employed in the SRTM DEM at a 90-meter resolution of Chengdu City. The results show a considerable efficiency. The efficiency of the algorithm outperforms the traditional algorithm, as it will improve 50% efficiency compared with previous algorithm when the number of grids of DEM reaches 20 million. And the improvement will be more evident when the amount of DEM data increases.

Key words: DEM (Digital Elevation Model), depression filling, arithmetic arrays