Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2013 (2013), Article ID 959403, 6 pages
http://dx.doi.org/10.1155/2013/959403
Research Article

Restricted Isometry Property of Principal Component Pursuit with Reduced Linear Measurements

1School of Computer Science, Civil Aviation Flight University of China, GuangHan, Sichuan 618307, China
2School of Electronic Engineering, University of Electronic Science and Technology of China, Chengdu, Sichuan 611731, China

Received 25 September 2012; Revised 2 April 2013; Accepted 30 April 2013

Academic Editor: Xiaojun Wang

Copyright © 2013 Qingshan You 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. J. Ellenberg, “Fill in the blanks: using math to turn lo-res datasets into hi-ressamples,” http://www.wired.com/magazine/2010/02/ff_algorithm/.
  2. A. Chambolle and P.-L. Lions, “Image recovery via total variation minimization and related problems,” Numerische Mathematik, vol. 76, no. 2, pp. 167–188, 1997. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  3. J. F. Claerbout and F. Muir, “Robust modeling of erratic data,” Geophysics, vol. 38, pp. 826–844, 1973. View at Publisher · View at Google Scholar
  4. B. Zeng and J. Fu, “Directional discrete cosine transforms—a new framework for image coding,” IEEE Transactions on Circuits and Systems for Video Technology, vol. 18, no. 3, pp. 305–313, 2008. View at Publisher · View at Google Scholar · View at Scopus
  5. M. Elad and M. Aharon, “Image denoising via sparse and redundant representations over learned dictionaries,” IEEE Transactions on Image Processing, vol. 15, no. 12, pp. 3736–3745, 2006. View at Publisher · View at Google Scholar · View at MathSciNet
  6. H. Ji, C. Q. Liu, Z. W. Shen, and Y. Xu, “Robust video denoising using Low rank matrix completion,” in Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR '10), pp. 1791–1798, June 2010. View at Publisher · View at Google Scholar · View at Scopus
  7. E. J. Candès and B. Recht, “Exact matrix completion via convex optimization,” Foundations of Computational Mathematics, vol. 9, no. 6, pp. 717–772, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  8. E. J. Candès, X. Li, Y. Ma, and J. Wright, “Robust principal component analysis?” Journal of the ACM, vol. 58, no. 3, article 11, 2011. View at Publisher · View at Google Scholar · View at MathSciNet
  9. Z. Zhou, X. Li, J. Wright, E. Candès, and Y. Ma, “Stable principal component pursuit,” in Proceedings of the IEEE International Symposium on Information Theory (ISIT '10), pp. 1518–1522, June 2010. View at Publisher · View at Google Scholar · View at Scopus
  10. A. Ganesh, K. Min, J. Wright, and Y. Ma, “Principal component pursuit with reduced linear measurements,” IEEE International Symposium on Information Theory Proceedings, pp. 1281–1285, 2012. View at Google Scholar
  11. J. Wright, A. Ganesh, K. Min, and Y. Ma, “Compressive principal component pursuit,” IEEE International Symposium on Information Theory Proceedings, pp. 1276–1280, 2012. View at Google Scholar
  12. H. Zhang, J.-F. Cai, L. Cheng, and J. Zhu, “Strongly convex programming for exact matrix completion and robust principal component analysis,” Inverse Problems and Imaging, vol. 6, no. 2, pp. 357–372, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  13. B. Recht, M. Fazel, and P. A. Parrilo, “Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization,” SIAM Review, vol. 52, no. 3, pp. 471–501, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  14. Q. S. You, Q. Wan, and Y. P. Liu, “A short note on strongly convex programming for exact matrix completion and robust principal component analysis,” Inverse Problems and Imaging, vol. 7, no. 1, pp. 305–306, 2013. View at Publisher · View at Google Scholar
  15. Q. S. You and Q. Wan, “Strongly convex programming for principal component pursuit,” http://arxiv.org/abs/1209.4405. View at Publisher · View at Google Scholar
  16. R. Meka, P. Jain Inderjit, and S. Dhillon, “Guaranteed rank minimization via singular value projection,” in Neural Information Processing Systems, 2010. View at Google Scholar
  17. L. Mackey, M. I. Jordan, R. Y. Chen, B. Farrell, and J. A. Tropp, “Matrix concentration inequalities via the method of exchangeable Pairs,” http://arxiv.org/abs/1201.6002.
  18. B. Laurent and P. Massart, “Adaptive estimation of a quadratic functional by model selection,” The Annals of Statistics, vol. 28, no. 5, pp. 1302–1338, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet