Metraipolis › archive › dc_577efa353f31

Accelerating Large-scale Bundle Adjustment for LiDAR Mapping via Parallel Computing — arXiv:2608.14266

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.14266
License (as archived)
CC0-1.0
Archived
2026-10-19T04:04:37.546Z
SHA-256 of the archived text
7160638d496689de6988564df2976caaa1ab3cfde74361dcbc69d545203a3932
Stable URL of this page
https://metraipolis.com/documento/dc_577efa353f31

How to cite

Accelerating Large-scale Bundle Adjustment for LiDAR Mapping via Parallel Computing — arXiv:2608.14266 — arXiv (en), https://arxiv.org/abs/2608.14266 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_577efa353f31 (Metraipolis archive dc_577efa353f31, sha256 7160638d496689de6988564df2976caaa1ab3cfde74361dcbc69d545203a3932)
BibTeX
@misc{dc577efa353f31,
  title = {Accelerating Large-scale Bundle Adjustment for LiDAR Mapping via Parallel Computing — arXiv:2608.14266},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.14266},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_577efa353f31; sha256 7160638d496689de6988564df2976caaa1ab3cfde74361dcbc69d545203a3932},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.14266. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

LiDAR bundle adjustment is widely utilized in mapping to construct globally consistent point cloud maps. In this paper, we propose the first fully parallel computing framework to accelerate LiDAR bundle adjustment for large-scale mapping, incorporating three key techniques. First, we design an adaptive, asynchronous data loading strategy to efficiently process large-scale point cloud datasets on memory-constrained GPUs. Secondly, we present a novel bottom-up voxelization method for extracting planar features, enabling fully parallelized pre-processing. Thirdly, we build upon a majorization-minimization formulation to accelerate compute-intensive tasks in the optimization via parallel computation, including the computation of residuals, Jacobian and Hessian matrices, and a parallel increment solver. To support our design, we provide both theoretical and experimental analysis of the time complexity of our approach. Extensive benchmarking on large-scale public datasets across various computational platforms validates the robustness and adaptability of our approach, achieving up to a tenfold improvement in computational efficiency while preserving mapping accuracy comparable to state-of-the-art methods. To benefit future research, the implementation code is available on GitHub.

Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-08-17 in cs.CV).
Categorie arXiv: Robotics (cs.RO) ; Computer Vision and Pattern Recognition (cs.CV).
Pagina del lavoro: https://arxiv.org/abs/2608.14266 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-19T03:57:58.047Z dalla pagina https://arxiv.org/catchup/cs.CV/2026-08-17?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).