Bayesian Pursuit Algorithm for Sparse Representation - Archive ouverte HAL Access content directly
Conference Papers Year : 2009

Bayesian Pursuit Algorithm for Sparse Representation

Abstract

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.
Fichier principal
Vignette du fichier
ICASSP2009_ZayyaniBJ_BPA.pdf (124.14 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-00400478 , version 1 (30-06-2009)

Identifiers

  • HAL Id : hal-00400478 , version 1

Cite

Hadi Zayyani, Massoud Babaie-Zadeh, Christian Jutten. Bayesian Pursuit Algorithm for Sparse Representation. ICASSP 2009 - IEEE International Conference on Acoustics, Speech and Signal Processing, Apr 2009, Taipei, Taiwan. pp.1549-1552. ⟨hal-00400478⟩
198 View
385 Download

Share

Gmail Facebook X LinkedIn More