Robust 3-D Plane Segmentation From Airborne Point Clouds Based on Quasi-A-Contrario Theory

Xinyi Liu, Xianzhang Zhu, Xinyi Liu 0002, Yongjun Zhang, Yi Wan, Yansong Duan

Abstract

Extracting planar surfaces from 3-D point clouds is essential for urban modeling and autonomous navigation. However, noise and varying point densities in airborne LiDAR and multi-view stereo (MVS) data pose significant challenges for traditional segmentation methods. This paper presents QTPS (Quasi-A-Contrario Theory-based Plane Segmentation), a novel algorithm that utilizes probabilistic "meaningfulness" to detect planes. By identifying structures statistically unlikely to occur by chance, QTPS achieves superior precision and robustness against noise compared to standard techniques like RANSAC.

Introduction

The reconstruction of 3-D city models relies heavily on the accurate extraction of flat surfaces from point clouds. While airborne LiDAR and MVS cameras provide dense spatial data, the resulting point clouds are often contaminated with noise, occlusions, and varying densities. Existing approaches—such as region growing, RANSAC-based model fitting, and feature clustering—frequently struggle with high noise levels, leading to "jittery" or inaccurately oriented planes. These methods often rely on rigid distance thresholds that fail to distinguish between true planar points and structured noise.

Methodology: The QTPS Framework

The proposed QTPS algorithm leverages Quasi-A-Contrario theory, rooted in the Helmholtz principle: a geometric structure is considered "meaningful" if its occurrence in a random noise background is statistically improbable.

Quasi-A-Contrario Theory

Instead of using a fixed distance threshold for all points, QTPS calculates the Number of False Alarms (NFA). This metric estimates the likelihood that a specific arrangement of points is a random fluke. A low NFA indicates a "meaningful" structure. The "Quasi" aspect refers to the use of a simplified white noise background model to reduce mathematical complexity.

Geometric model of plane fitting and distance thresholds.

Algorithmic Pipeline

  1. Multiscale Supervoxel Segmentation: The point cloud is partitioned into supervoxels to manage computational load.
  2. Planar Subset Extraction: The algorithm identifies the most "rigid" subset of points within each supervoxel. Subsets with a low NFA are designated as Fine Planar Supervoxels (FPS).
  3. FPS Optimization: These high-precision seeds are refined by incorporating nearby unclassified points that statistically belong to the plane.
  4. Region Growing: Finally, adjacent FPS units with similar orientations are merged to form continuous large-scale planes, such as building roofs or facades.
FPS-based region growing for building segmentation.

Experimental Evaluation

The performance of QTPS was validated using simulated data and three real-world datasets: Dublin City Center (high noise ALS), Ningbo (sparse ALS), and Dortmund (MVS).

Key Results

  • Precision: In the Dublin dataset, QTPS achieved a Root Mean Square Error (RMSE) of 0.0183m, significantly outperforming Efficient RANSAC (0.0286m) and Octree-based Region Growing (0.0446m).
  • Robustness: Simulated tests demonstrated that QTPS maintains high accuracy even with a noise ratio as high as 75%.
  • Detail Preservation: The method successfully preserved small architectural features like eaves and windowsills, which are often lost in traditional smoothing processes.

Conclusion

QTPS provides a robust and precise solution for 3-D plane segmentation by shifting the focus from hard distance thresholds to statistical meaningfulness. While the algorithm can occasionally detect "pseudo-planes" in extremely structured noise and may be slower than simpler methods, its ability to handle high-noise environments and preserve fine details makes it a powerful tool for building reconstruction. Future work will focus on integrating topological analysis to further refine the logical structure of the generated 3-D models.

Summary updated

Abstract

Three-dimensional (3-D) plane segmentation has been and continues to be a challenge in 3-D point cloud processing. The current methods typically focus on the planar subsets separation but ignore the requirement of the precise plane fitting. We propose a quasi-a-contrario theory-based plane segmentation algorithm, which is capable of dealing with point clouds of severe noise level, low density, and high complexity robustly. The main proposition is that the final plane can be composed of basic planar subsets with high planar accuracy. We cast planar subset extraction from the point set as a geometric rigidity measuring problem. The meaningfulness of the planar subset is estimated by the number of false alarms (NFA), which can be used to eliminate false-positive effectively. Experiments were conducted to analyze both the planar subset extraction and the 3-D plane segmentation. The results show that the proposed algorithms perform well in terms of accuracy and robustness compared with state-of-art methods. Experimental datasets, results, and executable program of the proposed algorithm are available at https://skyearth.org/publication/project/QTPS.
BibTeX
@article{liu2021robust,
  author = {Xinyi Liu and Xianzhang Zhu and Xinyi Liu and Yongjun Zhang and Yi Wan and Yansong Duan},
  title = {{Robust 3-D Plane Segmentation From Airborne Point Clouds Based on Quasi-A-Contrario Theory}},
  journal = {IEEE JSTARS},
  year = {2021},
  doi = {10.1109/jstars.2021.3093576},
}
Figure