Cited By
View all- Hartley RKahl F(2007)Optimal algorithms in multiview geometryProceedings of the 8th Asian conference on Computer vision - Volume Part I10.5555/1775614.1775617(13-34)Online publication date: 18-Nov-2007
Triangulation of points, lines and conics
Abstract
The problem of reconstructing 3D scene features from multiple views with known camera motion and given image correspondences is considered. This is a classical and one of the most basic geometric problems in computer vision and photogrammetry. Yet, previous methods fail to guarantee optimal reconstructions - they are either plagued by local minima or rely on a non-optimal cost-function. A common framework for the triangulation problem of points, lines and conics is presented. We define what is meant by an optimal triangulation based on statistical principles and then derive an algorithm for computing the globally optimal solution. The method for achieving the global minimum is based on convex and concave relaxations for both fractionals and monomials. The performance of the method is evaluated on real image data.
References
[1]
Hartley, R.I., Zisserman, A.: Multiple View Geometry in Computer Vision, 2nd edn. Cambridge University Press, Cambridge (2004).
[2]
Slama, C.C.: Manual of Photogrammetry. American Society of Photogrammetry, Falls Church, VA (1980).
[3]
Hartley, R., Sturm, P.: Triangulation. Computer Vision and Image Understanding 68(2), 146-157 (1997).
[4]
Kanatani, K.: Statistical Optimization for Geometric Computation: Theory and Practice. In: Elsevier Science, Elsevier, North-Holland, Amsterdam (1996).
[5]
Stewénius, H., Schaffalitzky, F., Nistér, D.: How hard is three-view triangulation really? In: Int. Conf. Computer Vision, Beijing, China (2005).
[6]
Kahl, F., Henrion, D.: Globally optimal estimates for geometric reconstruction problems. In: Int. Conf. Computer Vision, Beijing, China (2005).
[7]
Agarwal, S., Chandraker, M., Kahl, F., Kriegman, D., Belongie, S.: Practical global optimization for multiview geometry. In: Leonardis, A., Bischof, H., Pinz, A. (eds.) ECCV 2006. LNCS, vol. 3951, Springer, Heidelberg (2006).
[8]
Harris, C., Stephens, M.: A combined corner and edge detector. In: Alvey Vision Conference. pp. 147-151 (1988).
[9]
Triggs, B.: Detecting keypoints with stable position, orientation, and scale under illumination changes. In: Pajdla, T., Matas, J(G.) (eds.) ECCV 2004. LNCS, vol. 3024, Springer, Heidelberg (2004).
[10]
Freund, R.W., Jarre, F.: Solving the sum-of-ratios problem by an interior-point method. Journal of Global Optimization 19, 83-102 (2001).
[11]
Tawarmalani, M., Sahinidis, N.V.: Semidefinite relaxations of fractional programs via novel convexification techniques. Journal of Global Optimization 20, 133-154 (2001).
[12]
Sturm, J.: Using SeDuMi 1.02, a Matlab toolbox for optimization over symmetric cones. Optimization Methods and Software 11(12), 625-653 (1999).
[13]
Ryoo, H.S., Sahinidis, N.V.: Analysis of bounds for multilinear functions. Journal of Global Optimization 19(4), 403-424 (2001).
[14]
Benson, H.P.: Using concave envelopes to globally solve the nonlinear sum of ratios problem. Journal of Global Optimization 22, 343-364 (2002).
[15]
Schaible, S., Shi, J.: Fractional programming: the sum-of-ratios case. Optimization Methods and Software 18, 219-229 (2003).
- Triangulation of points, lines and conics
Recommendations
Triangulation of Points, Lines and Conics
The problem of reconstructing 3D scene features from multiple views with known camera motion and given image correspondences is considered. This is a classical and one of the most basic geometric problems in computer vision and photogrammetry. Yet, ...
Fitting conics to paracatadioptric projections of lines
The paracatadioptric camera is one of the most popular panoramic systems currently available in the market. It provides a wide field of view by combining a parabolic shaped mirror with a camera inducing an orthographic projection. Previous work proved ...
Triangulation for points on lines
ECCV'06: Proceedings of the 9th European conference on Computer Vision - Volume Part IIITriangulation consists in finding a 3D point reprojecting the best as possible onto corresponding image points. It is classical to minimize the reprojection error, which, in the pinhole camera model case, is nonlinear in the 3D point coordinates. We ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 10 June 2007
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 2Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 08 Dec 2024
Other Metrics
Citations
Cited By
View all- Hartley RKahl F(2007)Optimal algorithms in multiview geometryProceedings of the 8th Asian conference on Computer vision - Volume Part I10.5555/1775614.1775617(13-34)Online publication date: 18-Nov-2007
View Options
View options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in