paper-with-me

홈 › Papers

A Comparative Study for the Nuclear Norms Minimization Methods

2016-08-16 · Zhiyuan Zha, Bihan Wen, Jiachao Zhang, Jiantao Zhou, Ce Zhu

The nuclear norm minimization (NNM) is commonly used to approximate the matrix rank by shrinking all singular values equally. However, the singular values have clear physical meanings in many practical problems, and NNM may not be able to faithfully approximate the matrix rank. To alleviate the above-mentioned limitation of NNM, recent studies have suggested that the weighted nuclear norm minimization (WNNM) can achieve a better rank estimation than NNM, which heuristically set the weight being inverse to the singular values. However, it still lacks a rigorous explanation why WNNM is more effective than NMM in various applications. In this paper, we analyze NNM and WNNM from the perspective of group sparse representation (GSR). Concretely, an adaptive dictionary learning method is devised to connect the rank minimization and GSR models. Based on the proposed dictionary, we prove that NNM and WNNM are equivalent to L1-norm minimization and the weighted L1-norm minimization in GSR, respectively. Inspired by enhancing sparsity of the weighted L1-norm minimization in comparison with L1-norm minimization in sparse representation, we thus explain that WNNM is more effective than NMM. By integrating the image nonlocal self-similarity (NSS) prior with the WNNM model, we then apply it to solve the image denoising problem. Experimental results demonstrate that WNNM is more effective than NNM and outperforms several state-of-the-art methods in both objective and perceptual quality.

📄 PDF Abstract BibTeX arXiv:1608.04517

Code (0)

등록된 구현이 없습니다.

Tasks

DeblurringDenoisingDictionary LearningImage DenoisingImage Inpainting

Similar Papers 제목 키워드 기반

Incoherent Tensor Norms and Their Applications in Higher Order Tensor Completion

2016-06-10 · Ming Yuan, Cun-Hui Zhang

In this paper, we investigate the sample size requirement for a general class of nuclear norm minimization methods for higher order tensor completion. We introduce a class of tensor norms by allowing for different levels…

Scalable Algorithms for Tractable Schatten Quasi-Norm Minimization

2016-06-04 · Fanhua Shang, Yuanyuan Liu, James Cheng

The Schatten-p quasi-norm $(0<p<1)$ is usually used to replace the standard nuclear norm in order to approximate the rank function more accurately. However, existing Schatten-p quasi-norm minimization algorithms involve …

Matrix Completion

Scaled Nuclear Norm Minimization for Low-Rank Tensor Completion

2017-07-25 · Morteza Ashraphijuo, Xiaodong Wang

Minimizing the nuclear norm of a matrix has been shown to be very efficient in reconstructing a low-rank sampled matrix. Furthermore, minimizing the sum of nuclear norms of matricizations of a tensor has been shown to be…

Regularized linear system identification using atomic, nuclear and kernel-based norms: the role of the stability constraint

2015-07-02 · Gianluigi Pillonetto, Tianshi Chen, Alessandro Chiuso, Giuseppe De Nicolao 외

Inspired by ideas taken from the machine learning literature, new regularization techniques have been recently introduced in linear system identification. In particular, all the adopted estimators solve a regularized lea…

Unified Scalable Equivalent Formulations for Schatten Quasi-Norms

2016-06-02 · Fanhua Shang, Yuanyuan Liu, James Cheng

The Schatten quasi-norm can be used to bridge the gap between the nuclear norm and rank function, and is the tighter approximation to matrix rank. However, most existing Schatten quasi-norm minimization (SQNM) algorithms…