scholarly journals Block Sparse Bayesian Recovery with Correlated LSM Prior

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Juan Zhao ◽  
Xia Bai ◽  
Tao Shan ◽  
Ran Tao

Compressed sensing can recover sparse signals using a much smaller number of samples than the traditional Nyquist sampling theorem. Block sparse signals (BSS) with nonzero coefficients occurring in clusters arise naturally in many practical scenarios. Utilizing the sparse structure can improve the recovery performance. In this paper, we consider recovering arbitrary BSS with a sparse Bayesian learning framework by inducing correlated Laplacian scale mixture (LSM) prior, which can model the dependence of adjacent elements of the block sparse signal, and then a block sparse Bayesian learning algorithm is proposed via variational Bayesian inference. Moreover, we present a fast version of the proposed recovery algorithm, which does not involve the computation of matrix inversion and has robust recovery performance in the low SNR case. The experimental results with simulated data and ISAR imaging show that the proposed algorithms can efficiently reconstruct BSS and have good antinoise ability in noisy environments.

2018 ◽  
Vol 66 (2) ◽  
pp. 294-308 ◽  
Author(s):  
Maher Al-Shoukairi ◽  
Philip Schniter ◽  
Bhaskar D. Rao

2021 ◽  
Author(s):  
Guisheng Wang

<div>Sparse approximation is critical to the applications of signal or image processing, and it is conducive to estimate the sparse signals with the joint efforts of transformation analysis. In this study, a simultaneous Bayesian framework was extended for sparse approximation by structured shared support, and a simultaneous sparse learning algorithm of structured approximation (SSL-SA) is proposed with transformation analysis which leads to the feasible solutions more sensibly. Then the improvements of sparse Bayesian learning and iterative reweighting were embedded in the framework to achieve speedy convergence as well as high efficiency with robustness. Furthermore, the iterative optimization and transformation analysis were embedded in the overall learning process to obtain the relative optima for sparse approximation. Finally, compared to conventional reweighting algorithms for simultaneous sparse models with l1 and l2, simulation results present the preponderance of the proposed approach to solve the sparse structure and iterative redundancy in processing sparse signals. The fact indicates that proposed method will be effective to sparsely approximate the various signals and images, which does accurately analyse the target in optimal transformation. It is envisaged that the proposed model could be suitable for a wide range of data in sparse separation and signal denosing.</div>


2015 ◽  
Vol 63 (2) ◽  
pp. 360-372 ◽  
Author(s):  
Jun Fang ◽  
Yanning Shen ◽  
Hongbin Li ◽  
Pu Wang

Sign in / Sign up

Export Citation Format

Share Document