Skip to Main content Skip to Navigation
Conference papers

Fast Algorithm for Sparse Signal Approximation using Multiple Additive Dictionaries

Abstract : There are several models for sparse approximation: one where a signal is a sparse linear combination of vectors over a redundant dictionary and a second model in which a collection of signals is a simultaneous sparse linear combination over a single dictionary. In this work, interpolate between these two models to synthesize a single signal of interest from K highly incoherent dictionaries while enforcing simultaneous sparsity on the K resulting coefficient vectors. We define this as the parallel approximation problem, which arises quite naturally in many applications such as MRI parallel excitation using multiple transmission coils. We present an efficient algorithm to solve the parallel approximation problem called Parallel Orthogonal Matching Pursuit (POMP). We prove its correctness in a general setting and then discuss adaptations needed to make it suitable for use in an MRI parallel excitation setting. We then discuss parallel excitation in more detail and demonstrate how POMP solves the problem as accurately, but much faster, than previously proposed convex optimization methods.
Complete list of metadata

Cited literature [9 references]  Display  Hide  Download
Contributor : Ist Rennes <>
Submitted on : Friday, March 20, 2009 - 10:34:57 AM
Last modification on : Wednesday, August 7, 2019 - 2:34:15 PM
Long-term archiving on: : Thursday, June 10, 2010 - 5:33:30 PM


Files produced by the author(s)


  • HAL Id : inria-00369508, version 1



Ray Maleh, Daehyun Yoon, Anna C. Gilbert. Fast Algorithm for Sparse Signal Approximation using Multiple Additive Dictionaries. SPARS'09 - Signal Processing with Adaptive Sparse Structured Representations, Inria Rennes - Bretagne Atlantique, Apr 2009, Saint Malo, France. ⟨inria-00369508⟩



Record views


Files downloads