Adaptive Block Sparse Regularization under Arbitrary Linear Transform
Not on the map. Why?
Abstract (arXiv)
We propose a convex and fast signal reconstruction method for block sparsity under arbitrary linear transform with unknown block structure. The proposed method is a generalization of the similar existing method and can reconstruct signals with block sparsity under non-invertible transforms, unlike the existing method. Our work broadens the scope of block sparse regularization, enabling more versatile and powerful applications across various signal processing domains. We derive an iterative algorithm for solving proposed method and provide conditions for its convergence to the optimal solution. Numerical experiments demonstrate the effectiveness of the proposed method.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 4 of its 27 references that are in the map. First posted on arXiv 27 Jan 2024.
Builds on
4 of 27 references.
References · 4
- 2019Framelet Representation of Tensor Nuclear Norm for Third-Order Tensor Completioncited by 37
- 2021Learning Regularization Parameters of Inverse Problems via Deep Neural Networkscited by 19
- 2018Missing Slice Recovery for Tensors Using a Low-rank Model in Embedded Spacecited by 17
- 2013Pattern-Coupled Sparse Bayesian Learning for Recovery of Block-Sparse Signalscited by 10
Built on by
Citing papers per year: 2026: 1.
1 paper.