Automatic marker-free registration of tree point-cloud data based on rotating projection

• URL: http://arxiv.org/abs/2001.11192v1
• Date: Thu, 30 Jan 2020 06:53:59 GMT
• Title: Automatic marker-free registration of tree point-cloud data based on rotating projection
• Authors: Xiuxian Xu, Pei Wang, Xiaozheng Gan, Yaxin Li, Li Zhang, Qing Zhang, Mei Zhou, Yinghui Zhao, Xinwei Li
• Abstract summary: We propose an automatic coarse-to-fine method for the registration of point-cloud data from multiple scans of a single tree. In coarse registration, point clouds produced by each scan are projected onto a spherical surface to generate a series of 2D images. corresponding feature-point pairs are then extracted from these series of 2D images. In fine registration, point-cloud data slicing and fitting methods are used to extract corresponding central stem and branch centers.
• Score: 23.08199833637939
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Point-cloud data acquired using a terrestrial laser scanner (TLS) play an important role in digital forestry research. Multiple scans are generally used to overcome occlusion effects and obtain complete tree structural information. However, it is time-consuming and difficult to place artificial reflectors in a forest with complex terrain for marker-based registration, a process that reduces registration automation and efficiency. In this study, we propose an automatic coarse-to-fine method for the registration of point-cloud data from multiple scans of a single tree. In coarse registration, point clouds produced by each scan are projected onto a spherical surface to generate a series of two-dimensional (2D) images, which are used to estimate the initial positions of multiple scans. Corresponding feature-point pairs are then extracted from these series of 2D images. In fine registration, point-cloud data slicing and fitting methods are used to extract corresponding central stem and branch centers for use as tie points to calculate fine transformation parameters. To evaluate the accuracy of registration results, we propose a model of error evaluation via calculating the distances between center points from corresponding branches in adjacent scans. For accurate evaluation, we conducted experiments on two simulated trees and a real-world tree. Average registration errors of the proposed method were 0.26m around on simulated tree point clouds, and 0.05m around on real-world tree point cloud.

Related papers

• Automatic marker-free registration based on similar tetrahedras for single-tree point clouds [14.043846409201112]
  This paper proposes a marker-free automatic registration method for single-tree point clouds based on similar tetrahedras. The proposed method significantly outperforms both ICP and NDT in registration accuracy, achieving speeds up to 593 times and 113 times faster than ICP and NDT, respectively.
  arXiv  Detail & Related papers  (2024-11-20T06:34:47Z)
• PointRegGPT: Boosting 3D Point Cloud Registration using Generative Point-Cloud Pairs for Training [90.06520673092702]
  We present PointRegGPT, boosting 3D point cloud registration using generative point-cloud pairs for training. To our knowledge, this is the first generative approach that explores realistic data generation for indoor point cloud registration.
  arXiv  Detail & Related papers  (2024-07-19T06:29:57Z)
• DIPR: Efficient Point Cloud Registration via Dynamic Iteration [4.491867613612359]
  We introduce a novel Efficient Point Cloud Registration via Dynamic It framework, DIPR, that makes the neural network interactively focus on overlapping points based on sparser input points. Our proposed approach achieves superior registration accuracy while significantly reducing computational time and GPU memory consumption compared to state-of-the-art methods.
  arXiv  Detail & Related papers  (2023-12-05T16:47:46Z)
• Zero-Shot Point Cloud Registration [94.39796531154303]
  ZeroReg is the first zero-shot point cloud registration approach that eliminates the need for training on point cloud datasets. The cornerstone of ZeroReg is the novel transfer of image features from keypoints to the point cloud, enriched by aggregating information from 3D geometric neighborhoods. On benchmarks such as 3DMatch, 3DLoMatch, and ScanNet, ZeroReg achieves impressive Recall Ratios (RR) of over 84%, 46%, and 75%, respectively.
  arXiv  Detail & Related papers  (2023-12-05T11:33:16Z)
• CorrI2P: Deep Image-to-Point Cloud Registration via Dense Correspondence [51.91791056908387]
  We propose the first feature-based dense correspondence framework for addressing the image-to-point cloud registration problem, dubbed CorrI2P. Specifically, given a pair of a 2D image before a 3D point cloud, we first transform them into high-dimensional feature space feed the features into a symmetric overlapping region to determine the region where the image point cloud overlap.
  arXiv  Detail & Related papers  (2022-07-12T11:49:31Z)
• GlobalMatch: Registration of Forest Terrestrial Point Clouds by Global Matching of Relative Stem Positions [1.3192560874022086]
  We propose an automatic, robust, and efficient method for the registration of forest point clouds. Our approach first locates tree stems from raw point clouds and then matches the stems based on their relative spatial relationship to determine the registration transformation. The algorithm requires no extra individual tree attributes and has quadratic complexity to the number of trees in the environment, allowing it to align point clouds of large forest environments.
  arXiv  Detail & Related papers  (2021-12-21T11:47:51Z)
• Simulated LiDAR Repositioning: a novel point cloud data augmentation method [0.0]
  Given a LiDAR scan of a scene from some position, how can one simulate new scans of that scene from different, secondary positions? The method defines criteria for selecting valid secondary positions, and then estimates which points from the original point cloud would be acquired by a scanner from these positions. We show that the method is more accurate at short distances, and that having a high scanner resolution for the original point clouds has a strong impact on the similarity of generated point clouds.
  arXiv  Detail & Related papers  (2021-11-20T18:35:39Z)
• Consistent Two-Flow Network for Tele-Registration of Point Clouds [74.51029406361997]
  We present a learning-based technique that allows registration between point clouds, presented in arbitrary poses, and having little or even no overlap. Our technique is based on a novel neural network design that learns a prior of a class of shapes and can complete a partial shape. We show that, compared with each separate flow, this two-flow training leads to robust and reliable tele-registration.
  arXiv  Detail & Related papers  (2021-06-01T09:03:21Z)
• DeepI2P: Image-to-Point Cloud Registration via Deep Classification [71.3121124994105]
  DeepI2P is a novel approach for cross-modality registration between an image and a point cloud. Our method estimates the relative rigid transformation between the coordinate frames of the camera and Lidar. We circumvent the difficulty by converting the registration problem into a classification and inverse camera projection optimization problem.
  arXiv  Detail & Related papers  (2021-04-08T04:27:32Z)
• SimTreeLS: Simulating aerial and terrestrial laser scans of trees [0.0]
  We present an open source tool, SimTreeLS, for generating point clouds which simulate scanning with user-defined sensor, trajectory, tree shape and layout parameters. Material classification is kept in a pointwise fashion so leaf and woody matter are perfectly known. SimTreeLS is available as an open source resource built on publicly available libraries.
  arXiv  Detail & Related papers  (2020-11-24T08:25:42Z)
• Refinement of Predicted Missing Parts Enhance Point Cloud Completion [62.997667081978825]
  Point cloud completion is the task of predicting complete geometry from partial observations using a point set representation for a 3D shape. Previous approaches propose neural networks to directly estimate the whole point cloud through encoder-decoder models fed by the incomplete point set. This paper proposes an end-to-end neural network architecture that focuses on computing the missing geometry and merging the known input and the predicted point cloud.
  arXiv  Detail & Related papers  (2020-10-08T22:01:23Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.