Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2014, Article ID 937560, 17 pages
http://dx.doi.org/10.1155/2014/937560
Research Article

Truncated Nuclear Norm Minimization for Image Restoration Based on Iterative Support Detection

School of Mathematical Sciences, University of Electronic Science and Technology of China, Chengdu 611731, China

Received 20 June 2014; Accepted 21 August 2014; Published 17 November 2014

Academic Editor: Chien-Yu Lu

Copyright © 2014 Yilun Wang and Xinhua Su. 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. Abernethy, F. Bach, T. Evgeniou, and J.-P. Vert, “Low-rank matrix factorization with attributes,” Tech. Rep. N-24/06/MM, 2006. View at Google Scholar
  2. Y. Amit, M. Fink, N. Srebro, and S. Ullman, “Uncovering shared structures in multiclass classification,” in Proceedings of the 24th International Conference on Machine Learning (ICML '07), pp. 17–24, June 2007. View at Publisher · View at Google Scholar · View at Scopus
  3. A. Evgeniou and M. Pontil, “Multi-task feature learning,” in Proceedings of the Conference on Advances in Neural Information Processing Systems, vol. 19, p. 41, The MIT Press, 2007.
  4. C. Tomasi and T. Kanade, “Shape and motion from image streams under orthography: a factorization method,” International Journal of Computer Vision, vol. 9, no. 2, pp. 137–154, 1992. View at Publisher · View at Google Scholar · View at Scopus
  5. M. Mesbahi, “On the rank minimization problem and its control applications,” Systems and Control Letters, vol. 33, no. 1, pp. 31–36, 1998. View at Publisher · View at Google Scholar · View at Scopus
  6. M. Fazel, H. Hindi, and S. P. Boyd, “Log-det heuristic for matrix rank minimization with applications to hankel and euclidean distance matrices,” in Proceedings of the American Control Conference, vol. 3, pp. 2156–2162, IEEE, June 2003. View at Scopus
  7. 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 · View at Scopus
  8. 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 MathSciNet · View at Scopus
  9. E. J. Candes and T. Tao, “The power of convex relaxation: near-optimal matrix completion,” IEEE Transactions on Information Theory, vol. 56, no. 5, pp. 2053–2080, 2010. View at Publisher · View at Google Scholar · View at MathSciNet
  10. J. Wright, Y. Peng, Y. Ma, A. Ganesh, and S. Rao, “Robust principal component analysis: exact recovery of corrupted low-rank matrices by convex optimization,” in Proceedings of the 23rd Annual Conference on Neural Information Processing Systems (NIPS '09), pp. 2080–2088, Vancouver, Canada, December 2009. View at Scopus
  11. K.-C. Toh and S. Yun, “An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems,” Pacific Journal of Optimization, vol. 6, no. 3, pp. 615–640, 2010. View at Google Scholar · View at MathSciNet · View at Scopus
  12. J.-F. Cai, R. Chan, L. Shen, and Z. Shen, “Restoration of chopped and nodded images by framelets,” SIAM Journal on Scientific Computing, vol. 30, no. 3, pp. 1205–1227, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  13. J.-F. Cai, E. J. Candès, and Z. Shen, “A singular value thresholding algorithm for matrix completion,” SIAM Journal on Optimization, vol. 20, no. 4, pp. 1956–1982, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. Y. Hu, D. Zhang, J. Ye, X. Li, and X. He, “Fast and accurate matrix completion via truncated nuclear norm regularization,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 35, no. 9, pp. 2117–2130, 2013. View at Publisher · View at Google Scholar · View at Scopus
  15. Y. Wang and W. Yin, “Sparse signal reconstruction via iterative support detection,” SIAM Journal on Imaging Sciences, vol. 3, no. 3, pp. 462–491, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  16. M. Fazel, H. Hindi, and S. P. Boyd, “A rank minimization heuristic with application to minimum order system approximation,” in Proceedings of the American Control Conference (ACC '01), vol. 6, pp. 4734–4739, June 2001. View at Scopus
  17. N. Srebro, J. D. M. Rennie, and T. S. Jaakkola, “Maximum-margin matrix factorization,” in Proceedings of the 18th Annual Conference on Neural Information Processing Systems (NIPS '04), pp. 1329–3136, December 2004. View at Scopus
  18. X. Yuan and J. Yang, “Sparse and low-rank matrix decomposition via alternating direction methods,” Tech. Rep., Nanjing University, Nanjing, China, 2009, http://math.nju.edu.cn/~jfyang/files/LRSD-09.pdf. View at Google Scholar
  19. J. F. Sturm, “Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones,” Optimization Methods and Software, vol. 11-12, no. 1–4, pp. 625–653, 1999. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  20. S. Ji and J. Ye, “An accelerated gradient method for trace norm minimization,” in Proceedings of the 26th International Conference On Machine Learning (ICML '09), pp. 457–464, ACM, June 2009. View at Scopus
  21. T. K. Pong, P. Tseng, S. Ji, and J. Ye, “Trace norm regularization: reformulations, algorithms, and multi-task learning,” SIAM Journal on Optimization, vol. 20, no. 6, pp. 3465–3489, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  22. Z. Wen, D. Goldfarb, and W. Yin, “Alternating direction augmented Lagrangian methods for semidefinite programming,” Mathematical Programming Computation, vol. 2, no. 3-4, pp. 203–230, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  23. M. R. Hestenes, “Multiplier and gradient methods,” Journal of Optimization Theory and Applications, vol. 4, no. 5, pp. 303–320, 1969. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  24. M. J. Powell, “A method for nonlinear constraints in minimization problems,” in Optimization, R. Fletcher, Ed., pp. 283–298, Academic Press, New York, NY, USA, 1969. View at Google Scholar · View at MathSciNet
  25. D. Gabay and B. Mercier, “A dual algorithm for the solution of nonlinear variational problems via finite element approximation,” Computers & Mathematics with Applications, vol. 2, no. 1, pp. 17–40, 1976. View at Publisher · View at Google Scholar · View at Scopus
  26. J. Yang and X. Yuan, “Linearized augmented lagrangian and alternating direction methods for nuclear norm minimization,” Mathematics of Computation, vol. 82, no. 281, pp. 301–329, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  27. R. Glowinski and P. Le Tallec, Augmented Lagrangian and Operator-Splitting Methods in Nonlinear Mechanics, vol. 9 of Studies in Applied and Numerical Mathematics, SIAM, 1989.
  28. R. Glowinski, Lectures on Numerical Methods for Non-Linear Variational Problems, Springer, 2008.
  29. C. Chen, B. He, and X. Yuan, “Matrix completion via an alternating direction method,” IMA Journal of Numerical Analysis, vol. 32, no. 1, pp. 227–245, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  30. S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein, “Distributed optimization and statistical learning via the alternating direction method of multipliers,” Foundations and Trends in Machine Learning, vol. 3, no. 1, pp. 1–122, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  31. A. Argyriou, T. Evgeniou, and M. Pontil, “Convex multi-task feature learning,” Machine Learning, vol. 73, no. 3, pp. 243–272, 2008. View at Publisher · View at Google Scholar · View at Scopus
  32. J. Abernethy, F. Bach, T. Evgeniou, and J.-P. Vert, “A new approach to collaborative filtering: operator estimation with spectral regularization,” Journal of Machine Learning Research, vol. 10, pp. 803–826, 2009. View at Google Scholar · View at Scopus
  33. G. Obozinski, B. Taskar, and M. I. Jordan, “Joint covariate selection and joint subspace selection for multiple classification problems,” Statistics and Computing, vol. 20, no. 2, pp. 231–252, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  34. Y. Nesterov, “Gradient methods for minimizing composite objective function,” ECORE Discussion Papers 2007076, 2007. View at Google Scholar
  35. A. Beck and M. Teboulle, “A fast iterative shrinkage-thresholding algorithm for linear inverse problems,” SIAM Journal on Imaging Sciences, vol. 2, no. 1, pp. 183–202, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  36. Y. Nesterov, “A method of solving a convex programming problem with convergence rate O(1/k2),” Soviet Mathematics Doklady, vol. 27, pp. 372–376, 1983. View at Google Scholar
  37. B. He, M. Tao, and X. Yuan, “Alternating direction method with gaussian back substitution for separable convex programming,” SIAM Journal on Optimization, vol. 22, no. 2, pp. 313–340, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  38. Z. Lin, R. Liu, and Z. Su, “Linearized alternating direction method with adaptive penalty for low-rank representation,” in Proceedings of the Advances in Neural Information Processing Systems (NIPS '11), pp. 612–620, 2011.
  39. B. S. He, H. Yang, and S. L. Wang, “Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities,” Journal of Optimization Theory and Applications, vol. 106, no. 2, pp. 337–356, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  40. A. K. Yasakov, “Method for detection of jump-like change points in optical data using approximations with distribution functions,” in Ocean Optics XII, Proceedings of SPIE, pp. 605–612, Bergen, Norway, 1994. View at Publisher · View at Google Scholar
  41. J.-H. Jung and V. R. Durante, “An iterative adaptive multiquadric radial basis function method for the detection of local jump discontinuities,” Applied Numerical Mathematics, vol. 59, no. 7, pp. 1449–1466, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus