Tensor Completion for Estimating Missing Values in Visual Data

Proceedings of the IEEE International Conference on Computer Vision

Volumn , Issue , 2009, Pages 2114-2121

  Liu, Ji ^a   Musialski, Przemyslaw ^b   Wonka, Peter ^a   Ye, Jieping ^a  

^a ARIZONA STATE UNIVERSITY   (United States)

^b VRVIS RESEARCH CENTER   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER VISION; CONVEX OPTIMIZATION; HEURISTIC METHODS; MATRIX ALGEBRA;

ACQUISITION PROCESS; CONVEX OPTIMIZATION PROBLEMS; MATRIX CASE; MATRIX COMPLETION; MATRIX TRACE; MISSING VALUES; TENSOR COMPLETION; THEORETICAL FOUNDATIONS; TRACE-NORMS; VISUAL DATA;

TENSORS;

EID: 85100063855     PISSN: 15505499     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCV.2009.5459463     Document Type: Conference Paper

References (22)

1. Y. Amit, M. Fink, N. Srebro, and S. Ullman. Uncovering shared structures in multiclass classification. ICML, pages 17–24, 2007.
2. A. Argyriou, T. Evgeniou, and M. Pontil. Multi-task feature learning. NIPS, 73:243–272, 2007.
3. F. R. Bach. Consistency of trace norm minimization. Journal of Machine Learning Research, pages 1019–1048, 2008.
4. M. Bertalmio, G. Sapiro, V. Caselles, and C. Ballester. Image inpainting. SIGGRAPH, pages 414–424, 2000.
5. J.-F. Cai, E. J. Candes, and Z. Shen. A singular value thresholding algorithm for matrix completion. Submitted to Optimization and Control, 2008.
6. E. J. Candes and B. Recht. Exact matrix completion via convex optimization. 2008.
7. L. Elden. Matrix Methods in Data Mining and Pattern Recgonition. 2007.
8. M. Fazel. Matrix rank minimization with applications. PhD thesis, Stanford University.
9. M. Fazel, H. Hindi, and S. Boyd. A rank minimization heuristic with application to minimum order system approximation. Proceedings of the American Control Conference, pages 4734–4739, 2001.
10. R. A. Harshman. Foundations of the parafac procedure: models and conditions for an”explanatory” multi-modal factor analysis. UCLA Working Papers in Phonetics, 16:1–84, 1970.
11. N. Komodakis and G. Tziritas. Image completion using global optimization. CVPR, pages 417–424, 2006.
12. T. Korah and C. Rasmussen. Spatiotemporal inpainting for recovering texture maps of occluded building facades. IEEE Transactions on Image Processing, 16:2262–2271, 2007.
13. M. Kurucz, A. A. Benczur, and K. Csalogany. Methods for large scale svd with missing values. KDD.
14. S. Ma, D. Goldfarb, and L. Chen. Fixed point and bregman iterative methods for matrix rank minimization. To appear Mathematical Programming.
15. Y. Nesterov. Introductory lectures on convex programming. Lecture Notes, pages 119–120, 1998.
16. B. Recht, M. Fazel, and P. A. Parrilo. Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM.
17. N. Srebro, J. D. M. Rennie, and T. S. Jaakkola. Maximum-margin matrix factorization. In NIPS, pages 1329–1336. MIT Press, 2005.
18. J. F. Sturm. Using sedumi 1.02, a matlab toolbox for optimization over symmetric cones, 1998.
19. K. C. Toh, M. J. Todd, and R. H. Tutuncu. Sdpt3: a matlab software package for semidefinite programming. Optimization Methods and Software, 11:545–581, 1999.
20. M. Tomasi and T. Kanade. Shape and motion from image stream under orthography: a factorization method. International Journal of Computer Vision, 9:137–154, 1992.
21. O. Troyanskaya, M. Cantor, G. Sherlock, P. Brown, T. Hastie, R. Tibshirani, D. Botstein, and R. B. Altman. Missing value estimation methods for dna microarrays. Bioinformatics, 17:520–525, 2001.
22. P. Tseng. Convergence of block coordinate descent method for nondifferentiable minimization. Journal of Optimization Theory Application, 109:475–494, 2001.