Efficient divide-and-conquer registration of UAV and ground LiDAR point clouds through canopy shape context

Jie Shao, Wei Yao, Peng Wan, Lei Luo, Jiaxin Lyu, Wuming Zhang

Abstract

Registration of unmanned aerial vehicle laser scanning (ULS) and ground light detection and ranging (LiDAR) point clouds in forests is critical to create a detailed representation of forest structure. However, forest occlusion and the computational cost of tree segmentation pose significant challenges. We propose an automated "divide-and-conquer" strategy that splits registration into vertical and horizontal alignment. Vertical alignment is achieved through ground normal vector fitting, while horizontal alignment uses canopy projection image matching based on shape context features. Experimental results demonstrate that our method achieves horizontal alignment errors of less than 0.02 m with an average runtime of less than 1 second, proving its efficiency and accuracy for large-scale forest monitoring.

Introduction

Integrating data from multiple LiDAR platforms is essential for a holistic view of forest ecosystems. Unmanned Aerial Vehicle Laser Scanning (ULS) captures the upper canopy, while Terrestrial (TLS) or Backpack Laser Scanning (BLS) provides high-resolution details of the understory and tree trunks. Combining these datasets—a process known as registration—is often the bottleneck in forest data processing.

Traditional registration methods typically rely on artificial markers or GNSS data. In dense forests, markers are difficult to place and often occluded, while GNSS signals are frequently degraded by the canopy. Marker-free methods that rely on individual tree segmentation are often slow and sensitive to segmentation errors. This paper presents a more robust, segmentation-free approach that leverages the global geometry of the forest canopy as a natural fingerprint.

Multi-platform LiDAR data acquisition and the resulting 2D canopy projections used for horizontal alignment.

Methodology: A Divide-and-Conquer Strategy

The proposed method breaks the complex 3D registration problem into two simpler stages: vertical alignment and horizontal alignment.

1. Vertical Alignment

The first stage ensures both point clouds share a common vertical orientation. Using the Cloth Simulation Filtering (CSF) algorithm, ground points are extracted from both the ULS and ground-based datasets. The algorithm then fits a plane to these ground points and calculates their normal vectors. By rotating the point clouds so these normal vectors align with the Z-axis, the datasets are vertically normalized and aligned on the Z-axis.

The vertical alignment process: (a, b) show the raw ULS and TLS point clouds, while (c, d) illustrate the fitting of normal vectors to the ground points for alignment.

2. Horizontal Alignment via Canopy Shape Context

With the vertical axis fixed, the problem is reduced to a 2D image matching task. Vegetation points above a certain height (typically 3 meters) are projected onto a horizontal plane to create binary images.

  • Feature Extraction: Keypoints are identified along the contours of the canopy shapes using a corner detection response.
  • Matching: A "two-point congruent set" strategy finds potential matches between the ULS and ground-based images.
  • Verification: The final match is determined by the maximum pixel-wise overlap between the two projected canopy maps, filtering out false positives.

3. Fine Registration

Coarse alignment provides a near-perfect starting point for the standard Iterative Closest Point (ICP) algorithm, which performs the final fine-tuning to achieve sub-centimeter precision.

Results and Discussion

The method was rigorously evaluated across various forest types in China, including coniferous (larch, pine) and broadleaf (birch, poplar) stands.

  • Efficiency: The coarse alignment process is exceptionally fast, averaging just 0.71 seconds. This is significantly more efficient than object-level registration methods that can take minutes.
  • Accuracy: The horizontal alignment error was consistently low, with best-case scenarios under 0.02 m. Even in complex plots, the coarse alignment provided a robust foundation for final registration.
  • Robustness: The use of the entire canopy as a "natural marker" makes the method resilient to the occlusion of individual tree trunks and effective across different tree species.

Conclusion

The divide-and-conquer approach successfully addresses the efficiency and robustness issues of forest LiDAR registration. By reducing dimensionality and utilizing canopy shape context, the method enables rapid, automated integration of multi-source point clouds. Future work will focus on adaptive height thresholds for canopy projection to improve performance in extremely dense, multi-layered forest structures.

Summary updated

Abstract

Registration of unmanned aerial vehicle laser scanning (ULS) and ground light detection and ranging (LiDAR) point clouds in forests is critical to create a detailed representation of a forest structure and an accurate inversion of forest parameters. However, forest occlusion poses challenges for marker-based registration methods, and some marker-free automated registration methods have low efficiency due to the process of object (e.g., tree, crown) segmentation. Therefore, we use a divide-and-conquer strategy and propose an automated and efficient method to register ULS and ground LiDAR point clouds in forests. Registration involves coarse alignment and fine registration, where the coarse alignment of point clouds is divided into vertical and horizontal alignment. The vertical alignment is achieved by ground alignment, which is achieved by the transformation relationship between normal vectors of the ground point cloud and the horizontal plane, and the horizontal alignment is achieved by canopy projection image matching. During image matching, vegetation points are first distinguished by the ground filtering algorithm, and then, vegetation points are projected onto the horizontal plane to obtain two binary images. To match the two images, a matching strategy is used based on canopy shape context features, which are described by a two-point congruent set and canopy overlap. Finally, we implement coarse alignment of ULS and ground LiDAR datasets by combining the results of ground alignment and image matching and finish fine registration. Also, the effectiveness, accuracy, and efficiency of the proposed method are demonstrated by field measurements of forest plots. Experimental results show that the ULS and ground LiDAR data in different plots are registered, of which the horizontal alignment errors are less than 0.02 m, and the average runtime of the proposed method is less than 1 second.
BibTeX
@misc{shao2022efficient,
  author = {Jie Shao and Wei Yao and Peng Wan and Lei Luo and Jiaxin Lyu and Wuming Zhang},
  title = {{Efficient divide-and-conquer registration of UAV and ground LiDAR point clouds through canopy shape context}},
  year = {2022},
  eprint = {2201.11296},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2201.11296},
}

Loading related content...

Figure