Research map / Learning theory and algorithms / Combinatorial and search optimization
Guaranteed Outlier Removal With Mixed Integer Linear Programs
Check your idea against 108,967 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.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Apply GORE before exact optimization | Maximum-consensus affine image matching · Wall | runtime (s): 1028.07 -> 226.45 | Helped |
| Apply GORE before exact optimization | Maximum-consensus affine image matching · Graffiti | runtime (s): 472.90 -> 100.41 | Helped |
| Apply GORE before exact optimization | Maximum-consensus affine image matching · Boat | runtime (s): 603.55 -> 262.58 | Helped |
| Apply GORE before exact optimization | Maximum-consensus affine image matching · Tissue | runtime (s): 284.07 -> 185.59 | Helped |
| Apply GORE before exact optimization | Maximum-consensus affine image matching · Dental | runtime (s): 258.34 -> 96.33 | Helped |
| Apply GORE before exact optimization | Maximum-consensus affine epipolar geometry estimation · Dinosaur (frames 7 and 8) | runtime (s): 3924.57 -> 1237.90 | Helped |
| Apply GORE before exact optimization | Maximum-consensus affine epipolar geometry estimation · Kapel | runtime (s): 5538.66 -> 1263.25 | Helped |
| Apply GORE before exact optimization | Maximum-consensus affine epipolar geometry estimation · Notre Dame | runtime (s): 515.08 -> 634.98 | Hurt |
| Apply GORE before exact optimization | Maximum-consensus affine epipolar geometry estimation · All Souls | runtime (s): 2795.35 -> 858.06 | Helped |
| Apply GORE before exact optimization | Maximum-consensus affine epipolar geometry estimation · Valbonne | runtime (s): 593.34 -> 470.91 | Helped |
| Apply GORE before exact optimization | Maximum-consensus triangulation · Point 1 | runtime (s): 17.80 -> 27.80 | Hurt |
| Apply GORE before exact optimization | Maximum-consensus triangulation · Point 2 | runtime (s): 112.83 -> 75.67 | Helped |
Closest papers by meaning
- Convex Relaxation for Robust Vanishing Point Estimation in Manhattan World (CVPR 2025 · similarity 0.87)
- Geometric Median (GM) Matching for Robust k-Subset Selection from Noisy Data (ICML 2025 · similarity 0.84)
- Coreset for Robust Geometric Median: Eliminating Size Dependency on Outliers (NeurIPS 2025 · similarity 0.84)
- PARSAC: Accelerating Robust Multi-Model Fitting with Parallel Sample Consensus (AAAI 2024 · similarity 0.84)
- Scalable 3D Registration via Truncated Entry-wise Absolute Residuals (CVPR 2024 · similarity 0.83)
- Revisiting Sampson Approximations for Geometric Estimation Problems (CVPR 2024 · 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.