Acta Geodaetica et Cartographica Sinica ›› 2018, Vol. 47 ›› Issue (2): 269-274.doi: 10.11947/j.AGCS.2018.20170493

Previous Articles     Next Articles

Bilevel Optimization for Scene Segmentation of LiDAR Point Cloud

LI Minglei1, LIU Shaochuang2, YANG Huan3, QI Chen3   

  1. 1. College of Electronic and Information Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing 211106, China;
    2. Institute of Remote Sensing and Digital Earth, Chinese Academy of Sciences, Beijing 100101, China;
    3. School of Geodesy and Geomatics, Wuhan University, Wuhan 430079, China
  • Received:2017-09-01 Revised:2017-11-29 Online:2018-02-20 Published:2018-03-02
  • Supported by:
    The Natural Science Foundation of Jiangsu Province of China (No. BK20170781)

Abstract: The segmentation of point clouds obtained by light detection and ranging (LiDAR) systems is a critical step for many tasks,such as data organization,reconstruction and information extraction.In this paper,we propose a bilevel progressive optimization algorithm based on the local differentiability.First,we define the topological relation and distance metric of points in the framework of Riemannian geometry,and in the point-based level using k-means method generates over-segmentation results,e.g.super voxels.Then these voxels are formulated as nodes which consist a minimal spanning tree.High level features are extracted from voxel structures,and a graph-based optimization method is designed to yield the final adaptive segmentation results.The implementation experiments on real data demonstrate that our method is efficient and superior to state-of-the-art methods.

Key words: point cloud segmentation, Riemannian geometry, super voxel, minimal spanning tree, feature extraction

CLC Number: