Matrix completion by Truncated Nuclear Norm Regularization

Debing Zhang, Yao Hu, Jieping Ye, Xuelong Li, Xiaofei He

Research output: Chapter in Book/Report/Conference proceedingConference contribution

63 Citations (Scopus)

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.

Original languageEnglish (US)
Title of host publicationProceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
Pages2192-2199
Number of pages8
DOIs
StatePublished - 2012
Event2012 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2012 - Providence, RI, United States
Duration: Jun 16 2012Jun 21 2012

Other

Other2012 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2012
CountryUnited States
CityProvidence, RI
Period6/16/126/21/12

Fingerprint

Computer vision

ASJC Scopus subject areas

  • Software
  • Computer Vision and Pattern Recognition

Cite this

Zhang, D., Hu, Y., Ye, J., Li, X., & He, X. (2012). Matrix completion by Truncated Nuclear Norm Regularization. In Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition (pp. 2192-2199). [6247927] https://doi.org/10.1109/CVPR.2012.6247927

Matrix completion by Truncated Nuclear Norm Regularization. / Zhang, Debing; Hu, Yao; Ye, Jieping; Li, Xuelong; He, Xiaofei.

Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition. 2012. p. 2192-2199 6247927.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Zhang, D, Hu, Y, Ye, J, Li, X & He, X 2012, Matrix completion by Truncated Nuclear Norm Regularization. in Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition., 6247927, pp. 2192-2199, 2012 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2012, Providence, RI, United States, 6/16/12. https://doi.org/10.1109/CVPR.2012.6247927
Zhang D, Hu Y, Ye J, Li X, He X. Matrix completion by Truncated Nuclear Norm Regularization. In Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition. 2012. p. 2192-2199. 6247927 https://doi.org/10.1109/CVPR.2012.6247927
Zhang, Debing ; Hu, Yao ; Ye, Jieping ; Li, Xuelong ; He, Xiaofei. / Matrix completion by Truncated Nuclear Norm Regularization. Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition. 2012. pp. 2192-2199
@inproceedings{6b7a7ae73d054ee3ad4423cdcd968beb,
title = "Matrix completion by Truncated Nuclear Norm Regularization",
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.",
author = "Debing Zhang and Yao Hu and Jieping Ye and Xuelong Li and Xiaofei He",
year = "2012",
doi = "10.1109/CVPR.2012.6247927",
language = "English (US)",
isbn = "9781467312264",
pages = "2192--2199",
booktitle = "Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition",

}

TY - GEN

T1 - Matrix completion by Truncated Nuclear Norm Regularization

AU - Zhang, Debing

AU - Hu, Yao

AU - Ye, Jieping

AU - Li, Xuelong

AU - He, Xiaofei

PY - 2012

Y1 - 2012

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84866667614&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84866667614&partnerID=8YFLogxK

U2 - 10.1109/CVPR.2012.6247927

DO - 10.1109/CVPR.2012.6247927

M3 - Conference contribution

SN - 9781467312264

SP - 2192

EP - 2199

BT - Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition

ER -