activity
20122022
most citedSparse Regularization via Convex Analysis

430 citations · 1.6k across the 21 of their papers we have counts for

collaborators
Showing cs.CVShow all

6 papers · 1 filter

cs.CV2019★ 26 cited

Image Fusion via Sparse Regularization with Non-Convex Penalties

Nantheera Anantrasirichai, Rencheng Zheng, Ivan Selesnick +1

The L1 norm regularized least squares method is often used for finding sparse approximate solutions and is widely used in 1-D signal restoration. Basis pursuit denoising (BPD) perf…

cs.CV2015★ 107 cited

Enhanced Low-Rank Matrix Approximation

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…

cs.CV2015★ 60 cited

Convex Denoising using Non-Convex Tight Frame Regularization

Ankit Parekh, Ivan W. Selesnick

This paper considers the problem of signal denoising using a sparse tight-frame analysis prior. The L1 norm has been extensively used as a regularizer to promote sparsity; however,…

cs.CV2013★ 2 cited

Image Restoration using Total Variation with Overlapping Group Sparsity

Jun Liu, Ting-Zhu Huang, Ivan W. Selesnick +2

Image restoration is one of the most fundamental issues in imaging science. Total variation (TV) regularization is widely used in image restoration problems for its capability to p…

cs.CV2013★ 234 cited

Group-Sparse Signal Denoising: Non-Convex Regularization, Convex Optimization

Po-Yu Chen, Ivan W. Selesnick

Convex optimization with sparsity-promoting convex regularization is a standard approach for estimating sparse signals in noise. In order to promote sparsity more strongly than con…

cs.CV2013

Translation-Invariant Shrinkage/Thresholding of Group Sparse Signals

Po-Yu Chen, Ivan W. Selesnick

This paper addresses signal denoising when large-amplitude coefficients form clusters (groups). The L1-norm and other separable sparsity models do not capture the tendency of coeff…