Loading...
| Friend's email | |
| Your name | |
| Your email | |
| enter code | |
This page was sent successfuly
Bayesian pursuit algorithm for sparse representation
Zayyani, H ; Sharif University of Technology | 2009
667
Viewed
- Type of Document: Article
- DOI: 10.1109/ICASSP.2009.4959892
- Publisher: 2009
- 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. ©2009 IEEE
- Keywords:
- Bayesian ; Bayesian frameworks ; Bayesian hypothesis ; Compressed sensing (CS) ; Pursuit algorithms ; Simulation result ; Sparse component analysis (SCA) ; Sparse representation ; Acoustics ; Atoms ; Bayesian networks ; Signal processing ; Signal reconstruction ; Statistical tests ; Algorithms
- Source: 2009 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2009, Taipei, 19 April 2009 through 24 April 2009 ; 2009 , Pages 1549-1552 ; 15206149 (ISSN); 9781424423545 (ISBN)
- URL: https://ieeexplore.ieee.org/abstract/document/4959892
