Matrix completion by truncated nuclear norm regularization

Zhang, D. and Hu, Y. and Ye, J. and Li, Xuelong and He, X. (2012) Matrix completion by truncated nuclear norm regularization. In: UNSPECIFIED (ed.) 2012 IEEE Conference on Computer Vision and Pattern Recognition. Washington, USA: IEEE Computer Society, pp. 2192-2199. ISBN 9781467312264.

Full text not available from this repository.

Official URL: http://dx.doi.org/10.1109/CVPR.2012.6247927

Abstract

Estimating missing values in visual data is a challenging problem in computer vision, which can be considered as a low rank matrix approximation problem. Most of the recent studies use the nuclear norm as a convex relaxation of the rank operator. However, by minimizing the nuclear norm, all the singular values are simultaneously minimized, and thus the rank can not be well approximated in practice. In this paper, we propose a novel matrix completion algorithm based on the Truncated Nuclear Norm Regularization (TNNR) by only minimizing the smallest N-r singular values, where N is the number of singular values and r is the rank of the matrix. In this way, the rank of the matrix can be better approximated than the nuclear norm. We further develop an efficient iterative procedure to solve the optimization problem by using the alternating direction method of multipliers and the accelerated proximal gradient line search method. Experimental results in a wide range of applications demonstrate the effectiveness of our proposed approach.

Metadata

Item Type:	Book Section
School:	Birkbeck Schools and Departments > School of Business, Economics & Informatics > Computer Science and Information Systems
Depositing User:	Sarah Hall
Date Deposited:	06 Jun 2013 12:55
Last Modified:	11 Oct 2016 15:27
URI:	http://eprints.bbk.ac.uk/id/eprint/7312

Statistics

Archive Staff Only (login required)

Edit/View Item