Table of Contents Author Guidelines Submit a Manuscript
Journal of Function Spaces
Volume 2015 (2015), Article ID 579853, 10 pages
http://dx.doi.org/10.1155/2015/579853
Research Article

On the Null Space Property of -Minimization for in Compressed Sensing

1School of Mathematics and Statistics, Xi’an Jiaotong University, Xi’an, Shaanxi 710049, China
2School of Mathematics and Information Science, Beifang University of Nationalities, Yinchuan, Ningxia 750021, China
3School of Computer Science, University of Lincoln, Lincoln LN6 7TS, UK

Received 18 December 2014; Revised 1 March 2015; Accepted 2 March 2015

Academic Editor: Yuri Latushkin

Copyright © 2015 Yi Gao et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. E. J. Candès, J. Romberg, and T. Tao, “Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information,” IEEE Transactions on Information Theory, vol. 52, no. 2, pp. 489–509, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  2. E. J. Candès and T. Tao, “Decoding by linear programming,” IEEE Transactions on Information Theory, vol. 51, no. 12, pp. 4203–4215, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  3. E. J. Candes and T. Tao, “Near-optimal signal recovery from random projections: universal encoding strategies?” IEEE Transactions on Information Theory, vol. 52, no. 12, pp. 5406–5425, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  4. D. L. Donoho, “Compressed sensing,” IEEE Transactions on Information Theory, vol. 52, no. 4, pp. 1289–1306, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  5. B. K. Natarajan, “Sparse approximate solutions to linear systems,” SIAM Journal on Computing, vol. 24, no. 2, pp. 227–234, 1995. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  6. D. L. Donoho and X. Huo, “Uncertainty principles and ideal atomic decomposition,” IEEE Transactions on Information Theory, vol. 47, no. 7, pp. 2845–2862, 2001. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  7. M. Elad and A. M. Bruckstein, “A generalized uncertainty principle and sparse representation in pairs of bases,” IEEE Transactions on Information Theory, vol. 48, no. 9, pp. 2558–2567, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  8. R. Gribonval and M. Nielsen, “Sparse representations in unions of bases,” IEEE Transactions on Information Theory, vol. 49, no. 12, pp. 3320–3325, 2003. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  9. E. J. Candès, “The restricted isometry property and its implications for compressed sensing,” Comptes Rendus Mathematique, vol. 346, no. 9-10, pp. 589–592, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  10. S. Foucart and M. J. Lai, “Sparsest solutions of underdetermined linear systems via lq-minimization for 0<q1,” Applied and Computational Harmonic Analysis, vol. 26, pp. 395–407, 2009. View at Google Scholar
  11. T. T. Cai, L. Wang, and G. Xu, “Shifting inequality and recovery of sparse signals,” IEEE Transactions on Signal Processing, vol. 58, no. 3, pp. 1300–1308, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. Q. Mo and S. Li, “New bounds on the restricted isometry constant δ2k,” Applied and Computational Harmonic Analysis, vol. 31, no. 3, pp. 460–468, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. S. Zhou, L. Kong, and N. Xiu, “New bounds for RIC in compressed sensing,” Journal of the Operations Research Society of China, vol. 1, no. 2, pp. 227–237, 2013. View at Publisher · View at Google Scholar · View at Scopus
  14. R. Saab and O. Yilmaz, “Sparse recovery by non-convex optimization-instance optimality,” Applied and Computational Harmonic Analysis, vol. 29, no. 1, pp. 30–48, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. R. Chartrand, “Exact reconstruction of sparse signals via nonconvex minimization,” IEEE Signal Processing Letters, vol. 14, no. 10, pp. 707–710, 2007. View at Publisher · View at Google Scholar · View at Scopus
  16. S. Foucart and H. Rauhut, A Mathematical Introduction to Compressive Sensing, Springer Science+Business Media, New York, NY, USA, 2013. View at Publisher · View at Google Scholar · View at MathSciNet
  17. M. Davies and R. Gribonval, “Restricted isometry constants where lp sparse recovery can fail for 0 < q ≤ 1,” IEEE Transactions on Information Theory, vol. 55, no. 5, pp. 2203–2214, 2009. View at Google Scholar
  18. S. Foucart, A. Pajor, H. Rauhut, and T. Ullrich, “The Gelfand widths of lp-balls for 0<q1,” Journal of Complexity, vol. 26, pp. 629–640, 2010. View at Google Scholar
  19. S. Li and J. H. Lin, “Compressed sensing with coherent tight frames via lq-minimization for 0<q1,” Inverse Problems and Imaging, http://arxiv.org/abs/1105.3299.
  20. Q. Sun, “Recovery of sparsest signals via lq-minimization,” Applied and Computational Harmonic Analysis, vol. 32, pp. 329–341, 2012. View at Google Scholar
  21. J. Peng, S. Yue, and H. Li, “NP/CLP equivalence: a phenomenon hidden among sparsity models for information processing,” http://arxiv.org/abs/1501.02018.
  22. A. Cohen, W. Dahmen, and R. DeVore, “Compressed sensing and best k-term approximation,” Journal of the American Mathematical Society, vol. 22, no. 1, pp. 211–231, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  23. A. Pinkus, On L1-Approximation, Cambridge University Press, Cambridge, UK, 1989.
  24. B. S. Kashin and V. N. Temlyakov, “A remark on compressed sensing,” Mathematical Notes, vol. 82, no. 5-6, pp. 748–755, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  25. M. J. Lai and Y. Liu, “The null space property for sparse recovery from multiple measurement vectors,” Applied and Computational Harmonic Analysis, vol. 30, no. 3, pp. 402–406, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  26. Z. Q. Xu, “Compressed sensing,” Chinese Science: Maths, vol. 42, no. 9, pp. 865–877, 2012. View at Google Scholar
  27. A. Aldroubi, X. Chen, and A. M. Powell, “Perturbations of measurement matrices and dictionaries in compressed sensing,” Applied and Computational Harmonic Analysis, vol. 33, no. 2, pp. 282–291, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  28. M. Elad, P. Milanfar, and R. Rubinstein, “Analysis versus synthesis in signal priors,” Inverse Problems, vol. 23, no. 3, pp. 947–968, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  29. R. Gribonval and M. Nielsen, “Highly sparse representations from dictionaries are unique and independent of the sparseness measure,” Applied and Computational Harmonic Analysis, vol. 22, no. 3, pp. 335–355, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  30. H. Rauhut, K. Schnass, and P. Vandergheynst, “Compressed sensing and redundant dictionaries,” IEEE Transactions on Information Theory, vol. 54, no. 5, pp. 2210–2219, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  31. M. Elad, Sparse and Redundant Representations, From Theory to Applications in Signal and Image Processing, Springer, New York, NY, USA, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  32. E. J. Candès, Y. C. Eldar, D. Needell, and P. Randall, “Compressed sensing with coherent and redundant dictionaries,” Applied and Computational Harmonic Analysis, vol. 31, no. 1, pp. 59–73, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  33. X. Chen, H. Wang, and R. Wang, “A null space analysis of the l1-synthesis method in dictionary-based compressed sensing,” Applied and Computational Harmonic Analysis, vol. 37, pp. 492–515, 2014. View at Google Scholar
  34. Y. Liu, S. Li, T. Mi, H. Lei, and W. Yu, “Performance analysis of l1-synthesis with coherent frames,” in Proceedings of the IEEE International Symposium on Information Theory (ISIT '12), pp. 2042–2046, July 2012. View at Publisher · View at Google Scholar · View at Scopus
  35. Y. Liu, T. Mi, and S. Li, “Compressed sensing with general frames via optimal-dual-based l1-analysis,” IEEE Transactions on Information Theory, vol. 58, no. 7, pp. 4201–4214, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  36. F. Parvaresh, H. Vikalo, S. Misra, and B. Hassibi, “Recovering sparse signals using sparse measurement matrices in compressed DNA microarrays,” IEEE Journal on Selected Topics in Signal Processing, vol. 2, no. 3, pp. 275–285, 2008. View at Publisher · View at Google Scholar · View at Scopus
  37. S. F. Cotter and B. D. Rao, “Sparse channel estimation via matching pursuit with application to equalization,” IEEE Transactions on Communications, vol. 50, no. 3, pp. 374–377, 2002. View at Publisher · View at Google Scholar · View at Scopus
  38. A. Majumdar and R. K. Ward, “Compressed sensing of color images,” Signal Processing, vol. 90, no. 12, pp. 3122–3127, 2010. View at Publisher · View at Google Scholar · View at Scopus
  39. Y. C. Eldar, P. Kuppinger, and H. Bölcskei, “Block-sparse signals: uncertainty relations and efficient recovery,” IEEE Transactions on Signal Processing, vol. 58, no. 6, pp. 3042–3054, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  40. Y. C. Eldar and M. Mishali, “Robust recovery of signals from a structured union of subspaces,” IEEE Transactions on Information Theory, vol. 55, no. 11, pp. 5302–5316, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  41. E. Elhamifar and R. Vidal, “Block-sparse recovery via convex optimization,” IEEE Transactions on Signal Processing, vol. 60, no. 8, pp. 4094–4107, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  42. M. Stojnic, F. Parvaresh, and B. Hassibi, “On the reconstruction of block-sparse signals with an optimal number of measurements,” IEEE Transactions on Signal Processing, vol. 57, no. 8, pp. 3075–3085, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  43. J. H. Lin and S. Li, “Block sparse recovery via mixed l2=lq minimization,” Acta Mathematica Sinica, vol. 29, no. 7, pp. 1401–1412, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  44. J. Huang and T. Zhang, “The benefit of group sparsity,” The Annals of Statistics, vol. 38, no. 4, pp. 1978–2004, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  45. Y. Wang, J. Wang, and Z. B. Xu, “On recovery of block-sparse signals via mixed l2=lq(0<q1) norm minimization,” EURASIP Journal on Advances in Signal Processing, vol. 2013, article 76, 17 pages, 2013. View at Publisher · View at Google Scholar
  46. Y. Wang, J. Wang, and Z. B. Xu, “Restricted p-isometry properties of nonconvex block-sparse compressed sensing,” Signal Processing, vol. 104, pp. 188–196, 2014. View at Publisher · View at Google Scholar · View at Scopus