Convex Denoising using Non-Convex Tight Frame Regularization
arXiv:1504.00976 · doi:10.1109/LSP.2015.2432095
Abstract
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, it tends to under-estimate non-zero values of the underlying signal. To more accurately estimate non-zero values, we propose the use of a non-convex regularizer, chosen so as to ensure convexity of the objective function. The convexity of the objective function is ensured by constraining the parameter of the non-convex penalty. We use ADMM to obtain a solution and show how to guarantee that ADMM converges to the global optimum of the objective function. We illustrate the proposed method for 1D and 2D signal denoising.
arXiv comment5 pages, 6 figures
References in corpus (2)
Cited by in corpus (6)
- Total Variation Denoising via the Moreau Envelope
- Enhanced Low-Rank Matrix Approximation
- Enhanced Sparsity by Non-Separable Regularization
- On Solving SAR Imaging Inverse Problems Using Non-Convex Regularization with a Cauchy-based Penalty
- Convergence Guarantees for Non-Convex Optimisation with Cauchy-Based Penalties
- Improved Sparse Low-Rank Matrix Estimation