Conferences: Matrix completion of noisy graph signals via proximal gradient minimization
Giménez Febrer and A. Pagès Zamora


This paper takes on the problem of recovering the missing entries of an incomplete matrix, which is known as matrix completion, when the columns of the matrix are signals that lie on a graph and the available observations are noisy. We solve a version of the problem regularized with the Laplacian quadratic form by means of the proximal gradient method, and derive theoretical bounds on the recovery error. Moreover, in order to speed up the convergence of the proximal gradient, we propose an initialization method that utilizes the structural information contained in the Laplacian matrix of the graph. 

Full document

©UPC Universitat Politècnica de Catalunya
Signal Processing and Communications group
Powered by Joomla!.