# Preconditioning for Orthogonal Matching Pursuit with Noisy and Random Measurements: The Gaussian Case

- 127 Downloads

## Abstract

The success of orthogonal matching pursuit (OMP) in the sparse signal recovery heavily depends on its ability for correct support recovery. Based on a support recovery guarantee for OMP expressed in terms of the mutual coherence, and a result about the concentration of the extreme singular values of a Gaussian random matrix, this paper proposes a preconditioning method for increasing the recovery rate of OMP from random and noisy measurements. Compared to several existing preconditionings, the proposed method can reduce the mutual coherence with a proven high probability. Simultaneously, the proposed preconditioning can also succeed with a high probability in providing slight signal-to-noise ratio reduction, which is empirically shown to be less severe than that caused by a recently suggested technique for the noisy case. The simulations show the advantages of the proposed preconditioning over other currently relevant ones in terms of both the performance improvement for OMP, and computation time.

## Keywords

Orthogonal matching pursuit Noise Preconditioning Gaussian random matrices Mutual coherence## Notes

### Acknowledgements

This work was supported in part by the National Natural Science Foundation of China under Contacts 11131006, 41390450 and 91330204, in part by EU FP7-IRSES Project LIVCODE under Grant 295151, and in part by the National Basic Research Program of China under Contact 2013CB329404. We would like to thank Evaggelia Tsiligianni for providing the code implementing the preconditioning in his or her own work, and patiently discussing the details about the work. Special thanks are due to Karin Schnass for instructive discussions on her work. We would also like to thank the referees for numerous suggestions which helped to clarify the exposition and argumentation.

## References

- 1.Z. Ben-Haim, Y.C. Eldar, M. Elad, Coherence-based performance guarantees for estimating a sparse vector under random noise. IEEE Trans. Signal Process.
**58**, 5030–5043 (2010)MathSciNetCrossRefzbMATHGoogle Scholar - 2.M. Bucolo, R. Caponetto, L. Fortuna, M. Frasca, A. Rizzo, Does chaos work better than noise? IEEE Circuits Syst. Mag.
**2**, 4–19 (2002)CrossRefGoogle Scholar - 3.T.T. Cai, L. Wang, Orthogonal matching pursuit for sparse signal recovery with noise. IEEE Trans. Inf. Theory
**57**, 4680–4688 (2011)MathSciNetCrossRefzbMATHGoogle Scholar - 4.E.J. Candes, T. Tao, Decoding by linear programming. IEEE Trans. Inf. Theory
**51**, 4203–4215 (2005)MathSciNetCrossRefzbMATHGoogle Scholar - 5.Y.T. Chen, J.G. Peng, Influences of preconditioning on the mutual coherence and the restricted isometry property of Gaussian/Bernoulli measurement matrices. Linear Multilinear Algebra
**64**, 1750–1759 (2016)MathSciNetCrossRefzbMATHGoogle Scholar - 6.W. Dai, O. Milenkovic, Subspace pursuit for compressive sensing signal reconstruction. IEEE Trans. Inf. Theory
**55**, 2230–2249 (2009)MathSciNetCrossRefzbMATHGoogle Scholar - 7.K.R. Davidson, S.J. Szarek, Local operator theory, random matrices and Banach spaces, in
*Handbook of the Geometry of Banach Spaces*, ed. by W.B. Johnson, J. Lindenstrauss (Elsevier, Amsterdam, 2001), pp. 317–366CrossRefGoogle Scholar - 8.D.L. Donoho, M. Elad, V.N. Temlyakov, Stable recovery of sparse overcomplete representations in the presence of noise. IEEE Trans. Inf. Theory
**52**, 6–18 (2006)MathSciNetCrossRefzbMATHGoogle Scholar - 9.M. Elad,
*Sparse and Redundant Representations: From Theory to Applications in Signal and Image Processing*(Springer, New York, 2010), p. 25, 25, 98CrossRefzbMATHGoogle Scholar - 10.S. Foucart, H. Rauhut,
*A Mathematical Introduction to Compressive Sensing*(Springer, New York, 2013), pp. 65–69, 69–70Google Scholar - 11.M. Lin, G. Sinnamon, The generalized Wielandt inequality in inner product spaces. Eurasian Math. J.
**3**, 72–85 (2012)MathSciNetzbMATHGoogle Scholar - 12.K. Schnass, P. Vandergheynst, Average performance analysis for thresholding. IEEE Signal Process. Lett.
**14**, 828–831 (2007)CrossRefGoogle Scholar - 13.K. Schnass, P. Vandergheynst, Dictionary preconditioning for greedy algorithms. IEEE Trans. Signal Process.
**56**, 1994–2002 (2008)MathSciNetCrossRefzbMATHGoogle Scholar - 14.A.M. Tillmann, M.E. Pfetsch, The computational complexity of the restricted isometry property, the nullspace property, and related concepts in compressed sensing. IEEE Trans. Inf. Theory
**60**, 1248–1259 (2014)MathSciNetCrossRefzbMATHGoogle Scholar - 15.J.A. Tropp, Greed is good: algorithmic results for sparse approximation. IEEE Trans. Inf. Theory
**50**, 2231–2242 (2004)MathSciNetCrossRefzbMATHGoogle Scholar - 16.J.A. Tropp, On the conditioning of random subdictionaries. Appl. Comput. Harmon. Anal.
**25**, 1–24 (2008)MathSciNetCrossRefzbMATHGoogle Scholar - 17.J.A. Tropp, A.C. Gilbert, Signal recovery from random measurements via orthogonal matching pursuit. IEEE Trans. Inf. Theory
**53**, 4655–4666 (2007)MathSciNetCrossRefzbMATHGoogle Scholar - 18.E. Tsiligianni, L.P. Kondi, A.K. Katsaggelos, Preconditioning for underdetermined linear systems with sparse solutions. IEEE Signal Process. Lett.
**22**, 1239–1243 (2015)CrossRefGoogle Scholar - 19.M.J. Wainwright, Information theoretic limits on sparsity recovery in the high dimensional and noisy setting. IEEE Trans. Inf. Theory
**55**, 5728–5741 (2009)MathSciNetCrossRefzbMATHGoogle Scholar - 20.L. Yu, J.P. Barbot, G. Zheng, H. Sun, Compressive sensing with chaotic sequence. IEEE Signal Process. Lett.
**17**, 731–734 (2010)CrossRefGoogle Scholar - 21.J. Zhao, X. Bai, S.H. Bi, R. Tao, Coherence-based analysis of modified orthogonal matching pursuit using sensing dictionary. IET Signal Process.
**9**, 218–225 (2015)CrossRefGoogle Scholar