Share Email Print

Proceedings Paper

Graph-based filtering of urban LiDAR data
Author(s): Yassine Belkhouche; Bill Buckles; Prakash Duraisamy; Mohammad S. Alam
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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, Delaunay triangulation or the KNN graph can be used in this step. An algorithm is introduced to label the edges of this graph. In this second step, we defined criteria to eliminate some of the graph edges, then we used a connected components algorithm to separate the graph representation into different components. Finally, these components are classified into terrain or objects. Different datasets with different characteristics have been used to analyze the performance of our method.

Paper Details

Date Published: 5 May 2014
Proc. SPIE 9094, Optical Pattern Recognition XXV, 90940I (5 May 2014); doi: 10.1117/12.2053188
Show Author Affiliations
Yassine Belkhouche, Univ. of Arkansas at Little Rock (United States)
Bill Buckles, Univ. of North Texas (United States)
Prakash Duraisamy, Old Dominion Univ. (United States)
Mohammad S. Alam, Univ. of South Alabama (United States)

Published in SPIE Proceedings Vol. 9094:
Optical Pattern Recognition XXV
David Casasent; Tien-Hsin Chao, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?