Efficient reduction of L-infinity geometry problems

2009 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2009

Volumn , Issue , 2009, Pages 2695-2702

  Li, Hongdong ^a  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

CONVEX OPTIMIZATION; NEWTON-RAPHSON METHOD;

DIRECT APPROACH; EXPERIMENTAL VALIDATIONS; FINITE SET; GEOMETRY PROBLEMS; L-INFINITY; PSEUDOCONVEX; SUB-PROBLEMS; VISION GEOMETRIES;

COMPUTER VISION;

EID: 70450181218     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPRW.2009.5206653     Document Type: Conference Paper

References (19)

1. P. Agarwal, S. Har-Peled, and K. Varadarajan. Geometric approximations via coresets. Combinatorial and Computational Geometry -MSRI Publications, pages 1-30, 2005.
2. S. Agarwal, N. Snavely, and S. Seitz. Fast algorithms for linfty problems in multiview geometry. In Proc. CVPR, June 2008.
3. J. E. Goodman and J. O'Rourke, editors. Handbook of discrete and computational geometry. CRC Press, Inc., 1997.
4. ∞ minimization in geometric reconstruction problems. In Proc. CVPR, 1:504-509, 2004.
5. ∞-norm. In Proc.ICCV, 2005.
6. Q. Ke and T. Kanade. Quasiconvex optimization for robust geometric reconstruction. In Proc.ICCV, pages 986-993, 2005.
7. H. Li. A practical algorithm for l1 triangulation with outliers. In Proc. CVPR, June 2007.
8. O. Mangasarian. Nonlinear programming. SIAM, 1994.
9. D.Martinec and T. Pajdla. Robust rotation and translation estimation in multiview reconstruction. In Proc. CVPR, 2007.
10. J. Matousek, M. Sharir, and E.Welzl. A subexponential bound for linear programming. Algorithmica, 16:498, 1996.
11. C. Olsson, O. Enqvist, and F. Kahl. A polynomial-time bound for matching and registration with outliers. In Proc. CVPR, 2008.
12. C. Olsson, A. Eriksson, and F. Kahl. Efficient optimization for l1 problems using pseudoconvexity. In Proc. ICCV, 2007.
13. J. Platt. Sequential minimal optimization: A fast algorithm for training support vector machines. Advances in Kernel Methods: Support Vector Machines, 1998.
14. M. Salzmann, R. Hartley, and P. Fua. Convex optimization for deformable surface 3-d tracking. In Proc. ICCV, Oct. 2007.
15. Y. Seo and R. Hartley. A fast method to minimize l-infty error norm for geometric vision problems. In Proc. ICCV, Oct. 2007.
16. M. Sharir and E. Welzl. A combinatorial bound for linear programming and related problems. In Proc. STACS: Theoretical Aspects of Computer Science, pages 569-579, 1992.
17. ∞ minimization. In Proc. CVPR, 1:1230-1237, 2006.
18. ∞ norm. In Proc. CVPR, 1:485-494, 2006.
19. N. Snavely, S. M. Seitz, and R. Szeliski. Photo tourism: exploring photo collections in 3d. SIGGRAPH, pages 835-846, 2006.