메뉴 건너뛰기




Volumn 49, Issue 4, 2011, Pages 1417-1435

Hessian matrix vs. Gauss-Newton Hessian matrix

Author keywords

Gauss Newton Hessian matrix; Hessian matrix; Least squares problem

Indexed keywords

AFFINE SUBSPACES; APPROXIMATION FUNCTION; ASYMPTOTIC CONVERGENCE RATE; CRITICAL PROPERTIES; GAUSS-NEWTON; GAUSS-NEWTON ALGORITHM; HESSIAN MATRICES; INITIAL POINT; LEAST SQUARES PROBLEMS; LEVENBERG-MARQUARDT; MINIMAL VALUE; NEWTON ALGORITHM; NEWTON-TYPE METHODS; NONLINEAR LEAST SQUARES PROBLEMS; OBJECTIVE FUNCTIONS; QUADRATIC APPROXIMATION;

EID: 80052760869     PISSN: 00361429     EISSN: None     Source Type: Journal    
DOI: 10.1137/100799988     Document Type: Article
Times cited : (42)

References (37)
  • 1
    • 1542285823 scopus 로고    scopus 로고
    • Lucas-Kanade 20 years on: A unifying framework
    • S. BAKER AND I. MATTHEWS, Lucas-Kanade 20 years on: A unifying framework, Int. J. Comput. Vision, 56(2004), pp. 221-255.
    • (2004) Int. J. Comput. Vision , vol.56 , pp. 221-255
    • Baker, S.1    Matthews, I.2
  • 4
    • 0007727459 scopus 로고    scopus 로고
    • Eigen-tracking: Robust matching and tracking of articulated objects using a view-based representation
    • M. BLACK AND A. JEPSON, Eigen-tracking: Robust matching and tracking of articulated objects using a view-based representation, Int. J. Comput. Vision, 36(1998), pp. 101-130.
    • (1998) Int. J. Comput. Vision , vol.36 , pp. 101-130
    • Black, M.1    Jepson, A.2
  • 7
    • 77951291046 scopus 로고    scopus 로고
    • A singular value thresholding algorithm for matrix completion
    • J.-F. CAI, E. J. CANDES, AND Z. SHEN, A singular value thresholding algorithm for matrix completion, SIAM J. Optim., 20(2008), pp. 1956-1982.
    • (2008) SIAM J. Optim. , vol.20 , pp. 1956-1982
    • Cai, J.-F.1    Candes, E.J.2    Shen, Z.3
  • 8
    • 77951528523 scopus 로고    scopus 로고
    • The power of convex relaxation: Near-optimal matrix completion
    • E. J. CANDES AND T. TAO, The power of convex relaxation: Near-optimal matrix completion, IEEE Trans. Inform. Theory, 56(2010), pp. 2053-2080.
    • (2010) IEEE Trans. Inform. Theory , vol.56 , pp. 2053-2080
    • Candes, E.J.1    Tao, T.2
  • 9
    • 77952741387 scopus 로고    scopus 로고
    • Matrix completion with noise
    • E. J. CANDES AND Y. PLAN, Matrix completion with noise, Proc. IEEE, 98(2010), pp. 925-936.
    • (2010) Proc. IEEE , vol.98 , pp. 925-936
    • Candes, E.J.1    Plan, Y.2
  • 10
    • 51149102667 scopus 로고    scopus 로고
    • Optimization algorithms on subspaces: Revisiting missing data problem in low-rank matrix
    • P. CHEN, Optimization algorithms on subspaces: Revisiting missing data problem in low-rank matrix, Int. J. Comput. Vision, 80(2008), pp. 125-142.
    • (2008) Int. J. Comput. Vision , vol.80 , pp. 125-142
    • Chen, P.1
  • 11
    • 78449234359 scopus 로고    scopus 로고
    • Why not use the LM method for fundamental matrix estimation?
    • P. CHEN, Why not use the LM method for fundamental matrix estimation?, IET Computer Vision, 4(2010), pp. 286-294.
    • (2010) IET Computer Vision , vol.4 , pp. 286-294
    • Chen, P.1
  • 12
    • 3242717928 scopus 로고    scopus 로고
    • Recovering the missing components in a large noisy low-rank matrix: Application to sfm
    • P. CHEN AND D. SUTER, Recovering the missing components in a large noisy low-rank matrix: Application to sfm, IEEE Trans. Pattern Anal. Mach. Intell., 26(2004), pp. 1051-1063.
    • (2004) IEEE Trans. Pattern Anal. Mach. Intell. , vol.26 , pp. 1051-1063
    • Chen, P.1    Suter, D.2
  • 14
    • 0004041275 scopus 로고    scopus 로고
    • Numerical methods for unconstrained optimization and nonlinear equations, 1983
    • SIAM, Philadelphia
    • J. E. DENNIS AND R. B. SCHNABEL, Numerical Methods for Unconstrained Optimization and Nonlinear Equations, 1983. Reprinted as Classics in Applied Mathematics 16, SIAM, Philadelphia, 1996.
    • (1996) Reprinted as Classics in Applied Mathematics , vol.16
    • Dennis, J.E.1    Schnabel, R.B.2
  • 16
    • 0004236492 scopus 로고    scopus 로고
    • 3rd ed., Johns Hopkins University Press, Baltimore, MD
    • G. H. GOLUB AND C. F. V. LOAN, Matrix Computations, 3rd ed., Johns Hopkins University Press, Baltimore, MD, 1996.
    • (1996) Matrix Computations
    • Golub, G.H.1    Loan, C.F.V.2
  • 17
    • 0000183429 scopus 로고    scopus 로고
    • On optimization techniques for solving nonlinear inverse problems
    • DOI 10.1088/0266-5611/16/5/309, PII S0266561100134720, Electromagnetic Imaging and Inversion of the Earths Subsurface (Invited Papers)
    • E. HABER, U. M. ASCHER, AND D. OLDENBURG, On optimization techniques for solving nonlinear inverse problems, Inverse Problems, 16(2000), pp. 1263-1280. (Pubitemid 33661705)
    • (2000) Inverse Problems , vol.16 , Issue.5 , pp. 1263-1280
    • Haber, E.1    Ascher, U.M.2    Oldenburg, D.3
  • 21
    • 0035266651 scopus 로고    scopus 로고
    • Optimal reduced-rank estimation and filtering
    • DOI 10.1109/78.905856, PII S1053587X01014106
    • Y. HUA, M. NIKPOUR, AND P. STOICA, Optimal reduced-rank estimation and filtering, IEEE Trans. Signal Process., 49(2001), pp. 457-469. (Pubitemid 32583149)
    • (2001) IEEE Transactions on Signal Processing , vol.49 , Issue.3 , pp. 457-469
    • Hua, Y.1    Nikpour, M.2    Stoica, P.3
  • 22
    • 0028400154 scopus 로고
    • Statistical bias of conic fitting and renormalization
    • K. KANATANI, Statistical bias of conic fitting and renormalization, IEEE Trans. Pattern Anal. Mach. Intell., 16(1994), pp. 320-326.
    • (1994) IEEE Trans. Pattern Anal. Mach. Intell. , vol.16 , pp. 320-326
    • Kanatani, K.1
  • 24
    • 0001596784 scopus 로고
    • A computer algorithm for reconstructing a scene from two projections
    • H. C. LONGUET-HIGGINS, A computer algorithm for reconstructing a scene from two projections, Nature, 293(1981), pp. 133-135.
    • (1981) Nature , vol.293 , pp. 133-135
    • Longuet-Higgins, H.C.1
  • 25
    • 0031186856 scopus 로고    scopus 로고
    • Weighted low-rank approximation of general complex matrices and its application in the design of 2-d digital filter
    • W. S. LU, S. C. PEI, AND P. H. WANG, Weighted low-rank approximation of general complex matrices and its application in the design of 2-d digital filter, IEEE Trans. Circuits Syst. I Regul. Pap., 44(1997), pp. 650-655.
    • (1997) IEEE Trans. Circuits Syst. I Regul. Pap. , vol.44 , pp. 650-655
    • Lu, W.S.1    Pei, S.C.2    Wang, P.H.3
  • 27
    • 3042791915 scopus 로고    scopus 로고
    • Active appearance models revisited
    • I. MATTHEWS AND S. BAKER, Active appearance models revisited, Int. J. Comput. Vision, 60(2004), pp. 135-164.
    • (2004) Int. J. Comput. Vision , vol.60 , pp. 135-164
    • Matthews, I.1    Baker, S.2
  • 28
    • 0012588576 scopus 로고
    • Optimization software guide
    • SIAM, Philadelphia
    • J. J. MORÉ AND S. J. WRIGHT, Optimization software guide, Frontiers Appl. Math. 14, SIAM, Philadelphia, 1993.
    • (1993) Frontiers Appl. Math , vol.14
    • Moré, J.J.1    Wright, S.J.2
  • 29
    • 0003982971 scopus 로고    scopus 로고
    • Springer Series in Operations Research, 2nd ed., Springer, New York
    • J. NOCEDAL AND S. J. WRIGHT, Numerical Optimization, Springer Series in Operations Research, 2nd ed., Springer, New York, 2006.
    • (2006) Numerical Optimization
    • Nocedal, J.1    Wright, S.J.2
  • 30
    • 0031095356 scopus 로고    scopus 로고
    • A paraperspective factorization method for shape and motion recovery
    • C. POELMAN AND T. KANADE, A paraperspective factorization method for shape and motion recovery, IEEE Trans. Pattern Anal. Mach. Intell., 19(1997), pp. 206-219.
    • (1997) IEEE Trans. Pattern Anal. Mach. Intell. , vol.19 , pp. 206-219
    • Poelman, C.1    Kanade, T.2
  • 32
    • 0019999307 scopus 로고
    • Fitting conic sections to "very scattered" data: An iterative refinement of the Bookstein algorithm
    • P. D. SAMPSON, Fitting conic sections to "very scattered" data: An iterative refinement of the Bookstein algorithm, Comput. Graphics Image Process., 18(1982), pp. 97-108.
    • (1982) Comput. Graphics Image Process. , vol.18 , pp. 97-108
    • Sampson, P.D.1
  • 33
    • 0029373923 scopus 로고
    • Principal component analysis with missing data and its applications to polyhedral object modeling
    • H. SHUM, K. IKEUCHI, AND R. REDDY, Principal component analysis with missing data and its applications to polyhedral object modeling, IEEE Trans. Pattern Anal. Mach. Intell., 17(1995), pp. 854-867.
    • (1995) IEEE Trans. Pattern Anal. Mach. Intell. , vol.17 , pp. 854-867
    • Shum, H.1    Ikeuchi, K.2    Reddy, R.3
  • 34
    • 0007727810 scopus 로고    scopus 로고
    • Construction of panoramic image mosaics with global and local alignment
    • H. SHUM AND R. SZELISKI, Construction of panoramic image mosaics with global and local alignment, Int. J. Comput. Vision, 16(2000), pp. 63-84.
    • (2000) Int. J. Comput. Vision , vol.16 , pp. 63-84
    • Shum, H.1    Szeliski, R.2
  • 35
    • 0026943737 scopus 로고
    • Shape and motion from image streams under orthography: A factorization method
    • C. TOMASI AND T. KANADE, Shape and motion from image streams under orthography: A factorization method, Int. J. Comput. Vision, 9(1992), pp. 137-154. (Pubitemid 23621943)
    • (1992) International Journal of Computer Vision , vol.9 , Issue.2 , pp. 137-154
    • Tomasi Carlo1    Kanade Takeo2


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