2016Unpublished venueRequires access

Matric completion based on TV norm regularization and its application in image restoration

Hengyou Wang, Ruizhen Zhao, Yigang Cen, Qiang He

Open publisher page 3 citations

Abstract

Matrix completion is addressed to recover an unknown large low-rank matrix from a small subset of its entries. Several methods have been proposed for solving matrix completion problem. However, when the desired matrix becomes complicated and the rank is unknown, these traditional methods may not achieve promising performance. In this paper, a novel low-rank matrix completion algorithm based on nuclear norm is presented, which is a rank adaptive method. The proposed method integrates the nuclear norm and TV norm together. The nuclear norm is used to exploit the low-rank property, and the TV norm is adopted to explore the smooth structure. Experimental results show that our proposed method has a better performance than the state-of-the-art low-rank matrix completion methods.

About this research paper

What this paper is about

Matrix completion is addressed to recover an unknown large low-rank matrix from a small subset of its entries. Several methods have been proposed for solving matrix completion problem. However, when the desired matrix becomes complicated and the rank is unknown, these traditional methods may not achieve promising performance. In this paper, a novel low-rank matrix completion algorithm based on nuclear norm is presented, which is a rank adaptive method. The proposed method integrates the nuclear norm and TV norm together. The nuclear norm is used to exploit the low-rank property, and the TV norm is adopted to explore the smooth structure. Experimental results show that our proposed method has a better performance than the state-of-the-art low-rank matrix completion methods.

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Matrix completion is addressed to recover an unknown large low-rank matrix from a small subset of its entries. Several methods have been proposed for solving matrix completion problem. However, when the desired matrix becomes complicated and the rank is unknown, these traditional methods may not achieve promising performance. In this paper, a novel low-rank matrix completion algorithm based on nuclear norm is presented, which is a rank adaptive method. The proposed method integrates the nuclear norm and TV norm together. The nuclear norm is used to exploit the low-rank property, and the TV norm is adopted to explore the smooth structure. Experimental results show that our proposed method has a better performance than the state-of-the-art low-rank matrix completion methods.

Key concepts: Matrix completion, Matrix norm, Rank (graph theory), Norm (philosophy), Exploit, Low-rank approximation, Computer science, Matrix (chemical analysis)

Related papers

Back to paper searchBrowse research topicsOriginal source
Matric completion based on TV norm regularization and its application in image restoration — Research Paper | ScholarLens