Circuits, Systems, and Signal Processing

, Volume 38, Issue 7, pp 3295–3320 | Cite as

An Optimal Recovery Condition for Sparse Signals with Partial Support Information via OMP

  • Huanmin Ge
  • Wengu ChenEmail author


This paper considers the orthogonal matching pursuit (OMP) algorithm for sparse recovery in both noiseless and noisy cases when the partial prior information is available. The prior information is included in an estimated subset of the support of the sparse signal. First, we show that if \(\varvec{A}\) satisfies \(\delta _{k+b+1}<\frac{1}{\sqrt{k-g+1}}\), then the OMP algorithm can perfectly recover any k-sparse signal \(\varvec{x}\) from \(\varvec{y}=\varvec{Ax}\) in \(k-g\) iterations when the prior support of \(\varvec{x}\) includes g true indices and b wrong indices. Furthermore, we show that the condition \(\delta _{k+b+1}<\frac{1}{\sqrt{k-g+1}}\) is optimal. Second, we achieve the exact recovery of the remainder support (i.e., it is composed of indices in the true support of \(\varvec{x}\) but not in the prior support) from \(\varvec{y}=\varvec{Ax}+\varvec{v}\) under appropriate conditions. On the other hand, for the remainder support recovery, we also obtain a necessary condition based on the minimum magnitude of nonzero elements in the remainder support of \(\varvec{x}\). Compared to the OMP algorithm, numerical experiments demonstrate that the OMP algorithm with the partial prior information has better recovery performance.


Orthogonal matching pursuit Partial support information Restricted isometry constant Sensing matrix 



The authors thank the referees for their valuable suggestion and comments that greatly improve the presentation of this paper. The authors are also thankful to Qun Mo for his meaningful discussion about Remark 3. This work was supported by the NSF of China (Nos. 11871109, 61471343), the National Key Research and Development Program of China (No. 2018YFC2000605), NSAF(Grant No. U1830107) and the Science Challenge Project (Grant TZ2018001).


  1. 1.
    A.S. Bandeira, K. Scheinberg, L.N. Vicente, On partially sparse recovery, Technical Report, Department of Mathematics, University of Coimbra (2011)Google Scholar
  2. 2.
    R. Baraniuk, P. Steeghs, Compressive radar imaging, in Proceedings of the IEEE Radar Conference, pp. 128–133 (2007)Google Scholar
  3. 3.
    R.F.V. Borries, C.J. Miosso, C. Potes, Compressed sensing using prior information, in 2nd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, CAMPSAP 2007, IEEE, pp. 121–124Google Scholar
  4. 4.
    T. Cai, A. Zhang, Spares representation of a polytope and recovery of sparse signals and low-rank matrices. IEEE Trans. Inf. Theory 60(1), 122–132 (2014)CrossRefzbMATHGoogle Scholar
  5. 5.
    E.J. Candès, T. Tao, Decoding by linear programming. IEEE Trans. Inf. Theory 51(12), 4203–4215 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    W. Chen, Y. Li, G. Wu, Recovery of signals under the high order RIP condition via prior support information. Signal Process. 153, 83–94 (2018)CrossRefGoogle Scholar
  7. 7.
    W. Dai, O. Milenkovic, Subspace pursuit for compressive sensing signal reconstruction. IEEE Trans. Inf. Theory 55(5), 2230–2249 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    M.A. Davenport, J.N. Laska, J.R. Treichler, R.G. Baraniuk, The pros and cons of compressive sensing for wideband signal acquisition: noise folding versus dynamic range. IEEE Trans. Signal Process. 60(9), 4628–4642 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    S. Foucart, H. Rauhut, A Mathematical Introduction to Compressive Sensing (Birkhäuser, Basel, 2013)CrossRefzbMATHGoogle Scholar
  10. 10.
    M.P. Friedlander, H. Mansour, R. Saab, O. Yilmaz, Recovering compressively sampled signals using partial support information. IEEE Trans. Inf. Theory 58(2), 1122–1134 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    H. Ge, W. Chen, Recovery of signals by a weighted $\ell _2/\ell _1$ minimization under arbitrary prior support information. Signal process. 148, 288–302 (2018)CrossRefGoogle Scholar
  12. 12.
    M.A. Herman, T. Strohmer, High-resolution radar via compressed sensing. IEEE Trans. Signal Process. 57(6), 2275–2284 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    C. Herzet, C. Soussen, J. Idier, R. Gribonval, Exact recovery conditions for sparse representations with partial support information. IEEE Trans. Inf. Theory 59(11), 7509–7524 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    L. Jacques, A short note on compressed sensing with partially known signal support. Signal Process. 90(12), 3308–3312 (2010)CrossRefzbMATHGoogle Scholar
  15. 15.
    N.B. Karahanoglu, H. Erdogan, On the theoretical analysis of orthogonal matching pursuit with termination based on the residue. Exp. Brain Res. 187(1), 71–84 (2012)Google Scholar
  16. 16.
    N.B. Karahanoglu, H. Erdogan, Online recovery guarantees and analytical results for OMP. arXiv:1210.5991v2 (2013)Google Scholar
  17. 17.
    M.A. Khajehnejad, W. Xu, A.S. Avestimehr, B. Hassibi, Weighted $\ell _1$ minimization for sparse recovery with prior information, in IEEE International Symposium on Information Theory (ISIT) 2009, IEEE, pp. 483–487, June 2009Google Scholar
  18. 18.
    B. Li, Y. Shen, Z. Wu, J. Li, Sufficient conditions for generalized orthogonal matching pursuit in noisy case. Signal Process. 143, 111–123 (2015)CrossRefGoogle Scholar
  19. 19.
    H. Liu, J. Peng, Sparse signal recovery via alternating projection method. Signal Process. 143, 161–170 (2018)CrossRefGoogle Scholar
  20. 20.
    H. Liu, Y. Ma, Y. Fu, An improved RIP-based performance guarantee for sparse signal recovery via simultaneous orthogonal matching pursuit. Signal Process. 144, 29–35 (2018)CrossRefGoogle Scholar
  21. 21.
    W. Lu, N. Vaswani, Exact reconstruction conditions and error bounds for regularized modified basis pursuit, in Proceedings of the Asilomar Conference on Signals, Systems and Computers (2010)Google Scholar
  22. 22.
    M. Lustig, D.L. Donoho, J.M. Santos, J.M. Pauly, Compressed sensing MRI. IEEE Signal Process. Mag. 25(2), 72–82 (2008)CrossRefGoogle Scholar
  23. 23.
    Q. Mo, A sharp restricted isometry constant bound of orthogonal matching pursuit. arXiv:1501.01708 v1[cs.IT] (2015)Google Scholar
  24. 24.
    L.B. Montefusco, D. Lazzaro, S. Papi, A fast algorithm for nonconvex approaches to sparse recovery problems. Signal Process. 93, 2636–2647 (2013)CrossRefGoogle Scholar
  25. 25.
    D. Needell, J.A. Tropp, CoSaMP: iterative signal recovery from incomplete and inaccurate samples. Appl. Comput. Harmon. Anal. 26(3), 301–321 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  26. 26.
    D. Needell, R. Saab, T. Woolf, Weighted $\ell _1$-minimization for sparse recovery under arbitrary prior information. Inf. Inference J. IMA 6, 284C309 (2017)zbMATHGoogle Scholar
  27. 27.
    J.A. Tropp, A.C. Gilbert, Signal recovery from random measurements via orthogonal matching pursuit. IEEE Trans. Inf. Theory 53(12), 4655–4666 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  28. 28.
    J.A. Tropp, J.N. Laska, M.F. Duarte, J.K. Romberg, R.G. Baraniuk, Beyond Nyquist: efficient sampling of sparse, bandlimited signals. IEEE Trans. Inf. Theory 56(1), 520–544 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  29. 29.
    N. Vaswani, W. Lu, Modified-CS: modifying compressive sensing for problems with partially known support. IEEE Trans. Signal Process. 58(9), 4595–4607 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  30. 30.
    J. Wen, J. Wang, Q. Zhang, Nearly optimal bounds for orthogonal least squares. IEEE Trans. Signal Process. 65(20), 5347–5356 (2017)MathSciNetCrossRefzbMATHGoogle Scholar
  31. 31.
    J. Wen, Z. Zhou, J. Wang, X. Tang, Q. Mo, A sharp condition for exact support recovery of sparse signals with orthogonal matching pursuit. IEEE Trans. Signal Process. 65, 1370–1382 (2017)MathSciNetCrossRefzbMATHGoogle Scholar
  32. 32.
    R. Zhang, S. Li, A proof of conjecture on restricted isometry property constants $\delta _{tk}$ ($0<t<\frac{4}{3}$). IEEE Trans. Inf. Theory 64(3), 1699–1705 (2018)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2019

Authors and Affiliations

  1. 1.The Sports Engineering CollegeBeijing Sport UniversityBeijingChina
  2. 2.Institute of Applied Physics and Computational MathematicsBeijingChina

Personalised recommendations