The generalized trace-norm and its application to structure-from-motion problems

Proceedings of the IEEE International Conference on Computer Vision

Volumn , Issue , 2011, Pages 2502-2509

  Angst, Roland ^a   Zach, Christopher ^a   Pollefeys, Marc ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ADDITIONAL STRUCTURES; EFFICIENT ALGORITHM; LOW RANK; MATRIX; OPTIMIZATION PROBLEMS; POTENTIAL APPLICATIONS; PRIOR KNOWLEDGE; PROBLEM STRUCTURE; RANK CONSTRAINTS; REGULARIZED OPTIMIZATION PROBLEMS; SPECIFIC PROBLEMS; STRUCTURE FROM MOTION PROBLEMS; TRACE-NORMS; WIDE AREA;

ALGORITHMS; IMAGE PROCESSING;

OPTIMIZATION;

EID: 84856626597     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCV.2011.6126536     Document Type: Conference Paper

References (18)

1. H. Aanaes, R. Fisker, K. Åström, and J. Carstensen. Robust factorization. IEEE Trans. PAM1, pages 1215-1225, 2002.
2. R. Angst, C. Zach, and M. Pollefeys. Supplemental material. www.inf.ethz.ch/personal/rangst/publications, 2011.
3. F. Bach, J. Mairal, and J. Ponce. Convex sparse matrix factorizations. Technical report, HAL-00345747, 2008.
4. F. R. Bach. Consistency of trace norm minimization. J. Mach. Learn. Res., 9:1019-1048, June 2008.
5. E. J. Candes. The power of convex relaxation. In 21st Annual ACM-SIAM, SODA'10, pages 1321-1321, 2010.
6. A. Chambolle and T. Pock. A First-Order Primal-Dual Algorithm for Convex Problems with Applications to Imaging. Journal of Math. Imaging and Vision, pages 1-26, 2010.
7. Y. Dai, H. Li, and M. He. Element-wise factorization for n-view projective reconstruction. In Proc. of ECCV, pages 396-409, 2010.
8. A. Eriksson and A. van den Hengel. Efficient computation of robust low-rank matrix approximations in the presence of missing data using the l1 norm. In IEEE Conf. on CVPR, pages 771-778, June 2010.
9. D. Gross. Recovering low-rank matrices from few coefficients in any basis. arXiv, Oct 2009.
10. R. A. Horn and C. R. Johnson. Topics in matrix analysis. Cambridge University Press, Cambridge, 1991.
11. Z. Lin, M. Chen, L. Wu, and Y. Ma. The Augmented Lagrange Multiplier Method for Exact Recovery of Corrupted Low-Rank Matrices. ArXiv e-prints, Sept. 2010.
12. R. Mazumder, T. Hastie, and R. Tibshirani. Spectral regularization algorithms for learning large incomplete matrices. J. Mach. Learn. Res., 11:2287-2322, August 2010.
13. S. Negahban, P. Ravikumar, M. J. Wainwright, and B. Yu. A unified framework for high-dimensional analysis of mestimators with decomposable regularizers. CoRR, 2010.
14. J. Oliensis and R. Hartley. Iterative extensions of the sturm/triggs algorithm: Convergence and nonconvergence. IEEE Trans. PAM1, 29:2217-2233, Dec. 2007.
15. B. Recht, M. Fazel, and P. A. Parrilo. Guaranteed Minimum-Rank solutions of linear matrix equations via nuclear norm minimization. ArXiv e-prints, June 2007.
16. R. Salakhutdinov and A. Mnih. Bayesian probabilistic matrix factorization using markov chain monte carlo. In ICML, pages 880-887, New York, NY, USA, 2008. ACM.
17. R. Salakhutdinov and N. Srebro. Collaborative filtering in a non-uniform world: Learning with the weighted trace norm. CoRR, abs/1002.2780, 2010.
18. A. Zaharescu and R. P. Horaud. Robust factorization methods using a gaussian/uniform mixture model. IJCV, 81(3):240-258, March 2009.