Improved Priority‐Flood method for depression filling by redundant calculation optimization in local micro‐relief areas

Depression filling is a critical step in distributed hydrological modeling using digital elevation models (DEMs). The traditional Priority‐Flood (PF) approach is widely used due to its relatively high efficiency when dealing with a small‐sized DEM. However, it seems inadequate and inefficient when dealing with large high‐resolution DEMs. In this work, we examined the relationship between the PF algorithm calculation process and the topographical characteristics of depressions, and found significant redundant calculations in the local micro‐relief areas in the conventional PF algorithm. As such calculations require more time when dealing with large DEMs, we thus propose a new variant of the PF algorithm, wherein redundant points and calculations are recognized and eliminated based on the local micro‐relief water‐flow characteristics of the depression‐filling process. In addition, depressions and flatlands were optimally processed by a quick queue to improve the efficiency of the process. The proposed method was applied and validated in eight case areas using the Shuttle Radar Topography Mission digital elevation model (SRTM‐DEM) with 1 arc‐second resolution. These selected areas have different data sizes. A comparative analysis among the proposed method, the Wang and Liu‐based PF, the improved Barnes‐based PF, the improved Zhou‐based PF, and the Planchon and Darboux (P&D) algorithms was conducted to evaluate the accuracy and efficiency of the proposed algorithm. The results showed that the proposed algorithm is 43.2% (maximum) faster than Wang and Liu's variant of the PF method, with an average of 31.8%. In addition, the proposed algorithm achieved similar performance to the improved Zhou‐based PF algorithm, though our algorithm has the advantage of being simpler. The optimal strategies using the proposed algorithm can be employed in various landforms with high efficiency. The proposed method can also achieve good depression filling, even with large amounts of DEM data.

[1]  Serge Beucher,et al.  The Morphological Approach to Segmentation: The Watershed Transformation , 2018, Mathematical Morphology in Image Processing.

[2]  Zhang Ka,et al.  Chinese progress in geomorphometry , 2017 .

[3]  Michael Bock,et al.  System for Automated Geoscientific Analyses (SAGA) v. 2.1.4 , 2015 .

[4]  Richard Barnes.  Parallel Priority-Flood depression filling for trillion cell digital elevation models on desktops or clusters , 2016, Comput. Geosci..

[5]  Richard Barnes,et al.  Priority-Flood: An Optimal Depression-Filling and Watershed-Labeling Algorithm for Digital Elevation Models , 2015, Comput. Geosci..

[6]  Richard Barnes,et al.  An efficient assignment of drainage direction over flat surfaces in raster digital elevation models , 2015, Comput. Geosci..

[7]  Ian Cluckie,et al.  An effective depression filling algorithm for DEM-based 2-D surface flow modelling , 2013 .

[8]  A-Xing Zhu,et al.  Paleotopographic controls on modern gully evolution in the loess landforms of China , 2017, Science China Earth Sciences.

[9]  Xiaoli Liu,et al.  Parallel identification and filling of depressions in raster digital elevation models , 2017, Int. J. Geogr. Inf. Sci..

[10]  Guiyun Zhou,et al.  An efficient variant of the Priority-Flood algorithm for filling depressions in raster digital elevation models , 2016, Comput. Geosci..

[11]  Guonian Lv,et al.  Chinese progress in geomorphometry , 2017, Journal of Geographical Sciences.

[12]  John F. O'Callaghan,et al.  The extraction of drainage networks from digital elevation data , 1984, Comput. Vis. Graph. Image Process..

[13]  Lisa Dresner,et al.  Hydrologic And Hydraulic Modeling Support With Geographic Information Systems , 2016 .

[14]  David G. Tarboton,et al.  On the extraction of channel networks from digital elevation data , 1991 .

[15]  Liyang Xiong,et al.  Landform‐oriented flow‐routing algorithm for the dual‐structure loess terrain based on digital elevation models , 2014 .

[16]  S. K. Jenson,et al.  Extracting topographic structure from digital elevation data for geographic information-system analysis , 1988 .

[17]  Frédéric Darboux,et al.  A fast, simple and versatile algorithm to fill the depressions of digital elevation models , 2002 .

[18]  Salles V. G. Magalhães,et al.  A New Method for Computing the Drainage Network Based on Raising the Level of an Ocean Surrounding the Terrain , 2012, AGILE Conf..

[19]  Guiyun Zhou,et al.  Efficient Priority-Flood depression filling in raster digital elevation models , 2019, Int. J. Digit. Earth.

[20]  Pierre Soille,et al.  An Efficient Algorithm for Drainage Network Extraction on DEMs , 1994, J. Vis. Commun. Image Represent..

[21]  Guy Vézina,et al.  Visualizing soil surfaces and crop residues , 1993, IEEE Computer Graphics and Applications.

[22]  Neil S. Arnold,et al.  A new approach for dealing with depressions in digital elevation models when calculating flow accumulation values , 2010 .

[23]  J. Lindsay,et al.  Removal of artifact depressions from digital elevation models: towards a minimum impact approach , 2005 .

[24]  Qing Zhu,et al.  An efficient depression processing algorithm for hydrologic analysis , 2006, Comput. Geosci..

[25]  L. Wang,et al.  An efficient method for identifying and filling surface depressions in digital elevation models for hydrologic analysis and modelling , 2006, Int. J. Geogr. Inf. Sci..

[26]  Helena Mitasova,et al.  Accurate stream extraction from large, radar-based elevation models , 2010 .

[27]  Qingquan Li,et al.  An enhanced approach for surface flow routing over drainage‐constrained triangulated irregular networks , 2018, Trans. GIS.

[28]  K. Nikolakopoulos,et al.  SRTM vs ASTER elevation products. Comparison for two regions in Crete, Greece , 2006 .

[29]  Michael F. Goodchild,et al.  GIS and land-surface-subsurface modeling. , 1993 .

[30]  Antonio J. Rueda Ruiz,et al.  A flooding algorithm for extracting drainage networks from unprocessed digital elevation models , 2013, Comput. Geosci..