paper-with-me

Papers

Enhanced Low-Rank Matrix Approximation

2015-11-06 · Ankit Parekh, Ivan W. Selesnick

This letter proposes to estimate low-rank matrices by formulating a convex optimization problem with non-convex regularization. We employ parameterized non-convex penalty functions to estimate the non-zero singular values more accurately than the nuclear norm. A closed-form solution for the global optimum of the proposed objective function (sum of data fidelity and the non-convex regularizer) is also derived. The solution reduces to singular value thresholding method as a special case. The proposed method is demonstrated for image denoising.

📄 PDF Abstract BibTeX arXiv:1511.01966

Code (0)

등록된 구현이 없습니다.

Tasks

DenoisingImage Denoising

Similar Papers 제목 키워드 기반

Efficient Algorithms for Regularized Nonnegative Scale-invariant Low-rank Approximation Models

2024-03-27 · Jeremy E. Cohen, Valentin Leplat

Regularized nonnegative low-rank approximations, such as sparse Nonnegative Matrix Factorization or sparse Nonnegative Tucker Decomposition, form an important branch of dimensionality reduction models known for their enh…

Dimensionality Reduction

Algorithms for $\ell_p$ Low-Rank Approximation

2017-08-01 · ICML 2017 8 · Flavio Chierichetti, Sreenivas Gollapudi, Ravi Kumar, Silvio Lattanzi 외

We consider the problem of approximating a given matrix by a low-rank matrix so as to minimize the entrywise $\ell_p$-approximation error, for any $p \geq 1$; the case $p = 2$ is the classical SVD problem. We obtain…

Approximation Algorithms for $\ell_0$-Low Rank Approximation

2017-10-30 · Karl Bringmann, Pavel Kolev, David P. Woodruff

We study the $\ell_0$-Low Rank Approximation Problem, where the goal is, given an $m \times n$ matrix $A$, to output a rank-$k$ matrix $A'$ for which $\|A'-A\|_0$ is minimized. Here, for a matrix $B$, $\|B\|_0$ denotes t…

On Low-Rank Hankel Matrix Denoising

2020-12-14 · Mingzhou Yin, Roy S. Smith

The low-complexity assumption in linear systems can often be expressed as rank deficiency in data matrices with generalized Hankel structure. This makes it possible to denoise the data by estimating the underlying struct…

Denoising

Approximation Algorithms for \ell_0-Low Rank Approximation

2017-12-01 · NeurIPS 2017 12 · Karl Bringmann, Pavel Kolev, David Woodruff

We study the $\ell_0$-Low Rank Approximation Problem, where the goal is, given an $m \times n$ matrix $A$, to output a rank-$k$ matrix $A'$ for which $\|A'-A\|_0$ is minimized. Here, for a matrix $B$, $\|B\|_0$ d…