Bayesian Pursuit algorithm for sparse representation

In this paper, we propose a Bayesian Pursuit algorithm for sparse representation. It uses both the simplicity of the pursuit algorithms and optimal Bayesian framework to determine active atoms in sparse representation of a signal. We show that using Bayesian Hypothesis testing to determine the active atoms from the correlations leads to an efficient activity measure. Simulation results show that our suggested algorithm has better performance among the algorithms which have been implemented in our simulations in most of the cases.

• Type: Conference
• Year: 2009
• Where: ICASSP
• Authors: Hadi Zayyani, Massoud Babaie-Zadeh, Christian Jutten
• Keywords: Bayesian Pursuit Algorithm, ICASSP 2009, Pursuit Algorithms, Signal Processing, Sparse Representation