Analysis of Time Complexities and Accuracy of Depression FillingAlgorithms in DEM

Journal Title: IOSR Journals (IOSR Journal of Computer Engineering) - Year 2015, Vol 17, Issue 3

Abstract

Abstract: The recent development of digital representation has stimulated the development of automaticextraction of topographic and hydrologic information from Digital Elevation Model (DEM). A DEM is used tocreate hydrologic models which can be used for various purposes such as predicting stream discharges, rivernetwork definition, estimating flood extent and timing, locating areas contributing pollutants to a stream, andsimulating the effects of landscape alterations on surface water runoff. DEM is processed to produce accuratestream delineation. The process includes filling of sinks and depressions, treating flat areas and determining flow direction at every pixel. Depressions (or pits) and flat surfaces (or flats) are general types of terrain inraster digital elevation models. Depressions are lower areas surrounded by terrain without outlets and flatsurfaces are areas with no local gradient. The problem with these pits and depressions is that they interruptcontinuous flow paths in DEMs. To avoid these problems, all pits have to be rectified and create adepressionless DEM before calculating flow directions or any related topographic parameters. Variousalgorithms like Jenson and Dominigue, Planchon and Darboux, Carving etc. have been developed to treat thesinks, depressions and flat areas. The conventional methods are computationally intensive and time consuming.Moreover they are inadequate for high resolution DEMs. The conventional algorithms for creating adepressionless DEM have time complexity of O(n2) where n is the number of cells.Drainage networks obtained after processing the DEM should be accurate. At the same time it is desirable tosimplify the automatic extracting procedure with minimum modification to retain its originality. Recentimprovements are successful in reducing the complexity to O(nlogn) with accuracy, minimum space and timerequirement and less modifications to pixels. This survey analyses on various conventional approaches to filldepressions, their time complexities, advantages, limitations and evolution of modern methodologies withimproved time requirements and accuracy.

Authors and Affiliations

Kritika Pathak , Praveen Kaushik

Keywords

DEM

Related Articles

 Secured Messaging Using Hybrid Compression Technique

 In today’s era SMS message is very fast communication way. Communication done through SMS are more faster and simple. So many people are using SMS communication in their day to day life. Also confidential informa...

 Displaying All Bangla Compound Letters & Alphabets By 32-Segment

 Abstract: Different approaches have been proposed for representing Bangla and English alphabets and numerals by segment display. But there is no complete and accurate scheme has been done yet for Bangla compound...

 Image Steganography and Global Terrorism

 This paper informs the reader how an innocent looking digital image hides a deadly terrorist plan. It analyses the strengths of image steganography and the reasons why terrorists are relying on it. It also aims t...

Hadoop add-on API for Advanced Content Based Search & Retrieval

Abstract:Unstructured data like doc, pdf is lengthy to search and filter for desired information. We need to go through every file manually for finding information. It is very time consuming and frustrating. We can use f...

Pleurogenoides neelimae n. sp. (Trematoda: Pleurogenidae) from the intestine of a freshwater fish Wallago attu (Bloch)

Pleurogenoides neelimae n. sp. from a fresh water siluroid fish, Wallago attu (Bloch) is described. It is distinguished from other species in having an oral sucker more or less equal to the ventral sucker, genital pore i...

Download PDF file
  • EP ID EP158532
  • DOI -
  • Views 70
  • Downloads 0

How To Cite

Kritika Pathak, Praveen Kaushik (2015).  Analysis of Time Complexities and Accuracy of Depression FillingAlgorithms in DEM. IOSR Journals (IOSR Journal of Computer Engineering), 17(3), 26-34. https://europub.co.uk/articles/-A-158532