메뉴 건너뛰기




Volumn , Issue , 2010, Pages

Large-scale matrix factorization with missing data under additional constraints

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER VISION; MATRIX FACTORIZATION; PHOTOMETRY; STEREO IMAGE PROCESSING;

EID: 85162048139     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (45)

References (28)
  • 3
    • 0033697408 scopus 로고    scopus 로고
    • Recovering non-rigid 3d shape from image streams
    • C. Bregler, A. Hertzmann, and H. Biermann. Recovering non-rigid 3d shape from image streams. In CVPR, 2000.
    • (2000) CVPR
    • Bregler, C.1    Hertzmann, A.2    Biermann, H.3
  • 4
    • 24644475872 scopus 로고    scopus 로고
    • Damped newton algorithms for matrix factorization with missing data
    • A. M. Buchanan and A.W. Fitzgibbon. Damped newton algorithms for matrix factorization with missing data. In CVPR, 2005.
    • (2005) CVPR
    • Buchanan, A.M.1    Fitzgibbon, A.W.2
  • 5
    • 30944459068 scopus 로고    scopus 로고
    • Computational enhancements in low-rank semidefinite programming
    • S. Burer and C. Choi. Computational enhancements in low-rank semidefinite programming. Optimization Methods and Software, 2006.
    • (2006) Optimization Methods and Software
    • Burer, S.1    Choi, C.2
  • 6
    • 84860614915 scopus 로고    scopus 로고
    • A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
    • S. Burer and R.D.C. Monteiro. A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization. Mathematical Programming (series B, 2001.
    • (2001) Mathematical Programming (Series B)
    • Burer, S.1    Monteiro, R.D.C.2
  • 7
    • 51149102667 scopus 로고    scopus 로고
    • Optimization algorithms on subspaces: Revisiting missing data problem in low-rank matrix
    • Pei C. Optimization algorithms on subspaces: Revisiting missing data problem in low-rank matrix. IJCV, 2008.
    • (2008) IJCV
    • Pei, C.1
  • 10
    • 33744922126 scopus 로고    scopus 로고
    • Affine approximation for direct batch recovery of euclidian structure and motion from sparse data
    • N. Guilbert, A.E. Bartoli, and A. Heyden. Affine approximation for direct batch recovery of euclidian structure and motion from sparse data. IJCV, 2006.
    • (2006) IJCV
    • Guilbert, N.1    Bartoli, A.E.2    Heyden, A.3
  • 11
    • 0028549672 scopus 로고
    • Photometric stereo under a light source with arbitrary motion
    • H. Hayakawa. Photometric stereo under a light source with arbitrary motion. JOSA, 1994.
    • (1994) JOSA
    • Hayakawa, H.1
  • 12
    • 0345414054 scopus 로고    scopus 로고
    • Outlier correction in image sequences for the affine camera
    • D. Q. Huynh, R. Hartley, and A. Heyden. Outlier correction in image sequences for the affine camera. In ICCV, 2003.
    • (2003) ICCV
    • Huynh, D.Q.1    Hartley, R.2    Heyden, A.3
  • 13
    • 0035308409 scopus 로고    scopus 로고
    • Linear fitting with missing data for structure-from-motion
    • D. W. Jacobs. Linear fitting with missing data for structure-from-motion. CVIU, 2001.
    • (2001) CVIU
    • Jacobs, D.W.1
  • 14
    • 33745179218 scopus 로고    scopus 로고
    • Robust l1 norm factorization in the presence of outliers and missing data by alternative convex programming
    • Q. Ke and T. Kanade. Robust l1 norm factorization in the presence of outliers and missing data by alternative convex programming. In CVPR, 2005.
    • (2005) CVPR
    • Ke, Q.1    Kanade, T.2
  • 15
    • 70449487160 scopus 로고    scopus 로고
    • A gradient descent algorithm on the grassman manifold for matrix completion
    • abs/0910.5260
    • R. H. Keshavan and S. Oh. A gradient descent algorithm on the grassman manifold for matrix completion. CoRR, abs/0910.5260, 2009.
    • (2009) CoRR
    • Keshavan, R.H.1    Oh, S.2
  • 16
    • 84860635046 scopus 로고    scopus 로고
    • Admira: Atomic decomposition for minimum rank approximation
    • abs/0905.0044
    • K. Lee and Y. Bresler. Admira: Atomic decomposition for minimum rank approximation. CoRR, abs/0905.0044, 2009.
    • (2009) CoRR
    • Lee, K.1    Bresler, Y.2
  • 17
    • 72549092023 scopus 로고    scopus 로고
    • Fixed point and bregman iterative methods for matrix rank minimization
    • S. Ma, D. Goldfarb, and L. Chen. Fixed point and bregman iterative methods for matrix rank minimization. Mathematical Programming, 2009.
    • (2009) Mathematical Programming
    • Ma, S.1    Goldfarb, D.2    Chen, L.3
  • 18
    • 24644508471 scopus 로고    scopus 로고
    • 3d reconstruction by fitting low-rank matrices with missing data
    • D. Martinec and T. Pajdla. 3d reconstruction by fitting low-rank matrices with missing data. In CVPR, 2005.
    • (2005) CVPR
    • Martinec, D.1    Pajdla, T.2
  • 20
    • 84860602643 scopus 로고    scopus 로고
    • Guaranteed rank minimization via singular value projection
    • abs/0909.5457
    • R. Meka, P. Jain, and I. S. Dhillon. Guaranteed rank minimization via singular value projection. CoRR, abs/0909.5457, 2009.
    • (2009) CoRR
    • Meka, R.1    Jain, P.2    Dhillon, I.S.3
  • 21
    • 33846228834 scopus 로고    scopus 로고
    • On the wiberg algorithm for matrix factorization in the presence of missing components
    • T. Okatani and K. Deguchi. On the wiberg algorithm for matrix factorization in the presence of missing components. IJCV, 2007.
    • (2007) IJCV
    • Okatani, T.1    Deguchi, K.2
  • 22
    • 31844451557 scopus 로고    scopus 로고
    • Fast maximum margin matrix factorization for collaborative prediction
    • J. D. M. Rennie and N. Srebro. Fast maximum margin matrix factorization for collaborative prediction. In ICML, 2005.
    • (2005) ICML
    • Rennie, J.D.M.1    Srebro, N.2
  • 23
    • 85162025474 scopus 로고
    • Principal component analysis with missing data and its application to polyhedral object modeling
    • H. Shum, K. Ikeuchi, and R. Reddy. Principal component analysis with missing data and its application to polyhedral object modeling. IEEE TPAMI, 1995.
    • (1995) IEEE TPAMI
    • Shum, H.1    Ikeuchi, K.2    Reddy, R.3
  • 25
    • 34948839439 scopus 로고    scopus 로고
    • Algorithms for batch matrix factorization with application to structure-from-motion
    • J. P. Tardif, A. Bartoli, M. Trudeau, N. Guilbert, and S. Roy. Algorithms for batch matrix factorization with application to structure-from-motion. In CVPR, 2007.
    • (2007) CVPR
    • Tardif, J.P.1    Bartoli, A.2    Trudeau, M.3    Guilbert, N.4    Roy, S.5
  • 26
    • 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. IJCV, 1992.
    • (1992) IJCV
    • Tomasi, C.1    Kanade, T.2
  • 28
    • 5044228773 scopus 로고    scopus 로고
    • Motion segmentation with missing data using powerfactorization and GPCA
    • R. Vidal and R. Hartley. Motion segmentation with missing data using powerfactorization and gpca. In In CVPR, 2004.
    • (2004) CVPR
    • Vidal, R.1    Hartley, R.2


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