Skip to main content
SpringerLink
Log in

Analysis of orthogonal multi-matching pursuit under restricted isometry property

  • Articles
  • Published:
Science China Mathematics Aims and scope Submit manuscript

Abstract

Orthogonal multi-matching pursuit (OMMP) is a natural extension of orthogonal matching pursuit (OMP) in the sense that N (N ⩾ 1) indices are selected per iteration instead of 1. In this paper, the theoretical performance of OMMP under the restricted isometry property (RIP) is presented. We demonstrate that OMMP can exactly recover any K-sparse signal from fewer observations y = Φx, provided that the sampling matrix Φ satisfies

$$\delta _{KN - N + 1} + \sqrt {\frac{K} {N}} \theta _{KN - N + 1} ,N < 1.$$

Moreover, the performance of OMMP for support recovery from noisy observations is also discussed. It is shown that, for ℓ2 bounded and ℓ∞ bounded noisy cases, OMMP can recover the true support of any K-sparse signal under conditions on the restricted isometry property of the sampling matrix Φ and the minimum magnitude of the nonzero components of the signal.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Cai T, Wang L, Xu G. Shifting inequality and recovery of sparse signals. IEEE Trans Signal Process, 2010, 58: 1300–1308

    Article  MathSciNet  Google Scholar 

  2. Cai T, Xu G, Zhang J. On recovery of sparse signal via ℓ1 minimization. IEEE Trans Inf Theory, 2009, 55: 3388–3397

    MathSciNet  Google Scholar 

  3. Candes E J, Romberg J, Tao T. Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information. IEEE Trans Inf Theory, 2006, 52: 489–509

    MATH  MathSciNet  Google Scholar 

  4. Candes E J, Tao T. Decoding by linear programming. IEEE Trans Inf Theory, 2005, 51: 4203–4215

    MATH  MathSciNet  Google Scholar 

  5. Dai W, Milenkovic O. Subspace pursuit for compressive sensing signal reconstruction. IEEE Trans Inf Theory, 2009, 55: 2230–2249

    MathSciNet  Google Scholar 

  6. Dan W. A sharp RIP condition for orthogonal matching pursuit. Abstr Appl Anal, 2013, 482357(3pp)

  7. Dan W, Wang R H. Robustness of orthogonal matching pursuit under restricted isometry property. Sci China Math, 2014, 57: 627–634

    MathSciNet  Google Scholar 

  8. Davenport M A, Wakin M B. Analysis of orthogonal matching pursuit using the restricted isometry property. IEEE Trans Inf Theory, 2010, 56: 4395–4401

    MathSciNet  Google Scholar 

  9. Donoho D L. Compressed sensing. IEEE Trans Inf Theory, 2006, 52: 1289–1306

    MATH  MathSciNet  Google Scholar 

  10. Donoho D L, Elad M. Optimally sparse representation in general (nonorthogonal) dictionaries vid ℓ1 minimization. Proc Nat Acad Sci, 2003, 100: 2197–2202

    MATH  MathSciNet  Google Scholar 

  11. Huang S, Zhu J. Recovery of sparse signals using OMP and its variants: Convergence analysis based on RIP. Inverse Problems, 2011, 27: 035003 (14pp)

    MathSciNet  Google Scholar 

  12. Liu E T, Temlyakov V N. The orthogonal super greedy algorithm and applications in compressed sensing. IEEE Trans Inf Theory, 2012, 58: 2040–2047

    MathSciNet  Google Scholar 

  13. Maleh R. Improved RIP analysis of orthogonal matching pursuit. ArXiv:1102.4311, 2011

    Google Scholar 

  14. Needell D, Tropp J A. CoSaMP: Iterative signal recovery from incomplete and inaccurate samples. Appl Comput Harm Anal, 2009, 26: 301–321

    MATH  MathSciNet  Google Scholar 

  15. Needell D, Vershynin R. Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit. Found Comput Math, 2007, 9: 317–344

    MathSciNet  Google Scholar 

  16. Needell D, Vershynin R. Signal recovery from incomplete and inaccurate measurements via regualarized orthogonal matching pursuit. IEEE J Select Top Signal Process, 2010, 4: 310–316

    Google Scholar 

  17. Saab R, Yilmaz O. Sparse recovery by non-convex optimization — instance optimality. Appl Comput Harmon Anal, 2010, 29: 30–48

    MATH  MathSciNet  Google Scholar 

  18. Satpathi S, Das R, Chakraborty M. Improving the bound on the RIP constant in generalized orthogonal matching pursuit. IEEE Signal Process Letters, 2013, 20: 1074–1077

    Google Scholar 

  19. Tropp J A. Greed is good: Algorithmic results for sparse approximation. IEEE Trans Inf Theory, 2004, 50: 2231–2242

    MATH  MathSciNet  Google Scholar 

  20. Wang J, Kwon S, Shim B. Generalized orthogonal matching pursuit. IEEE Trans Signal Process, 2012, 60: 6202–6216

    MathSciNet  Google Scholar 

  21. Wang J, Shim B. Improved recovery bounds of orthogonal matching pursuit using restricted isometry property. ArXiv:1211.4293, 2012

    Google Scholar 

  22. Xu Z Q. Compressed sensing: A survey (in Chinese). Sci Sin Math, 2012, 42: 865–877

    Google Scholar 

  23. Xu Z Q. The performance of orthogonal multi-matching pursuit under RIP. ArXiv:1210.5323v2, 2012

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematics and Statistics, Guangdong University of Finance & Economics, Guangzhou, 510320, China

    Wei Dan

Authors
  1. Wei Dan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wei Dan.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Dan, W. Analysis of orthogonal multi-matching pursuit under restricted isometry property. Sci. China Math. 57, 2179–2188 (2014). https://doi.org/10.1007/s11425-014-4843-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11425-014-4843-x

Keywords

MSC(2010)

Search

Navigation