Skip to main navigation Skip to search Skip to main content

An algorithm of schatten p-norm regularized least squares problems for video restoration

  • Beihang University
  • University of Science and Technology of China

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Minimizing the nuclear norm is recently considered as the convex relaxation of the rank minimization problem and arises in many applications as Netflix challenge. A closest nonconvex relaxation-Schatten p(0 < p <1) norm minimization has been proposed to replace the NP hard rank minimization. In this paper, an algorithm based on Majorization Minimization has be proposed to solve Schatten p(0 < p <1) norm minimization. The numerical experiments show that Schatten p norm with 0 < p <1 recovers low rank matrix from fewer measurements than nuclear norm minimization. The numerical results also indicate that our algorithm give a more accurate reconstruction.

Original languageEnglish
Title of host publicationAdvanced Measurement and Test III
Pages2308-2313
Number of pages6
DOIs
StatePublished - 2013
Event2013 3rd International Conference on Advanced Measurement and Test, AMT 2013 - Xiamen, China
Duration: 13 Mar 201314 Mar 2013

Publication series

NameAdvanced Materials Research
Volume718-720
ISSN (Print)1022-6680

Conference

Conference2013 3rd International Conference on Advanced Measurement and Test, AMT 2013
Country/TerritoryChina
CityXiamen
Period13/03/1314/03/13

Keywords

  • Isometry constant
  • Majorization minimization
  • Random matrix
  • Rank minimization
  • Schatten p-norm
  • Singular value decomposition

Fingerprint

Dive into the research topics of 'An algorithm of schatten p-norm regularized least squares problems for video restoration'. Together they form a unique fingerprint.

Cite this