Heuristic-driven Graph Wavelet Modeling of Complex Terrain

We present a novel method for building a multiresolution representation of large digital surface models. The surface points coincide with the nodes of a planar graph which can be processed using a critically sampled, invertible lifting scheme. To drive the lazy wavelet node partitioning, we employ an attribute aware cost function based on the generalized quadric error metric. The resulting algorithm can be applied to multivariate data by storing additional attributes at the graph's nodes. We discuss how the cost computation mechanism can be coupled with the lifting scheme and examine the results by evaluating the root mean square error. The algorithm is experimentally tested using two multivariate LiDAR sets representing terrain surface and vegetation structure with different sampling densities.


Editor(s):
Wang, Y
Jiang, X
Zhang, D
Published in:
Sixth International Conference On Graphic And Image Processing (Icgip 2014), 9443, 94431Y
Presented at:
6th International Conference on Graphic and Image Processing (ICGIP), Beijing, PEOPLES R CHINA, OCT 24-26, 2014
Year:
2015
Publisher:
Bellingham, Spie-Int Soc Optical Engineering
ISSN:
0277-786X
ISBN:
978-1-62841-558-2
Keywords:
Laboratories:




 Record created 2015-09-28, last modified 2018-09-13


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)