Non-convex total variation regularization for convex denoising of signals
From MaRDI portal
Publication:2203361
DOI10.1007/s10851-019-00937-5zbMath1485.94026OpenAlexW2998830245MaRDI QIDQ2203361
Fiorella Sgallari, Serena Morigi, Alessandro Lanza, Ivan W. Selesnick
Publication date: 6 October 2020
Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11585/766091
signal denoisingtotal variation regularizationforward-backward splitting algorithmconvex non-convex regularization
Filtering in stochastic control theory (93E11) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Related Items (6)
A nonconvex nonsmooth image prior based on the hyperbolic tangent function ⋮ Deep-plug-and-play proximal Gauss-Newton method with applications to nonlinear, ill-posed inverse problems ⋮ A convex-Nonconvex strategy for grouped variable selection ⋮ On Proximal Algorithms with Inertial Effects Beyond Monotonicity ⋮ Diffusion optical tomography reconstruction based on convex–nonconvex graph total variation regularization ⋮ Hybrid non-convex regularizers model for removing multiplicative noise
Uses Software
Cites Work
- Unnamed Item
- Nearly unbiased variable selection under minimax concave penalty
- Nonlinear total variation based noise removal algorithms
- Wavelet inpainting with the \(\ell_{0}\) sparse regularization
- Infimal convolution regularisation functionals of BV and \(\mathrm{L}^p\) spaces. I: The finite \(p\) case
- Convex image denoising via non-convex regularization with parameter selection
- Infimal convolution regularizations with discrete \(\ell_1\)-type functionals
- Nonconvex nonsmooth optimization via convex-nonconvex majorization-minimization
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Image recovery via total variation minimization and related problems
- Convex non-convex segmentation of scalar fields over arbitrary triangulated surfaces
- Extensions of smoothing via taut strings
- Structured sparsity promoting functions
- Convex non-convex image segmentation
- Constrained TV\(_p\)-\(\ell_2\) model for image restoration
- A Majorize-Minimize Subspace Approach for $\ell_2-\ell_0$ Image Regularization
- Generalized methods and solvers for noise removal from piecewise constant signals. I. Background theory
- Proximal Splitting Methods in Signal Processing
- A Continuous Exact $\ell_0$ Penalty (CEL0) for Least Squares Regularized Problem
- The Discrete Cosine Transform
- The digital TV filter and nonlinear denoising
- Sparse Signal Estimation by Maximally Sparse Convex Optimization
- Jump-Sparse and Sparse Recovery Using Potts Functionals
- On the Convergence of the Iterative Shrinkage/Thresholding Algorithm With a Weakly Convex Penalty
- A Class of Nonconvex Penalties Preserving Overall Convexity in Optimization-Based Mean Filtering
- Sparse Regularization via Convex Analysis
- Bayesian Selection for the $\ell _2$ -Potts Model Regularization Parameter: 1-D Piecewise Constant Signal Denoising
- Correction for “On the Convergence of the Iterative Shrinkage/Thresholding Algorithm with a Weakly Convex Penalty” [no. 6, Mar 16 1597-1608]
- The Primal-Dual Hybrid Gradient Method for Semiconvex Splittings
- Fast Nonconvex Nonsmooth Minimization Methods for Image Restoration and Reconstruction
- An Algorithm for Splitting Parallel Sums of Linearly Composed Monotone Operators, with Applications to Signal Recovery
- Efficient Reconstruction of Piecewise Constant Images Using Nonsmooth Nonconvex Minimization
- Convex analysis and monotone operator theory in Hilbert spaces
- Sparsity-Inducing Nonconvex Nonseparable Regularization for Convex Image Processing
This page was built for publication: Non-convex total variation regularization for convex denoising of signals
