메뉴 건너뛰기




Volumn , Issue , 2008, Pages

Fast algorithms for L∞ problems in multiview geometry

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER VISION; ELECTRIC NETWORK PARAMETERS; FEATURE EXTRACTION; IMAGE PROCESSING; MATLAB; OPTIMIZATION; PATTERN RECOGNITION; POLYNOMIAL APPROXIMATION;

EID: 52249122856     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2008.4587713     Document Type: Conference Paper
Times cited : (48)

References (27)
  • 1
    • 84887600085 scopus 로고    scopus 로고
    • Photo Tourism. http://phototour.cs.washington.edu.
    • Photo Tourism
  • 3
    • 0001204054 scopus 로고    scopus 로고
    • A new algorithm for generalized fractional programs
    • A. Barros, J. Frenk, S. Schaible, and S. Zhang. A new algorithm for generalized fractional programs. Math. Prog., 72(2):147-175, 1996.
    • (1996) Math. Prog , vol.72 , Issue.2 , pp. 147-175
    • Barros, A.1    Frenk, J.2    Schaible, S.3    Zhang, S.4
  • 7
    • 34249922645 scopus 로고
    • Algorithms for generalized fractional programming
    • J. Crouzeix and J. Ferland. Algorithms for generalized fractional programming. Math. Prog., 52(1):191-207, 1991.
    • (1991) Math. Prog , vol.52 , Issue.1 , pp. 191-207
    • Crouzeix, J.1    Ferland, J.2
  • 9
    • 0000181889 scopus 로고
    • On nonlinear fractional programming
    • W. Dinkelbach. On nonlinear fractional programming. Man. Sci., 13(7):492-498, 1967.
    • (1967) Man. Sci , vol.13 , Issue.7 , pp. 492-498
    • Dinkelbach, W.1
  • 11
    • 0028698570 scopus 로고
    • An interior-point method for fractional programs with convex constraints
    • R. Freund and F. Jarre. An interior-point method for fractional programs with convex constraints. Math. Prog., 67(1):407-440, 1994.
    • (1994) Math. Prog , vol.67 , Issue.1 , pp. 407-440
    • Freund, R.1    Jarre, F.2
  • 12
    • 0030264980 scopus 로고    scopus 로고
    • A fast algorithm for a class of generalized fractional programs
    • M. Gugat. A fast algorithm for a class of generalized fractional programs. Man. Sci., 42(10):1493-1499, 1996.
    • (1996) Man. Sci , vol.42 , Issue.10 , pp. 1493-1499
    • Gugat, M.1
  • 13
    • 5044232776 scopus 로고    scopus 로고
    • ∞ Minimization in geometric reconstruction problems
    • ∞ Minimization in geometric reconstruction problems. In CVPR, pages 504-509, 2004.
    • (2004) CVPR , pp. 504-509
    • Hartley, R.1    Schaffalitzky, F.2
  • 14
    • 0020802854 scopus 로고
    • Parametric approaches to fractional programs
    • T. Ibaraki. Parametric approaches to fractional programs. Math. Prog., 26(3):345-362, 1983.
    • (1983) Math. Prog , vol.26 , Issue.3 , pp. 345-362
    • Ibaraki, T.1
  • 15
    • 33745880710 scopus 로고    scopus 로고
    • ∞-norm
    • ∞-norm. In ICCV, pages 1002-1009, 2005.
    • (2005) ICCV , pp. 1002-1009
    • Kahl, F.1
  • 16
    • 33745911320 scopus 로고    scopus 로고
    • Quasiconvex optimization for robust geometric reconstruction
    • Q. Ke and T. Kanade. Quasiconvex optimization for robust geometric reconstruction. In ICCV, pages 986-993, 2005.
    • (2005) ICCV , pp. 986-993
    • Ke, Q.1    Kanade, T.2
  • 17
    • 34948860607 scopus 로고    scopus 로고
    • A practical algorithm for
    • ∞ triangulation with outliers
    • ∞ triangulation with outliers. In CVPR, 2007.
    • (2007) CVPR , vol.50
    • Li, H.1
  • 18
    • 34948830673 scopus 로고    scopus 로고
    • Robust rotation and translation estimation in multiview reconstruction
    • D. Martinec and T. Pajdla. Robust rotation and translation estimation in multiview reconstruction. In CVPR, 2007.
    • (2007) CVPR
    • Martinec, D.1    Pajdla, T.2
  • 19
    • 52249118860 scopus 로고    scopus 로고
    • MOSEK ApS, Denmark. The MOSEK optimization tools manual Version 5.0 (Revision 60).
    • MOSEK ApS, Denmark. The MOSEK optimization tools manual Version 5.0 (Revision 60).
  • 20
    • 27644538408 scopus 로고
    • An interior-point method for generalized linear-fractional programming
    • Y. Nesterov and A. Nemirovskii. An interior-point method for generalized linear-fractional programming. Math. Prog., 69(1):177-204, 1995.
    • (1995) Math. Prog , vol.69 , Issue.1 , pp. 177-204
    • Nesterov, Y.1    Nemirovskii, A.2
  • 21
    • 50649114435 scopus 로고    scopus 로고
    • Efficient optimization for
    • ∞ problems using pseudoconvexity
    • ∞ problems using pseudoconvexity. In ICCV, 2007.
    • (2007) ICCV , vol.50
    • Olsson, C.1    Eriksson, A.2    Kahl, F.3
  • 23
    • 50649097168 scopus 로고    scopus 로고
    • A fast method to minimize
    • ∞ error norm for geometric vision problems
    • ∞ error norm for geometric vision problems. In ICCV, 2007.
    • (2007) ICCV , vol.50
    • Seo, Y.1    Hartley, R.2
  • 24
    • 33845421939 scopus 로고    scopus 로고
    • ∞ minimization
    • ∞ minimization. In CVPR, pages 1230-1237, 2006.
    • (2006) CVPR , pp. 1230-1237
    • Sim, K.1    Hartley, R.2
  • 26
    • 77954006739 scopus 로고    scopus 로고
    • Photo Tourism: Exploring photo collections in 3D
    • N. Snavely, S. Seitz, and R. Szeliski. Photo Tourism: Exploring photo collections in 3D. TOG, 25(3):835-846, 2006.
    • (2006) TOG , vol.25 , Issue.3 , pp. 835-846
    • Snavely, N.1    Seitz, S.2    Szeliski, R.3
  • 27
    • 0033296299 scopus 로고    scopus 로고
    • Using SeDuMi 1.02, a Matlab toolbox for optimization over symmetric cones
    • J. Sturm. Using SeDuMi 1.02, a Matlab toolbox for optimization over symmetric cones. Opt. Meth. and Soft., 11-12:625-653, 1999.
    • (1999) Opt. Meth. and Soft , vol.11-12 , pp. 625-653
    • Sturm, J.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.