Research map / Learning theory and algorithms / Combinatorial and search optimization
Optimizing Elimination Templates by Greedy Parameter Search
Evgeniy Martyushev, Jana Vráblíková, Tomas Pajdla
Check 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 |
|---|---|---|---|
| Use the greedy parameter search to construct the template | Elimination-template generation · Rel. pose E+f 6pt | template size: 21 × 30 -> 11 × 20 | Improved |
| Use the greedy parameter search to construct the template | Elimination-template generation · Abs. pose refractive P5P | template size: 68 × 93 -> 57 × 73 | Improved |
| Use the greedy parameter search to construct the template | Elimination-template generation · Refractive P6P+focal | template size: 636 × 654 -> 126 × 162 | Improved |
| Use the greedy parameter search to construct the template | Elimination-template generation · Rel. pose fλ+E+fλ 7pt | template size: 581 × 659 -> 209 × 277 | Improved |
| Use a non-standard quotient-ring basis instead of a standard basis (ablation) | Greedy search template generator · Rel. pose λ+E+λ 6pt | template size: 73 × 125 -> 39 × 95 | Improved |
| Use a non-standard quotient-ring basis instead of a standard basis (ablation) | Greedy search template generator · Opt. pose w dir 3pt | template size: 397 × 445* -> 385 × 433* | Improved |
| Use a non-standard quotient-ring basis instead of a standard basis (ablation) | Greedy search template generator · Rel. pose E+f 6pt | template size: 11 × 20 -> 11 × 20 | No clear effect |
| Try both row-wise and column-wise greedy reduction and select the smaller result (ablation) | Parameterized elimination-template reduction · Minimal problems in geometric computer vision | template size | Improved |
| Use column-wise rather than row-wise greedy reduction (ablation) | Parameterized elimination-template reduction · Some minimal problems | template size | Mixed |
| Apply Schur-complement reduction using sparse fixed-coefficient constraints (ablation) | Elimination templates for problems marked with * · Minimal problems with sparse fixed-coefficient polynomials | template size | Improved |
| Compare the greedy parameter-adjustment strategy with syzygy-based reduction | Elimination-template generator · Several minimal problems | template size | Improved |
| Run the proposed solver instead of the publicly available SOTA solver | Relative pose solver with unknown common focal length and radial distortion · Rel. pose fλ+E+fλ 7pt | average runtime (ms): 2.9 ms -> 8.5 ms | Hurt |
Closest papers by meaning
- Using Sparse Elimination for Solving Minimal Problems in Computer Vision (ICCV 2017 · similarity 0.89)
- A Clever Elimination Strategy for Efficient Minimal Solvers (CVPR 2017 · similarity 0.88)
- Simulator HC: Regression-based Online Simulation of Starting Problem-Solution Pairs for Homotopy Continuation in Geometric Vision (CVPR 2025 · similarity 0.86)
- Efficient Solution of Point-Line Absolute Pose (CVPR 2024 · similarity 0.85)
- Camera Resection from Known Line Pencils and a Radially Distorted Scanline (CVPR 2025 · similarity 0.84)
- Three-view Focal Length Recovery From Homographies (CVPR 2025 · similarity 0.84)
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.
