Research map / Learning theory and algorithms / Clustering
Coresets for Triangulation
Qianggong Zhang, Tat-Jun Chin
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 |
|---|---|---|---|
| use coreset meta-algorithm instead of batch with bisection solver | bisection solver · Notre Dame triangulation | total runtime (s): 4148 -> 696 (83%) | Improved |
| use coreset instead of batch with Dinkelbach solver | Dinkelbach solver · Orebro Castle triangulation | total runtime (s): 1440 -> 351 (75%) | Improved |
| use coreset instead of batch on small problems (bisection) | bisection solver · Vercingetorix triangulation | total runtime (s): 57 -> 44 (23%) | Improved |
| use coreset with Dinkelbach for l1 reprojection error | Dinkelbach (p=1) · Notre Dame triangulation | total runtime (s): 1535 -> 116 (87%) | Improved |
| use coreset with polyhedron solver for linf reprojection error | Polyhedron (p=inf) · Notre Dame triangulation | total runtime (s): 865 -> 31.7 (96%) | Improved |
| use coreset with polyhedron solver on a small instance set | Polyhedron (p=inf) · Vercingetorix triangulation | total runtime (s): 1.82 -> 1.83 (-1%) | No clear effect |
| use coreset with Dinkelbach l1 on a small instance set | Dinkelbach (p=1) · Vercingetorix triangulation | total runtime (s): 1.61 -> 1.58 (13%) | Improved |
| use coreset with polyhedron solver on Stockholm | Polyhedron (p=inf) · Stockholm triangulation | total runtime (s): 12.2 -> 11.7 (4%) | Improved |
| use coreset-based fast solver in Sim-Hartley outlier removal (epsilon 0.4) | outlier removal · synthetic outlier triangulation | runtime / remaining inliers | Improved |
| increase number of views N from 100 to 5000 | coreset size · synthetic triangulation | coreset size: did not exceed 12 | No clear effect |
Closest papers by meaning
- Bound and Conquer: Improving Triangulation by Enforcing Consistency (TPAMI 2019 · similarity 0.87)
- Semidefinite Relaxations for Robust Multiview Triangulation (CVPR 2023 · similarity 0.85)
- Radial Distortion Triangulation (CVPR 2019 · similarity 0.85)
- Closed-Form Optimal Two-View Triangulation Based on Angular Errors (ICCV 2019 · similarity 0.84)
- Convex Relaxation for Robust Vanishing Point Estimation in Manhattan World (CVPR 2025 · similarity 0.84)
- Minimal Perspective Autocalibration (CVPR 2024 · similarity 0.82)
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.
