Metraipolis › archive › dc_85ac216047ec
FlashReg: GPU-Accelerated 3-Clique Point Cloud Registration for Real-Time Correspondence-to-Pose Estimation — arXiv:2608.21804
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.21804
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T07:50:17.311Z
- SHA-256 of the archived text
c347922fa5484580d2f64e19344ef152d61221e9948088b9952566af9cc9329e- Stable URL of this page
https://metraipolis.com/documento/dc_85ac216047ec
How to cite
FlashReg: GPU-Accelerated 3-Clique Point Cloud Registration for Real-Time Correspondence-to-Pose Estimation — arXiv:2608.21804 — arXiv (en), https://arxiv.org/abs/2608.21804 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_85ac216047ec (Metraipolis archive dc_85ac216047ec, sha256 c347922fa5484580d2f64e19344ef152d61221e9948088b9952566af9cc9329e)
BibTeX
@misc{dc85ac216047ec,
title = {FlashReg: GPU-Accelerated 3-Clique Point Cloud Registration for Real-Time Correspondence-to-Pose Estimation — arXiv:2608.21804},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.21804},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_85ac216047ec; sha256 c347922fa5484580d2f64e19344ef152d61221e9948088b9952566af9cc9329e},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.21804. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Graph-based point cloud registration achieves high robustness by identifying geometrically consistent correspondence sets, but constructing second-order compatibility graphs and enumerating candidate cliques remain compute- and memory-intensive. This work presents FlashReg, a GPU-oriented correspondence-to-pose estimator that avoids materializing the dense scored second-order graph. Its Fast First- and Second-Order Graph (FFSOG) construction builds a capacity-bounded sparse second-order graph directly from the binary first-order graph. A dataflow-optimized three-node clique (3-clique) search then selects pivots from compact per-row candidate pools and enumerates triples through sorted sparse-neighborhood intersections. Across indoor and outdoor benchmarks, FlashReg reduces correspondence-to-pose latency by 2--3x relative to TurboReg at comparable registration recall, while using about 50% of its peak allocated tensor memory on an embedded GPU. These results make FlashReg suitable as a high-throughput registration backend within onboard perception pipelines. Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-08-25 in cs.DC). Categorie arXiv: Computer Vision and Pattern Recognition (cs.CV) ; Distributed, Parallel, and Cluster Computing (cs.DC). Pagina del lavoro: https://arxiv.org/abs/2608.21804 — 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-18T07:47:32.962Z dalla pagina https://arxiv.org/catchup/cs.DC/2026-08-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).