Filtering airborne LiDAR data by embedding smoothness-constrained segmentation in progressive TIN densification

被引:146
作者
Zhang, Jixian [1 ]
Lin, Xiangguo [1 ]
机构
[1] Chinese Acad Surveying & Mapping, Key Lab Mapping Space, Beijing 100830, Peoples R China
基金
中国博士后科学基金;
关键词
Airborne LiDAR; Filtering; Progressive TIN densification; Point cloud segmentation; Segmentation using smoothness constraint; LASER-SCANNING DATA; POINT CLOUDS; ALGORITHMS; MODELS;
D O I
10.1016/j.isprsjprs.2013.04.001
中图分类号
P9 [自然地理学];
学科分类号
0705 ; 070501 ;
摘要
Progressive TIN densification (PTD) is one of the classic methods for filtering airborne LiDAR point clouds. However, it may fail to preserve ground measurements in areas with steep terrain. A method is proposed to improve the PTD using a point cloud segmentation method, namely segmentation using smoothness constraint (SUSC). The classic PTD has two core steps. The first is selecting seed points and constructing the initial TIN. The second is an iterative densification of the TIN. Our main improvement is embedding the SUSC between these two steps. Specifically, after selecting the lowest points in each grid cell as initial ground seed points, SUSC is employed to expand the set of ground seed points as many as possible, as this can identify more ground seed points for the subsequent densification of the TIN-based terrain model. Seven datasets of ISPRS Working Group III/3 are utilized to test our proposed algorithm and the classic PTD. Experimental results suggest that, compared with the PTD, the proposed method is capable of preserving discontinuities of landscapes and reducing the omission errors and total errors by approximately 10% and 6% respectively, which would significantly decrease the cost of the manual operation required for correcting the result in post-processing. (C) 2013 International Society for Photogrammetry and Remote Sensing, Inc. (ISPRS) Published by Elsevier B.V. All rights reserved.
引用
收藏
页码:44 / 59
页数:16
相关论文
共 32 条
[1]  
[Anonymous], 2010, ANN: a library for approximate nearest neighbor searching
[2]  
[Anonymous], 2004, P INT SOC PHOTOGRAMM
[3]  
Arefi H., 2005, ISPRS Journal of Photogrammetry Remote Sensing, V36, P120
[4]   An optimal algorithm for approximate nearest neighbor searching in fixed dimensions [J].
Arya, S ;
Mount, DM ;
Netanyahu, NS ;
Silverman, R ;
Wu, AY .
JOURNAL OF THE ACM, 1998, 45 (06) :891-923
[5]  
Axelsson P., 2000, The International Archives of the Photogrammetry and Remote Sensing, Amsterdam, The Netherlands, VXXXIII, P110, DOI DOI 10.1016/J.ISPRSJPRS.2005.10.005
[6]  
Chen H, 2012, INT ARCH PHOTOGRAMME, VXXXIX-B4, P364
[7]   Filtering airborne laser scanning data with morphological methods [J].
Chen, Qi ;
Gong, Peng ;
Baldocchi, Dennis ;
Xie, Gengxin .
PHOTOGRAMMETRIC ENGINEERING AND REMOTE SENSING, 2007, 73 (02) :175-185
[8]   3D information extraction from laser point clouds covering complex road junctions [J].
Elberink, Sander J. Oude ;
Vosselman, George .
PHOTOGRAMMETRIC RECORD, 2009, 24 (125) :23-36
[9]   Segmentation of airborne laser scanning data using a slope adaptive neighborhood [J].
Filin, S ;
Pfeifer, N .
ISPRS JOURNAL OF PHOTOGRAMMETRY AND REMOTE SENSING, 2006, 60 (02) :71-80
[10]  
Hyyppa J., 2001, The Photogrammetric Journal of Finland, V17, P58