## Sparse solutions to linear inverse problems with multiple measurement vectors (2005)

### Cached

### Download Links

- [dsp.rice.edu]
- [www.dsp.ece.rice.edu]
- [dsp.rice.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | IEEE Trans. Signal Processing |

Citations: | 129 - 10 self |

### BibTeX

@ARTICLE{Cotter05sparsesolutions,

author = {Shane F. Cotter and Bhaskar D. Rao and Kjersti Engan and Kenneth Kreutz-delgado and Senior Member},

title = {Sparse solutions to linear inverse problems with multiple measurement vectors},

journal = {IEEE Trans. Signal Processing},

year = {2005},

pages = {2477--2488}

}

### Years of Citing Articles

### OpenURL

### Abstract

Abstract—We address the problem of finding sparse solutions to an underdetermined system of equations when there are multiple measurement vectors having the same, but unknown, sparsity structure. The single measurement sparse solution problem has been extensively studied in the past. Although known to be NP-hard, many single–measurement suboptimal algorithms have been formulated that have found utility in many different applications. Here, we consider in depth the extension of two classes of algorithms–Matching Pursuit (MP) and FOCal Underdetermined System Solver (FOCUSS)–to the multiple measurement case so that they may be used in applications such as neuromagnetic imaging, where multiple measurement vectors are available, and solutions with a common sparsity structure must be computed. Cost functions appropriate to the multiple measurement problem are developed, and algorithms are derived based on their minimization. A simulation study is conducted on a test-case dictionary to show how the utilization of more than one measurement vector improves the performance of the MP and FOCUSS classes of algorithm, and their performances are compared. I.