One of the main challenges in block-sparse signal recovery, as encountered in, e.g., multi-antenna mmWave channel models, is block-patterned estimation without knowledge of block sizes and boundaries. We propose a novel Sparse Bayesian Learning (SBL) method for block-sparse signal recovery under unknown block patterns. Contrary to conventional approaches that impose block-promoting regularization on the signal components, we apply two classes of hyperparameter regularizers for the SBL cost function, inspired by total variation (TV) denoising.The first class relies on a conventional TV difference unit and allows performing the SBL inference iteratively through a set of convex optimization problems, enabling a flexible choice of numerical solvers. The second class incorporates a region-aware TV penalty to penalize the signal and zero blocks in a dissimilar manner, enhancing the performance. We derive an alternating optimization algorithm based on expectation-maximization to perform the SBL inference through computationally efficient parallel updates for both the regularizer classes. The numerical results show that the proposed TV-regularized SBL algorithm is robust to the nature of the block structure and is capable of recovering signals with both block-patterned and isolated components, proving effective for various signal recovery systems.
Block-sparse signal recovery without knowledge of block sizes and boundaries, such as those encountered in multi-antenna mmWave channel models, is a hard problem for compressed sensing (CS) algorithms. We propose a novel Sparse Bayesian Learning (SBL) method for block-sparse recovery based on popular CS based regularizers with the function input variable related to total variation (TV). Contrary to conventional approaches that impose the regularization on the signal components, we regularize the SBL hyperparameters. This iterative TV-regularized SBL algorithm employs a majorization-minimization approach and reduces each iteration to a convex optimization problem, enabling a flexible choice of numerical solvers. The numerical results illustrate that the TV-regularized SBL algorithm is robust to the nature of the block structure and able to recover signals with both block-patterned and isolated components, proving useful for various signal recovery systems.
Block-sparse signal recovery without knowledge of block sizes and boundaries, such as those encountered in multi-antenna mmWave channel models, is a hard problem for compressed sensing (CS) algorithms. We propose a novel Sparse Bayesian Learning (SBL) method for block-sparse recovery based on popular CS based regularizers with the function input variable related to total variation (TV). Contrary to conventional approaches that impose the regularization on the signal components, we regularize the SBL hyperparameters. This iterative TV-regularized SBL algorithm employs a majorization-minimization approach and reduces each iteration to a convex optimization problem, enabling a flexible choice of numerical solvers. The numerical results illustrate that the TV-regularized SBL algorithm is robust to the nature of the block structure and able to recover signals with both block-patterned and isolated components, proving useful for various signal recovery systems.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.