Algorithmic Versatility of SPF-regularization Methods
From MaRDI portal
Publication:6325134
DOI10.1142/S0219530520400060zbMATH Open1512.94007arXiv1909.05419MaRDI QIDQ6325134FDOQ6325134
Erin E. Tripp, Bruce W. Suter, Lixin Shen
Publication date: 11 September 2019
Abstract: Sparsity promoting functions (SPFs) are commonly used in optimization problems to find solutions which are assumed or desired to be sparse in some basis. For example, the l1-regularized variation model and the Rudin-Osher-Fatemi total variation (ROF-TV) model are some of the most well-known variational models for signal and image denoising, respectively. However, recent work demonstrates that convexity is not always desirable in sparsity promoting functions. In this paper, we replace convex SPFs with their induced nonconvex SPFs and develop algorithms for the resulting model by exploring the intrinsic structures of the nonconvex SPFs. We also present simulations illustrating the performance of the SPF and the developed algorithms in image denoising.
Numerical mathematical programming methods (65K05) Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
This page was built for publication: Algorithmic Versatility of SPF-regularization Methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6325134)
