An Empirical Bayesian Strategy for Solving the Simultaneous Sparse Approximation Problem
University of California System · University of California, San Francisco · +1 more institution
Abstract
Given a large overcomplete dictionary of basis vectors, the goal is to simultaneously represent L>1 signal vectors using coefficient expansions marked by a common sparsity profile. This generalizes the standard sparse representation problem to the case where multiple responses exist that were putatively generated by the same small subset of features. Ideally, the associated sparse generating weights should be recovered, which can have physical significance in many applications (e.g., source localization). The generic solution to this problem is intractable and, therefore, approximate procedures are sought. Based on the concept of automatic relevance determination, this paper uses an empirical Bayesian prior to…
Citation impact
- FWCI
- 18.42
- Percentile
- 100%
- References
- 66
Authors
2Topics & keywords
- Sparse approximation
- Matching pursuit
- Bayesian probability
- Maxima and minima
- Basis pursuit
- Basis function
- Posterior probability
- Basis (linear algebra)