Research map / Learning theory and algorithms / Combinatorial and search optimization
Consensus Maximization Tree Search Revisited
Zhipeng Cai, Tat-Jun Chin, Vladlen Koltun
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| add NAPA (non-adjacent path avoidance) to A* (ablation) | A* tree search · Linearized fundamental matrix, Frame-104-108 | runtime (s): >6400 -> 561.81 | Improved |
| add NAPA to A* (ablation) | A* tree search · Linearized fundamental matrix, Frame-198-201 | runtime (s): >6400 -> 351.07 | Improved |
| add NAPA to A* (ablation) | A* tree search · Homography, Boston | runtime (s): 2455.03 -> 1284.14 | Improved |
| add NAPA to A* (ablation) | A* tree search · Homography, Brussels | runtime (s): 437.25 -> 268.85 | Improved |
| add DIBP to A*-NAPA (ablation) | A*-NAPA · Linearized fundamental matrix, Frame-198-201 | runtime (s): 351.07 -> 3.88 | Improved |
| add DIBP to A*-NAPA (ablation) | A*-NAPA · Linearized fundamental matrix, Frame-738-742 | runtime (s): 471.15 -> 2.00 | Improved |
| add TOD to A*-NAPA (ablation) | A*-NAPA · Linearized fundamental matrix, Frame-104-108 | runtime (s): 561.81 -> 770.08 | Hurt |
| add TOD to A*-NAPA (ablation) | A*-NAPA · Linearized fundamental matrix, Frame-417-420 | runtime (s): 5993.68 -> 429.06 | Improved |
| use DIBP instead of TOD branch pruning (ablation) | A*-NAPA · Homography, Brussels | runtime (s): 297.91 -> 50.13 | Improved |
| use DIBP instead of TOD branch pruning (ablation) | A*-NAPA · Homography, City | runtime (s): 485.36 -> 64.44 | Improved |
| use DIBP instead of TOD branch pruning (ablation) | A*-NAPA · Homography, Adam | runtime (s): 156.98 -> 156.98 | No clear effect |
| add TOD to A* (ablation) | A* tree search · Homography, Brussels | runtime (s): 437.25 -> 499.77 | Hurt |
Closest papers by meaning
- Efficient Globally Optimal Consensus Maximisation with Tree Search (TPAMI 2016 · similarity 0.92)
- Deterministic Approximate Methods for Maximum Consensus Robust Fitting (TPAMI 2019 · similarity 0.90)
- Robust fitting in computer vision: easy or hard? (ECCV 2018 · similarity 0.89)
- Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound (AAAI 2025 · similarity 0.83)
- Near-Optimal Decision Trees in a SPLIT Second (ICML 2025 · similarity 0.83)
- Branches: Efficiently Seeking Optimal Sparse Decision Trees via AO* (ICML 2025 · similarity 0.83)
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.
