Image of Efficient coarse registration method using translation- and rotation-invariant local descriptors towards fully automated forest inventory

Text

Efficient coarse registration method using translation- and rotation-invariant local descriptors towards fully automated forest inventory

In this paper, we present a simple, efficient, and robust algorithm for 2D coarse registration of two point clouds. In the proposed algorithm, the locations of some distinct objects are detected from the point cloud data, and a rotation- and translation-invariant feature descriptor vector is computed for each of the detected objects based on the relative locations of the neighboring objects. Subsequently, the feature descriptors obtained for the different point clouds are compared against one another by using the Euclidean distance in the feature space as the similarity criterion. By using the nearest neighbor distance ratio, the most promising matching object pairs are found and further used to fit the optimal Euclidean transformation between the two point clouds. Importantly, the time complexity of the proposed algorithm scales quadratically in the number of objects detected from the point clouds. We demonstrate the proposed algorithm in the context of forest inventory by performing coarse registration between terrestrial and airborne point clouds. To this end, we use trees as the objects and perform the coarse registration by using no other information than the locations of the detected trees. We evaluate the performance of the algorithm using both simulations and three test sites located in a boreal forest. We show that the algorithm is fast and performs well for a large range of stem densities and for test sites with up to 10 ​000 trees. Additionally, we show that the algorithm works reliably even in the case of moderate errors in the tree locations, commission and omission errors in the tree detection, and partial overlap of the data sets. We also demonstrate that additional tree attributes can be incorporated into the proposed feature descriptor to improve the robustness of the registration algorithm provided that reliable information of these additional tree attributes is available. Furthermore, we show that the registration accuracy between the terrestrial and airborne point clouds can be significantly improved if stem positions estimated from the terrestrial data are matched to stem positions obtained from the airborne data instead of matching them to tree top positions estimated from the airborne data. Even though the 2D coarse registration algorithm is demonstrated in the context of forestry, the algorithm is not restricted to forest data and it may potentially be utilized in other applications, in which efficient 2D point set registration is needed.

Ketersediaan
06621.3678Perpustakaan BIG (Eksternal Harddisk)Tersedia
Informasi Detail
Judul Seri
ISPRS Open Journal of Photogrammetry and Remote Sensing
No. Panggil
621.3678
Penerbit
Amsterdam : Elsevier.,
Deskripsi Fisik
16 hlm PDF, 4.155 KB
Bahasa
Inggris
ISBN/ISSN
1872-8235
Klasifikasi
621.3678
Tipe Isi
text
Tipe Media
-
Tipe Pembawa
-
Edisi
Vol.2, December 2021
Subjek
Point cloud registration
Coarse registration
Airborne laser scanning
Mobile laser scanning
Handheld laser scanning
Individual tree detection
Info Detail Spesifik
-
Pernyataan Tanggungjawab
Versi lain/terkait

Tidak tersedia versi lain

Lampiran Berkas
  • Efficient coarse registration method using translation- and rotation-invariant local descriptors towards fully automated forest inventory
    In this paper, we present a simple, efficient, and robust algorithm for 2D coarse registration of two point clouds. In the proposed algorithm, the locations of some distinct objects are detected from the point cloud data, and a rotation- and translation-invariant feature descriptor vector is computed for each of the detected objects based on the relative locations of the neighboring objects. Subsequently, the feature descriptors obtained for the different point clouds are compared against one another by using the Euclidean distance in the feature space as the similarity criterion. By using the nearest neighbor distance ratio, the most promising matching object pairs are found and further used to fit the optimal Euclidean transformation between the two point clouds. Importantly, the time complexity of the proposed algorithm scales quadratically in the number of objects detected from the point clouds. We demonstrate the proposed algorithm in the context of forest inventory by performing coarse registration between terrestrial and airborne point clouds. To this end, we use trees as the objects and perform the coarse registration by using no other information than the locations of the detected trees. We evaluate the performance of the algorithm using both simulations and three test sites located in a boreal forest. We show that the algorithm is fast and performs well for a large range of stem densities and for test sites with up to 10 ​000 trees. Additionally, we show that the algorithm works reliably even in the case of moderate errors in the tree locations, commission and omission errors in the tree detection, and partial overlap of the data sets. We also demonstrate that additional tree attributes can be incorporated into the proposed feature descriptor to improve the robustness of the registration algorithm provided that reliable information of these additional tree attributes is available. Furthermore, we show that the registration accuracy between the terrestrial and airborne point clouds can be significantly improved if stem positions estimated from the terrestrial data are matched to stem positions obtained from the airborne data instead of matching them to tree top positions estimated from the airborne data. Even though the 2D coarse registration algorithm is demonstrated in the context of forestry, the algorithm is not restricted to forest data and it may potentially be utilized in other applications, in which efficient 2D point set registration is needed.
Komentar
Anda harus masuk sebelum memberikan komentar