A greedy-based multiquadric method for LiDAR-derived ground data reduction

Abstract

A new greedy-based multiquadric method (MQ-G) has been developed to perform LiDAR-derived ground data reduction by selecting a certain amount of significant terrain points from the raw dataset to keep the accuracy of the constructed DEMs as high as possible, while maximally retaining terrain features. In the process of MQ-G, the significant terrain points were selected with an iterative process. First, the points with the maximum and minimum elevations were selected as the initial significant points. Next, a smoothing MQ was employed to perform an interpolation with the selected critical points. Then, the importance of all candidate points was assessed by interpolation error (i.e. the absolute difference between the interpolated and actual elevations). Lastly, the most significant point in the current iteration was selected and used for point selection in the next iteration. The process was repeated until the number of selected points reached a pre-set level or no point was found to have the interpolation error exceeding a user-specified accuracy tolerance. In order to avoid the huge computing cost, a new technique was presented to quickly solve the systems of MQ equations in the global interpolation process, and then the global MQ was replaced with the local one when a certain amount of critical points were selected. Four study sites with different morphologies (i.e. flat, undulating, hilly and mountainous terrains) were respectively employed to comparatively analyze the performances of MQ-G and the classical data selection methods including maximum z-tolerance (Max-Z) and the random method for reducing LiDAR-derived ground datasets. Results show that irrespective of the number of selected critical points and terrain characteristics, MQ-G is always more accurate than the other methods for DEM construction. Moreover, MQ-G has a better ability of preserving terrain feature lines, especially for the undulating and hilly terrains.