메뉴 건너뛰기




Volumn , Issue , 2011, Pages 2953-2960

A branch and contract algorithm for globally optimal fundamental matrix estimation

Author keywords

[No Author keywords available]

Indexed keywords

GLOBAL OPTIMIZATION; PATTERN RECOGNITION;

EID: 80052892327     PISSN: 10636919     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2011.5995352     Document Type: Conference Paper
Times cited : (22)

References (25)
  • 1
    • 0037428975 scopus 로고    scopus 로고
    • Overall view regarding fundamental matrix estimation
    • 2953
    • X. Armangue and J. Salvi. Overall view regarding fundamental matrix estimation. Image and Vision Computing, 21:205-220, 2003. 2953
    • (2003) Image and Vision Computing , vol.21 , pp. 205-220
    • Armangue, X.1    Salvi, J.2
  • 2
    • 1342324577 scopus 로고    scopus 로고
    • Nonlinear estimation of fundamental matrix with minimal parameters
    • 2953
    • A. Bartoli and P. Sturm. Nonlinear estimation of fundamental matrix with minimal parameters. IEEE TPAMI, 26(3):426-432, 2004. 2953
    • (2004) IEEE TPAMI , vol.26 , Issue.3 , pp. 426-432
    • Bartoli, A.1    Sturm, P.2
  • 3
    • 79960327284 scopus 로고    scopus 로고
    • Globally optimal algorithms for stratified autocalibration
    • 2954, 2956, 2957
    • M. Chandraker, S. Agarwal, D. Kriegman, and S. Belongie. Globally optimal algorithms for stratified autocalibration. IJCV, 90(2):236-254, 2010. 2954, 2956, 2957
    • (2010) IJCV , vol.90 , Issue.2 , pp. 236-254
    • Chandraker, M.1    Agarwal, S.2    Kriegman, D.3    Belongie, S.4
  • 4
    • 51949088639 scopus 로고    scopus 로고
    • Globally optimal bilinear programming for computer vision applications
    • 2954, 2956, 2957
    • M. Chandraker and D. Kriegman. Globally optimal bilinear programming for computer vision applications. In proc. CVPR, 2008. 2954, 2956, 2957
    • (2008) Proc. CVPR
    • Chandraker, M.1    Kriegman, D.2
  • 5
    • 0036522406 scopus 로고    scopus 로고
    • Estimating the fundamental matrix via constrained least-squares: A convex approach
    • 2954
    • G. Chesi, A. Garulli, A. Vicino, and R. Cipolla. Estimating the fundamental matrix via constrained least-squares: a convex approach. IEEE TPAMI, 24(3):397-401, 2002. 2954
    • (2002) IEEE TPAMI , vol.24 , Issue.3 , pp. 397-401
    • Chesi, G.1    Garulli, A.2    Vicino, A.3    Cipolla, R.4
  • 6
    • 0742268830 scopus 로고    scopus 로고
    • From fns to heiv: A link between two vision parameter estimation methods
    • 2953
    • W. Chojnacki, M. Brooks, A. Hengel, and D. Gawley. From fns to heiv: a link between two vision parameter estimation methods. IEEE TPAMI, 26(2):264-268, 2004. 2953
    • (2004) IEEE TPAMI , vol.26 , Issue.2 , pp. 264-268
    • Chojnacki, W.1    Brooks, M.2    Hengel, A.3    Gawley, D.4
  • 7
    • 0036433588 scopus 로고    scopus 로고
    • Snopt: An SQP algorithm for large-scale constrained optimization
    • 2957
    • P. Gill, W. Murray, and M. Saunders. Snopt: An sqp algorithm for large-scale constrained optimization. SIAM Journal on Optimization, 12:979-1006, 2002. 2957
    • (2002) SIAM Journal on Optimization , vol.12 , pp. 979-1006
    • Gill, P.1    Murray, W.2    Saunders, M.3
  • 8
    • 50949120592 scopus 로고    scopus 로고
    • Global optimization through searching rotation space and optimal estimation of the essential matrix
    • 2954
    • R. Hartley and F. Kahl. Global optimization through searching rotation space and optimal estimation of the essential matrix. In proc. ICCV, 2007. 2954
    • (2007) Proc. ICCV
    • Hartley, R.1    Kahl, F.2
  • 10
    • 0031167379 scopus 로고    scopus 로고
    • In defense of the eight-point algorithm
    • 2953, 2957
    • R. I. Hartley. In defense of the eight-point algorithm. IEEE TPAMI, 19(6):580-593, 1997. 2953, 2957
    • (1997) IEEE TPAMI , vol.19 , Issue.6 , pp. 580-593
    • Hartley, R.I.1
  • 11
    • 34247638173 scopus 로고    scopus 로고
    • Globally optimal estimates for geometric reconstruction problems
    • 2954
    • F. Kahl and D. Henrion. Globally optimal estimates for geometric reconstruction problems. IJCV, 74(1):3-15, 2007. 2954
    • (2007) IJCV , vol.74 , Issue.1 , pp. 3-15
    • Kahl, F.1    Henrion, D.2
  • 13
    • 84898479415 scopus 로고    scopus 로고
    • High accuracy computation of rank-constrained fundamental matrix
    • 2953, 2954, 2957
    • K. Kanatani and Y. Sugaya. High accuracy computation of rank-constrained fundamental matrix. In proc. BMVC, 2007. 2953, 2954, 2957
    • (2007) Proc. BMVC
    • Kanatani, K.1    Sugaya, Y.2
  • 14
    • 77952590115 scopus 로고    scopus 로고
    • Unified computation of strict maximum likelihood for geometric fitting
    • 2953, 2954, 2960
    • K. Kanatani and Y. Sugaya. Unified computation of strict maximum likelihood for geometric fitting. Journal of Mathematical Imaging and Vision, 38(1):1-13, 2010. 2953, 2954, 2960
    • (2010) Journal of Mathematical Imaging and Vision , vol.38 , Issue.1 , pp. 1-13
    • Kanatani, K.1    Sugaya, Y.2
  • 15
    • 77953224229 scopus 로고    scopus 로고
    • Globally optimal affine epipolar geometry from apparent contours
    • 2954
    • G. Li and Y. Tsin. Globally optimal affine epipolar geometry from apparent contours. In proc. ICCV, 2009. 2954
    • (2009) Proc. ICCV
    • Li, G.1    Tsin, Y.2
  • 16
    • 0029734338 scopus 로고    scopus 로고
    • The fundamental matrix: Theory, algorithms, and stability analysis
    • 2953
    • Q.-T. Luong and O. Faugeras. The fundamental matrix: theory, algorithms, and stability analysis. IJCV, 17(1):43-75, 1996. 2953
    • (1996) IJCV , vol.17 , Issue.1 , pp. 43-75
    • Luong, Q.-T.1    Faugeras, O.2
  • 17
    • 4544226754 scopus 로고    scopus 로고
    • Trilinear monomials with positive or negative domains: Facets of the convex and concave envelopes
    • 2956
    • C. Meyer and C. Floudas. Trilinear monomials with positive or negative domains: facets of the convex and concave envelopes. Frontiers in Global Optimization, pages 327-352, 2003. 2956
    • (2003) Frontiers in Global Optimization , pp. 327-352
    • Meyer, C.1    Floudas, C.2
  • 18
    • 4544251356 scopus 로고    scopus 로고
    • Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
    • 2956
    • C. Meyer and C. Floudas. Trilinear monomials with mixed sign domains: facets of the convex and concave envelopes. Journal of Global Optimization, 29:125-155, 2004. 2956
    • (2004) Journal of Global Optimization , vol.29 , pp. 125-155
    • Meyer, C.1    Floudas, C.2
  • 19
    • 34948832692 scopus 로고    scopus 로고
    • Evaluation of epipole estimation methods with/without rank-2 constraint across algebraic/geometric error functions
    • 2953
    • T. Migita and T. Shakunaga. Evaluation of epipole estimation methods with/without rank-2 constraint across algebraic/geometric error functions. In Proc. CVPR, 2007. 2953
    • (2007) Proc. CVPR
    • Migita, T.1    Shakunaga, T.2
  • 20
    • 64849097743 scopus 로고    scopus 로고
    • Branch-and-bound methods for euclidean registration problems
    • 2954, 2956, 2957
    • C. Olsson, F. Kahl, and M. Oskarsson. Branch-and-bound methods for euclidean registration problems. IEEE TPAMI, 31(5):783-794, 2009. 2954, 2956, 2957
    • (2009) IEEE TPAMI , vol.31 , Issue.5 , pp. 783-794
    • Olsson, C.1    Kahl, F.2    Oskarsson, M.3
  • 21
    • 0033296299 scopus 로고    scopus 로고
    • Using sedumi 1.02, a matlab toolbox for optimization over symmetric cones
    • 2957
    • J. Sturm. Using sedumi 1.02, a matlab toolbox for optimization over symmetric cones. Optimization Methods and Software, 11-12:625-653, 1999. 2957
    • (1999) Optimization Methods and Software , vol.11-12 , pp. 625-653
    • Sturm, J.1
  • 22
    • 0031233843 scopus 로고    scopus 로고
    • The development and comparison of robust methods for estimating the fundamental matrix
    • 2954
    • P. Torr and D. Murry. The development and comparison of robust methods for estimating the fundamental matrix. IJCV, 24(3):271-300, 1997. 2954
    • (1997) IJCV , vol.24 , Issue.3 , pp. 271-300
    • Torr, P.1    Murry, D.2
  • 23
    • 0001197630 scopus 로고    scopus 로고
    • A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
    • 2956
    • J. Zamora and I. Grossmann. A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms. Journal of Global Optimization, 14(3):217-249, 1999. 2956
    • (1999) Journal of Global Optimization , vol.14 , Issue.3 , pp. 217-249
    • Zamora, J.1    Grossmann, I.2
  • 24
    • 0032024706 scopus 로고    scopus 로고
    • Determining the epipolar geometry and its uncertainty: A review
    • 2953
    • Z. Zhang. Determining the epipolar geometry and its uncertainty: a review. IJCV, 27(2):161-195, 1998. 2953
    • (1998) IJCV , vol.27 , Issue.2 , pp. 161-195
    • Zhang, Z.1
  • 25
    • 0032122922 scopus 로고    scopus 로고
    • On the optimization criteria used in two-view motion analysis
    • 2953, 2954, 2958
    • Z. Zhang. On the optimization criteria used in two-view motion analysis. IEEE TPAMI, 20(7):717-729, 1998. 2953, 2954, 2958
    • (1998) IEEE TPAMI , vol.20 , Issue.7 , pp. 717-729
    • Zhang, Z.1


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