A Multiscale and Hierarchical Feature Extraction Method for Terrestrial Laser Scanning Point Cloud Classification

被引:152
作者
Wang, Zhen [1 ]
Zhang, Liqiang [1 ]
Fang, Tian [2 ]
Mathiopoulos, P. Takis [4 ,5 ]
Tong, Xiaohua [6 ]
Qu, Huamin [3 ]
Xiao, Zhiqiang [1 ]
Li, Fang [1 ]
Chen, Dong [7 ]
机构
[1] Beijing Normal Univ, Sch Geog, State Key Lab Remote Sensing Sci, Beijing 100875, Peoples R China
[2] Hong Kong Univ Sci & Technol, Kowloon, Hong Kong, Peoples R China
[3] Hong Kong Univ Sci & Technol, Dept Comp Sci & Engn, Kowloon, Hong Kong, Peoples R China
[4] Natl Observ Athens, Inst Astron Astrophys Space Applicat & Remote Sen, Athens 14536, Greece
[5] Natl & Kapodistrian Univ Athens, Dept Informat & Telecommun, Athens 15784, Greece
[6] Tongji Univ, Sch Surveying & Geoinformat, Shanghai 200092, Peoples R China
[7] Nanjing Forestry Univ, Coll Civil Engn, Nanjing 210037, Jiangsu, Peoples R China
来源
IEEE TRANSACTIONS ON GEOSCIENCE AND REMOTE SENSING | 2015年 / 53卷 / 05期
基金
中国国家自然科学基金;
关键词
AdaBoost; latent Dirichlet allocation (LDA); multiscale and hierarchical point clusters (MHPCs); object classification; 3D; REPRESENTATION; RECOGNITION; MODEL;
D O I
10.1109/TGRS.2014.2359951
中图分类号
P3 [地球物理学]; P59 [地球化学];
学科分类号
0708 ; 070902 ;
摘要
The effective extraction of shape features is an important requirement for the accurate and efficient classification of terrestrial laser scanning (TLS) point clouds. However, the challenge of how to obtain robust and discriminative features from noisy and varying density TLS point clouds remains. This paper introduces a novel multiscale and hierarchical framework, which describes the classification of TLS point clouds of cluttered urban scenes. In this framework, we propose multiscale and hierarchical point clusters (MHPCs). In MHPCs, point clouds are first resampled into different scales. Then, the resampled data set of each scale is aggregated into several hierarchical point clusters, where the point cloud of all scales in each level is termed a point-cluster set. This representation not only accounts for the multiscale properties of point clouds but also well captures their hierarchical structures. Based on the MHPCs, novel features of point clusters are constructed by employing the latent Dirichlet allocation (LDA). An LDA model is trained according to a training set. The LDA model then extracts a set of latent topics, i.e., a feature of topics, for a point cluster. Finally, to apply the introduced features for point-cluster classification, we train an AdaBoost classifier in each point-cluster set and obtain the corresponding classifiers to separate the TLS point clouds with varying point density and data missing into semantic regions. Compared with other methods, our features achieve the best classification results for buildings, trees, people, and cars from TLS point clouds, particularly for small and moving objects, such as people and cars.
引用
收藏
页码:2409 / 2425
页数:17
相关论文
共 43 条
[1]  
Aldous D.J., 1985, LECT NOTES MATH, V1117, P1, DOI 10.1007/BFb0099421
[2]  
[Anonymous], 2006, FRAUNHOFER FOM
[3]  
[Anonymous], 2012, ISPRS Ann. Photogramm. Remote Sens. Spat. Inf. Sci, DOI DOI 10.5194/ISPRSANNALS-I-4-257-2012
[4]  
[Anonymous], P IM UND WORKSH MONT
[5]  
[Anonymous], P ROB SCI SYST WASH
[6]  
Bart E., 2008, PROC IEEE C COMPUT V, P1
[7]  
Blei D M, 2010, ARXIV
[8]  
Blei DM, 2004, ADV NEUR IN, V16, P17
[9]   Latent Dirichlet allocation [J].
Blei, DM ;
Ng, AY ;
Jordan, MI .
JOURNAL OF MACHINE LEARNING RESEARCH, 2003, 3 (4-5) :993-1022
[10]   Fast approximate energy minimization via graph cuts [J].
Boykov, Y ;
Veksler, O ;
Zabih, R .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2001, 23 (11) :1222-1239