Research map / Learning theory and algorithms / Combinatorial and search optimization
Efficient Globally Optimal Consensus Maximisation with Tree Search
Tat-Jun Chin, Pulak Purkait, Anders P. Eriksson, David Suter
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
- Consensus Maximization Tree Search Revisited (ICCV 2019 · similarity 0.92)
- An Exact Penalty Method for Locally Convergent Maximum Consensus (CVPR 2017 · similarity 0.91)
- Deterministic Consensus Maximization with Biconvex Programming (ECCV 2018 · similarity 0.91)
- Accelerating Globally Optimal Consensus Maximization in Geometric Vision (TPAMI 2024 · similarity 0.91)
- Deterministic Approximate Methods for Maximum Consensus Robust Fitting (TPAMI 2019 · similarity 0.91)
- Consensus Maximization With Linear Matrix Inequality Constraints (CVPR 2017 · similarity 0.90)
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.
