Article

Fast Variational Sparse Bayesian Learning With Automatic Relevance Determination for Superimposed Signals

Dept. of Electr. Eng., Princeton Univ., Princeton, NJ, USA
IEEE Transactions on Signal Processing (Impact Factor: 2.81). 01/2012; DOI: 10.1109/TSP.2011.2168217
Source: IEEE Xplore

ABSTRACT In this work, a new fast variational sparse Bayesian learning (SBL) approach with automatic relevance determination (ARD) is proposed. The sparse Bayesian modeling, exemplified by the relevance vector machine (RVM), allows a sparse regression or classification function to be constructed as a linear combination of a few basis functions. It is demonstrated that, by computing the stationary points of the variational update expressions with noninformative (ARD) hyperpriors, a fast version of variational SBL can be constructed. Analysis of the computed stationary points indicates that SBL with Gaussian sparsity priors and noninformative hyperpriors corresponds to removing components with signal-to-noise ratio below a 0 dB threshold; this threshold can also be adjusted to significantly improve the convergence rate and sparsity of SBL. It is demonstrated that the pruning conditions derived for fast variational SBL coincide with those obtained for fast marginal likelihood maximization; moreover, the parameters that maximize the variational lower bound also maximize the marginal likelihood function. The effectiveness of fast variational SBL is demonstrated with synthetic as well as with real data.

0 Bookmarks
 · 
251 Views
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper we address the problem of sparse signal reconstruction. We propose a new algorithm that determines the signal support applying statistical thresholding to accept the active components of the model. This adaptive decision test is integrated into the sparse Bayesian learning method, improving its accuracy and reducing convergence time. Moreover, we extend the formulation to accept multiple measurement sequences of signal contaminated by structured noise in addition to white noise. We also develop analytical expressions to evaluate the algorithm estimation error as a function of the problem sparsity and indeterminacy. By simulations, we compare the performance of the proposed algorithm with respect to other existing methods. We show a practical application processing real data of a polarimetric radar to separate the target signal from the clutter.
    IEEE Transactions on Signal Processing 01/2013; 61(21):5430-5443. · 2.81 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper a trade-off between sparsity and approximation quality of models learned with incremental automatic relevance determination (IARD) is addressed. An IARD algorithm is a class of sparse Bayesian learning (SBL) schemes. It permits an intuitive and simple adjustment of estimation expressions, with the adjustment having a simple interpretation in terms of signal-to-noise ratio (SNR). This adjustment allows for implementing a trade-off between sparsity of the estimated model versus its accuracy in terms of residual mean-square error (MSE). It is found that this adjustment has a different impact on the IARD performance, depending on whether the measurement model coincides with the used estimation model or not. Specifically, in the former case the value of the adjustment parameter set to the true SNR leads to an optimum performance of the IARD with the smallest MSE and estimated signal sparsity; moreover, the estimated sparsity then coincides with the true signal sparsity. In contrast, when there is a model mismatch, the lower MSE can be achieved only at the expense of less sparser models. In this case the adjustment parameter simply trades the estimated signal sparsity versus the accuracy of the model.
    Machine Learning for Signal Processing (MLSP), 2012 IEEE International Workshop on; 01/2012
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Energy consumption is an important issue in continuous wireless telemonitoring of physiological signals. Compressed sensing (CS) is a promising framework to address it, due to its energy-efficient data compression procedure. However, most CS algorithms have difficulty in data recovery due to non-sparsity characteristic of many physiological signals. Block sparse Bayesian learning (BSBL) is an effective approach to recover such signals with satisfactory recovery quality. However, it is time-consuming in recovering multichannel signals, since its computational load almost linearly increases with the number of channels. This work proposes a spatiotemporal sparse Bayesian learning algorithm to recover multichannel signals simultaneously. It not only exploits temporal correlation within each channel signal, but also exploits inter-channel correlation among different channel signals. Furthermore, its computational load is not significantly affected by the number of channels. The proposed algorithm was applied to brain computer interface (BCI) and EEG-based driver's drowsiness estimation. Results showed that the algorithm had both better recovery performance and much higher speed than BSBL. Particularly, the proposed algorithm ensured that the BCI classification and the drowsiness estimation had little degradation even when data were compressed by 80%, making it very suitable for continuous wireless telemonitoring of multichannel signals.
    IEEE Transactions on Neural Systems and Rehabilitation Engineering 11/2014; · 3.26 Impact Factor