Research map / Point clouds / Registration and matching
An Efficient Globally Optimal Algorithm for Asymmetric Point Matching
Wei Lian, Lei Zhang, Ming–Hsuan Yang
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
- Probabilistic Model for Robust Affine and Non-Rigid Point Set Matching (TPAMI 2016 · similarity 0.89)
- Non-Rigid Point Set Registration with Robust Transformation Estimation under Manifold Regularization (AAAI 2017 · similarity 0.88)
- Fast and Robust Non-Rigid Registration Using Accelerated Majorization-Minimization (TPAMI 2023 · similarity 0.88)
- Scalable 3D Registration via Truncated Entry-wise Absolute Residuals (CVPR 2024 · similarity 0.87)
- A robust inlier identification algorithm for point cloud registration via $\mathbf{\ell_0}$-minimization (NeurIPS 2024 · similarity 0.86)
- Progressive Correspondence Regenerator for Robust 3D Registration (CVPR 2025 · similarity 0.86)
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.
