Research map / Point clouds / Registration and matching
Fast and Accurate 3D Registration from Line Intersection Constraints
André Mateus, Siddhant Ranade, Srikumar Ramalingam, Pedro Miraldo
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Minimal Solvers for 3D Scan Alignment With Pairs of Intersecting Lines (CVPR 2020 · similarity 0.87)
- Global Registration of 3D Point Sets via LRS Decomposition (ECCV 2016 · similarity 0.84)
- Efficient and Robust Registration on the 3D Special Euclidean Group (ICCV 2019 · similarity 0.83)
- Scalable 3D Registration via Truncated Entry-wise Absolute Residuals (CVPR 2024 · similarity 0.83)
- Novel Coplanar Line-Points Invariants for Robust Line Matching Across Views (ECCV 2016 · similarity 0.83)
- Multi-scale Consistency for Robust 3D Registration via Hierarchical Sinkhorn Tree (NeurIPS 2024 · similarity 0.81)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
