Fast OOMP algorithm and its application in compressed sensing

A signal approximation algorithm termed “Fast Optimal Orthogonal Matching Pursuit” (Fast OOMP) is proposed which can be applied in the signal recovery of compressed sensing. Theoretical proofs and simulation results manifest that the signal recovery performance of Fast OOMP is identical to that of Optimal Orthogonal Matching Pursuit (OOMP) while the arithmetic computations are approximately half of that of OOMP.

[1]  E. Candès,et al.  Sparsity and incoherence in compressive sampling , 2006, math/0611957.

[2]  L. Rebollo-Neira,et al.  Optimized orthogonal matching pursuit approach , 2002, IEEE Signal Processing Letters.

[3]  Deanna Needell,et al.  CoSaMP: Iterative signal recovery from incomplete and inaccurate samples , 2008, ArXiv.

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

[5]  Thomas S. Huang,et al.  A fast orthogonal matching pursuit algorithm , 1998, Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '98 (Cat. No.98CH36181).

[6]  Olgica Milenkovic,et al.  Subspace Pursuit for Compressive Sensing Signal Reconstruction , 2008, IEEE Transactions on Information Theory.

[7]  Y. C. Pati,et al.  Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition , 1993, Proceedings of 27th Asilomar Conference on Signals, Systems and Computers.

[8]  Stéphane Mallat,et al.  Matching pursuits with time-frequency dictionaries , 1993, IEEE Trans. Signal Process..

[9]  David L Donoho,et al.  Compressed sensing , 2006, IEEE Transactions on Information Theory.

[10]  Laura Rebollo-Neira,et al.  Letter to the Editor: Experiments on orthogonalization by biorthogonal representations of orthogonal projectors , 2007 .

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