Fast bayesian matching pursuit
- 1 January 2008
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 326-333
Abstract
A low-complexity recursive procedure is presented for minimum mean squared error (MMSE) estimation in linear regression models. A Gaussian mixture is chosen as the prior on the unknown parameter vector. The algorithm returns both an approximate MMSE estimate of the parameter vector and a set of high posterior probability mixing parameters. Emphasis is given to the case of a sparse parameter vector. Numerical simulations demonstrate estimation performance and illustrate the distinctions between MMSE estimation and MAP model selection. The set of high probability mixing parameters not only provides MAP basis selection, but also yields relative probabilities that reveal potential ambiguity in the sparse model.Keywords
This publication has 21 references indexed in Scilit:
- Bayesian compressive sensing and projection optimization2007
- Linear Regression With a Sparse Parameter VectorIEEE Transactions on Signal Processing, 2007
- Just relax: convex programming methods for identifying sparse signals in noiseIEEE Transactions on Information Theory, 2006
- Stable signal recovery from incomplete and inaccurate measurementsCommunications on Pure and Applied Mathematics, 2006
- Stable recovery of sparse overcomplete representations in the presence of noiseIEEE Transactions on Information Theory, 2005
- Sparse Bayesian Learning for Basis SelectionIEEE Transactions on Signal Processing, 2004
- EPR Spectroscopy in Biology and MedicineAntioxidants & Redox Signaling, 2004
- 10.1162/15324430152748236Applied Physics Letters, 2000
- An Introduction to Signal Detection and Estimation1994
- Reconstruction of a sparse spike train from a portion of its spectrum and application to high-resolution deconvolutionGeophysics, 1981