We use a few cookies

Essential cookies keep the library working. With your permission, we'd also like to use analytics to see what's useful and improve the experience. Read our Privacy Policy or Cookie Policy.

Skip to main content
Home/e-Resources/Electrical Engineering/A sparse Bayesian learning algorithm with dictionary parameter estimation
PeriodicalsElectrical Engineering

A sparse Bayesian learning algorithm with dictionary parameter estimation

Checking your access to this record.

Abstract & Overview

This paper concerns sparse decomposition of a noisy signal into atoms which are specified by unknown continuous-valued parameters. An example could be estimation of the model order, frequencies and amplitudes of a superposition of complex sinusoids. The common approach is to reduce the continuous parameter space to a fixed grid of points, thus restricting the solution space. In this work, we avoid discretization by working directly with the signal model containing parameterized atoms. Inspired by the “fast inference scheme” by Tipping and Faul we develop a novel sparse Bayesian learning (SBL) algorithm, which estimates the atom parameters along with the model order and weighting coefficients. Numerical experiments for spectral estimation with closely-spaced frequency components, show that the proposed SBL algorithm outperforms state-of-the-art subspace and compressed sensing methods.

Cite this record

Thomas Hansen, Mihai-Alin Badiu, Bernard H. Fleury, Bhaskar D. Rao (2014). A sparse Bayesian learning algorithm with dictionary parameter estimation. Proceedings of the IEEE Sensor Array and Multichannel Signal Processing Workshop, 385–388. https://doi.org/10.1109/sam.2014.6882422

Copy in another style

Hansen, T., Badiu, M., Fleury, B. H., & Rao, B. D. (2014). A sparse Bayesian learning algorithm with dictionary parameter estimation. Proceedings of the IEEE Sensor Array and Multichannel Signal Processing Workshop, 385–388. https://doi.org/10.1109/sam.2014.6882422
Author names are used as deposited, so check their order before you submit.

Metadata is harvested from open-access indexes and can be incomplete. Check a citation against the published version before relying on it — see our open access & attribution policy.