Robust and Accurate Cylinder Triangulation
Not on the map. Why?
Abstract (arXiv)
In this paper we present methods for triangulation of infinite cylinders from image line silhouettes. We show numerically that linear estimation of a general quadric surface is inherently a badly posed problem. Instead we propose to constrain the conic section to a circle, and give algebraic constraints on the dual conic, that models this manifold. Using these constraints we derive a fast minimal solver based on three image silhouette lines, that can be used to bootstrap robust estimation schemes such as RANSAC. We also present a constrained least squares solver that can incorporate all available image lines for accurate estimation. The algorithms are tested on both synthetic and real data, where they are shown to give accurate results, compared to previous methods.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 4 of its 32 references that are in the map. First posted on arXiv 5 Dec 2022.
Builds on
4 of 32 references.
References · 4
- 2015ORB-SLAM: a Versatile and Accurate Monocular SLAM Systemcited by 988
- 2021Line Segment Detection Using Transformers without Edgescited by 73
- 2021SOLD2: Self-supervised Occlusion-aware Line Description and Detectioncited by 47
- 2021Fully Convolutional Line Parsingcited by 24
Built on by
Not cited yet.