Towards Optimal Point Cloud Processing for 3D Reconstruction

Towards Optimal Point Cloud Processing for 3D Reconstruction

AngličtinaEbook
Zhang, Guoxiang
Springer International Publishing
EAN: 9783030961107
Dostupné online
1 539 Kč
Běžná cena: 1 710 Kč
Sleva 10 %
ks

Podrobné informace

This SpringerBrief presents novel methods of approaching challenging problems in the reconstruction of accurate 3D models and serves as an introduction for further 3D reconstruction methods. It develops a 3D reconstruction system that produces accurate results by cascading multiple novel loop detection, sifting, and optimization methods.The authors offer a fast point cloud registration method that utilizes optimized randomness in random sample consensus for surface loop detection. The text also proposes two methods  for surface-loop sifting. One is supported by a sparse-feature-based optimization graph. This graph is more robust to different scan patterns than earlier methods and can cope with tracking failure and recovery. The other is an offline algorithm that can sift loop detections based on their impact on loop optimization results and which is enabled by a dense map posterior metric for 3D reconstruction and mapping performance evaluation works without any costly ground-truth data.The methods presented in Towards Optimal Point Cloud Processing for 3D Reconstruction will be of assistance to researchers developing 3D modelling methods and to workers in the wide variety of fields that exploit such technology including metrology, geological animation and mass customization in smart manufacturing.
EAN 9783030961107
ISBN 3030961109
Typ produktu Ebook
Vydavatel Springer International Publishing
Datum vydání 3. června 2022
Jazyk English
Autoři Chen, YangQuan; Zhang, Guoxiang
Série SpringerBriefs in Electrical and Computer Engineering
Informace o výrobci
Kontaktní informace výrobce nejsou momentálně dostupné online, na nápravě intenzivně pracujeme. Pokud informaci potřebujete, napište nám na [email protected], rádi Vám ji poskytneme.