Projects per year
This paper revisits the sparse multiple measurement vector (MMV) problem, where the aim is to recover a set of jointly sparse multichannel vectors from incomplete measurements. This problem is an extension of single channel sparse recovery, which lies at the heart of compressed sensing. Inspired by the links to array signal processing, a new family of MMV algorithms is considered that highlight the role of rank in determining the difficulty of the MMV recovery problem. The simplest such method is a discrete version of MUSIC which is guaranteed to recover the sparse vectors in the full rank MMV setting, under mild conditions. This idea is extended to a rank aware pursuit algorithm that naturally reduces to Order Recursive Matching Pursuit (ORMP) in the single measurement case while also providing guaranteed recovery in the full rank setting. In contrast, popular MMV methods such as Simultaneous Orthogonal Matching Pursuit (SOMP) and mixed norm minimization techniques are shown to be rank blind in terms of worst case analysis. Numerical simulations demonstrate that the rank aware techniques are significantly better than existing methods in dealing with multiple measurements.
|Number of pages||12|
|Journal||IEEE Transactions on Information Theory|
|Publication status||Published - 2012|
- Compressed sensing
- multiple measurement vectors
- sparse representations
FingerprintDive into the research topics of 'Rank Awareness in Joint Sparse Recovery'. Together they form a unique fingerprint.
- 2 Finished
Extensions to compressed sensing theory with application to dynamic MRI
1/03/09 → 31/03/12
Davies, M. & Tanner, J.
1/02/09 → 31/07/12