Translator Disclaimer
10 March 2015 Graph-connected components for filtering urban LiDAR data
Yassine Belkhouche, Prakash Duraisamy, Bill Buckles
Author Affiliations +
Abstract
A graph-based approach for modeling and solving the LiDAR filtering problem in urban areas is established. Our method consists of three steps. In the first step, we construct a graph-based representation of the LiDAR data, where either the Delaunay triangulation or the K-nearest neighbors graph is used. Given a set of features extracted from LiDAR data, we introduce an algorithm to label the edges of this graph. In this second step, we define criteria to eliminate some of the graph edges and then use a connected components algorithm to detect the different components in the graph representation. Finally, these components are classified into terrain or objects. Different datasets with different characteristics have been used to analyze the performance of our method. We compared our method against two other methods, and results show that our method outperforms the other methods in most tests cases.
© 2015 Society of Photo-Optical Instrumentation Engineers (SPIE) 1931-3195/2015/$25.00 © 2015 SPIE
Yassine Belkhouche, Prakash Duraisamy, and Bill Buckles "Graph-connected components for filtering urban LiDAR data," Journal of Applied Remote Sensing 9(1), 096075 (10 March 2015). https://doi.org/10.1117/1.JRS.9.096075
Published: 10 March 2015
JOURNAL ARTICLE
13 PAGES


SHARE
Lens.org Logo
CITATIONS
Cited by 5 scholarly publications.
Advertisement
Advertisement
RELATED CONTENT

Graph-based filtering of urban LiDAR data
Proceedings of SPIE (May 05 2014)
Filter algorithm for airborne LIDAR data
Proceedings of SPIE (November 15 2007)
Feature extraction with LIDAR data and aerial images
Proceedings of SPIE (October 28 2006)

Back to Top