Sparsity Within and Across Overlapping Groups
arXiv:1708.06166 · doi:10.1109/LSP.2017.2785183
Abstract
Recently, penalties promoting signals that are sparse within and across groups have been proposed. In this letter, we propose a generalization that allows to encode more intricate dependencies within groups. However, this complicates the realization of the threshold function associated with the penalty, which hinders the use of the penalty in energy minimization. We discuss how to sidestep this problem, and demonstrate the use of the modified penalty in an energy minimization formulation for an inverse problem.
References in corpus (5)
- Group-Sparse Signal Denoising: Non-Convex Regularization, Convex Optimization
- A Proximal Decomposition Method for Solving Convex Variational Inverse Problems
- Sparse Signal Estimation by Maximally Sparse Convex Optimization
- On the Convergence of the Iterative Shrinkage/Thresholding Algorithm With a Weakly Convex Penalty
- A Penalty Function Promoting Sparsity Within and Across Groups