Complex Orthogonal Matching Pursuit and Its Exact Recovery Conditions

In this paper, we present new results on using orthogonal matching pursuit (OMP), to solve the sparse approximation problem over redundant dictionaries for complex cases (i.e., complex measurement vector, complex dictionary and complex additive white Gaussian noise (CAWGN)). A sufficient condition that OMP can recover the optimal representation of an exactly sparse signal in the complex cases is proposed both in noiseless and bound Gaussian noise settings. Similar to exact recovery condition (ERC) results in real cases, we extend them to complex case and derivate the corresponding ERC in the paper. It leverages this theory to show that OMP succeed for k-sparse signal from a class of complex dictionary. Besides, an application with geometrical theory of diffraction (GTD) model is presented for complex cases. Finally, simulation experiments illustrate the validity of the theoretical analysis.

[1]  D. X. Jin,et al.  AN EFFICIENT REPRESENTATION FOR RADAR SCATTERING WITH THE USE OF THE GENETIC ALGORITHM , 1997 .

[2]  Vorapoj Patanavijit,et al.  Robust reconstruction algorithm for compressed sensing in Gaussian noise environment using orthogonal matching pursuit with partially known support and random subsampling , 2012, EURASIP J. Adv. Signal Process..

[3]  Pierre Vandergheynst,et al.  Dictionary Preconditioning for Greedy Algorithms , 2008, IEEE Transactions on Signal Processing.

[4]  Jun Zhang,et al.  On Recovery of Sparse Signals via ℓ1 Minimization , 2008, ArXiv.

[5]  M. J. Gerry,et al.  A parametric model for synthetic aperture radar measurements , 1999 .

[6]  A. Barron,et al.  Approximation and learning by greedy algorithms , 2008, 0803.1718.

[7]  Jun Zhang,et al.  On Recovery of Sparse Signals Via $\ell _{1}$ Minimization , 2008, IEEE Transactions on Information Theory.

[8]  H. Rauhut.  On the Impossibility of Uniform Sparse Reconstruction using Greedy Methods , 2007 .

[9]  Joel A. Tropp,et al.  Just relax: convex programming methods for identifying sparse signals in noise , 2006, IEEE Transactions on Information Theory.

[10]  Emmanuel J. Candès,et al.  Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.

[11]  Michael Elad,et al.  Sparse and Redundant Representations - From Theory to Applications in Signal and Image Processing , 2010 .

[12]  Frequency extrapolation by genetic algorithm based on GTD model for radar cross section , 2000, 2000 5th International Symposium on Antennas, Propagation, and EM Theory. ISAPE 2000 (IEEE Cat. No.00EX417).

[13]  Joel A. Tropp,et al.  Greed is good: algorithmic results for sparse approximation , 2004, IEEE Transactions on Information Theory.

[14]  M. J. Gerry,et al.  A GTD-based parametric model for radar scattering , 1995 .

[15]  Jian Wang,et al.  Near optimal bound of orthogonal matching pursuit using restricted isometric constant , 2012, EURASIP J. Adv. Signal Process..

[16]  Lie Wang,et al.  Orthogonal Matching Pursuit for Sparse Signal Recovery With Noise , 2011, IEEE Transactions on Information Theory.

[17]  T. Tony Cai,et al.  ON BLOCK THRESHOLDING IN WAVELET REGRESSION: ADAPTIVITY, BLOCK SIZE, AND THRESHOLD LEVEL , 2002 .

[18]  Michael A. Saunders,et al.  Atomic Decomposition by Basis Pursuit , 1998, SIAM J. Sci. Comput..

[19]  Qun Wan,et al.  Greedy approach to sparse multi-path channel estimation using sensing dictionary , 2011 .

[20]  Edward R. Vrscay,et al.  SSIM-inspired image restoration using sparse representation , 2012, EURASIP Journal on Advances in Signal Processing.

[21]  Yiming Pi,et al.  Optimized ProjectionMatrix for Compressive Sensing , 2010 .

[22]  Xiaoming Huo,et al.  Uncertainty principles and ideal atomic decomposition , 2001, IEEE Trans. Inf. Theory.

[23]  Emmanuel J. Candès,et al.  Decoding by linear programming , 2005, IEEE Transactions on Information Theory.

[24]  E. Candès,et al.  Stable signal recovery from incomplete and inaccurate measurements , 2005, math/0503066.