.png){kind=icon}
Return
Parallel block sparse Bayesian learning for high dimensional sparse signals
.png){kind=icon}
PRE
AI
DOI：10.1016/j.sigpro.2025.109938.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We address the recovery of block sparse signals by proposing a distributed solution that uses a block-diagonal approximation to the dictionary matrix of the problem. The approximation is found in two stages. First, the Gram matrix of the dictionary matrix is used as a basis for spectral clustering. Afterwards, measurement positions are assigned to the clusters formed from this spectral clustering. The method is then applied to use previous algorithms in the literature of Block Sparse Bayesian Learning in parallel. Moreover, this method also speeds up the algorithm in serial systems. The efficacy of the proposed method is demonstrated in simulations with comparison to the previous Block Sparse Bayesian Learning algorithms.
Keywords:
Sparse Bayesian Learning
Spectral clustering
Sparse signal recovery
Block sparse model
Assignment algorithm
Journal
IF:
3.6
Papers:
10.0K
Citations:
1.7W
Organization
Cited Papers
Comparison of adrenergic receptor binding in blood cells from alcoholics and controls.png)
Alcohol
AlcoholIF0
PREAI
ShareSaveShareSaveShareSaveTinnitus Retraining Therapy (TRT) as a Method for Treatment of Tinnitus and Hyperacusis Patients
PREAI
ShareSaveShareSaveShareSave
View more