Coresets for Triangulation
Qianggong Zhang, Tat-Jun Chin

TL;DR
This paper introduces a coreset approximation scheme for $ll_{}$ triangulation in computer vision, enabling faster solutions for large datasets while maintaining theoretical accuracy guarantees.
Contribution
It develops a novel coreset-based algorithm for $ll_{}$ triangulation, providing efficient and provably accurate approximations for large-scale problems.
Findings
The coreset method achieves near-optimal solutions faster than existing algorithms.
The approach guarantees convergence to the true global minimum.
Experimental results demonstrate significant speedups on real datasets.
Abstract
Multiple-view triangulation by minimisation has become established in computer vision. State-of-the-art triangulation algorithms exploit the quasiconvexity of the cost function to derive iterative update rules that deliver the global minimum. Such algorithms, however, can be computationally costly for large problem instances that contain many image measurements, e.g., from web-based photo sharing sites or long-term video recordings. In this paper, we prove that triangulation admits a coreset approximation scheme, which seeks small representative subsets of the input data called coresets. A coreset possesses the special property that the error of the solution on the coreset is within known bounds from the global minimum. We establish the necessary mathematical underpinnings of the coreset algorithm, specifically, by enacting…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRobotics and Sensor-Based Localization · Advanced Image and Video Retrieval Techniques · Advanced Vision and Imaging
