Table of Contents Author Guidelines Submit a Manuscript
Advances in Multimedia
Volume 2014, Article ID 906464, 11 pages
http://dx.doi.org/10.1155/2014/906464
Research Article

Deblurring by Solving a TVp-Regularized Optimization Problem Using Split Bregman Method

School of Computer Science and Technology, Huaibei Normal University, Huaibei 235000, China

Received 6 October 2014; Revised 28 November 2014; Accepted 1 December 2014; Published 16 December 2014

Academic Editor: Deepu Rajan

Copyright © 2014 Su Xiao. 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. A. N. Tikhonov, A. Goncharsky, V. V. Stepanov, and A. G. Yagola, Numerical Methods for the Solution of Ill-Posed Problems, Kluwer Academic, Dordrecht, The Netherlands, 1995. View at MathSciNet
  2. L. I. Rudin, S. Osher, and E. Fatemi, “Nonlinear total variation based noise removal algorithms,” Physica D: Nonlinear Phenomena, vol. 60, no. 1–4, pp. 259–268, 1992. View at Publisher · View at Google Scholar · View at Scopus
  3. X. Zhang, M. Burger, X. Bresson, and S. Osher, “Bregmanized nonlocal regularization for deconvolution and sparse reconstruction,” SIAM Journal on Imaging Sciences, vol. 3, no. 3, pp. 253–276, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  4. Y.-W. Wen and R. H. Chan, “Parameter selection for total-variation-based image restoration using discrepancy principle,” IEEE Transactions on Image Processing, vol. 21, no. 4, pp. 1770–1781, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  5. T. S. Cho, C. L. Zitnick, N. Joshi, S. B. Kang, R. Szeliski, and W. T. Freeman, “Image restoration by matching gradient distributions,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 34, no. 4, pp. 683–694, 2012. View at Publisher · View at Google Scholar · View at Scopus
  6. M. Nikolova, M. K. Ng, S. Zhang, and W.-K. Ching, “Efficient reconstruction of piecewise constant images using nonsmooth nonconvex minimization,” SIAM Journal on Imaging Sciences, vol. 1, no. 1, pp. 2–25, 2008. View at Publisher · View at Google Scholar · View at MathSciNet
  7. A. Levin, R. Fergus, F. Durand, and W. T. Freeman, “Image and depth from a conventional camera with a coded aperture,” ACM Transactions on Graphics, vol. 26, no. 3, Article ID 1276464, 2007. View at Publisher · View at Google Scholar · View at Scopus
  8. S. Zhuo, D. Guo, and T. Sim, “Robust flash deblurring,” in Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR '10), pp. 2440–2447, San Francisco, Calif, USA, June 2010. View at Publisher · View at Google Scholar · View at Scopus
  9. D. Ge, X. Jiang, and Y. Ye, “A note on the complexity of Lp minimization,” Mathematical Programming, vol. 129, no. 2, pp. 285–299, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  10. A. Danielyan, V. Katkovnik, and K. Egiazarian, “BM3D frames and variational image deblurring,” IEEE Transactions on Image Processing, vol. 21, no. 4, pp. 1715–1728, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  11. D. Goldfarb and S. Ma, “Fast multiple-splitting algorithms for convex optimization,” SIAM Journal on Optimization, vol. 22, no. 2, pp. 533–556, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. L. Xu, S. Zheng, and J. Jia, “Unnatural L0 sparse representation for natural image deblurring,” in Proceedings of the 26th IEEE Conference on Computer Vision and Pattern Recognition (CVPR '13), pp. 1107–1114, Portland, Ore, USA, June 2013. View at Publisher · View at Google Scholar · View at Scopus
  13. T. Goldstein and S. Osher, “The split Bregman method for L1-regularized problems,” SIAM Journal on Imaging Sciences, vol. 2, no. 2, pp. 323–343, 2009. View at Publisher · View at Google Scholar · View at MathSciNet
  14. W. Zuo, D. Meng, L. Zhang, X. Feng, and D. Zhang, “A generalized iterated shrinkage algorithm for non-convex sparse coding,” in Proceedings of the IEEE International Conference on Computer Vision (ICCV '13), pp. 217–224, Sydney, Australia, December 2013. View at Publisher · View at Google Scholar · View at Scopus
  15. W. Yin, “Analysis and generalizations of the linearized Bregman model,” SIAM Journal on Imaging Sciences, vol. 3, no. 4, pp. 856–877, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  16. S. Setzer, “Operator splittings, Bregman methods and frame shrinkage in image processing,” International Journal of Computer Vision, vol. 92, no. 3, pp. 265–280, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  17. A. Beck and M. Teboulle, “Fast gradient-based algorithms for constrained total variation image denoising and deblurring problems,” IEEE Transactions on Image Processing, vol. 18, no. 11, pp. 2419–2434, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  18. C. Chaux, J.-C. Pesquet, and N. Pustelnik, “Nested iterative algorithms for convex constrained image recovery problems,” SIAM Journal on Imaging Sciences, vol. 2, no. 2, pp. 730–762, 2009. View at Publisher · View at Google Scholar · View at MathSciNet
  19. S. Becker, J. Bobin, and E. J. Candès, “NESTA: a fast and accurate first-order method for sparse recovery,” SIAM Journal on Imaging Sciences, vol. 4, no. 1, pp. 1–39, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  20. J. Cai, H. Ji, C. Liu, and Z. Shen, “Blind motion deblurring from a single image using sparse approximation,” in Proceedings of the IEEE International Conference on Computer Vision and Pattern Recognition, pp. 104–111, Miami, Fla, USA, 2009.
  21. S. Setzer, G. Steidl, and T. Teuber, “Deblurring Poissonian images by split Bregman techniques,” Journal of Visual Communication and Image Representation, vol. 21, no. 3, pp. 193–199, 2010. View at Publisher · View at Google Scholar · View at Scopus
  22. S. Osher, Y. Mao, B. Dong, and W. Yin, “Fast linearized Bregman iteration for compressive sensing and sparse denoising,” Communications in Mathematical Sciences, vol. 8, no. 1, pp. 93–111, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  23. E. T. Hale, W. Yin, and Y. Zhang, “Fixed-point continuation for l1-minimization: methodology and convergence,” SIAM Journal on Optimization, vol. 19, no. 3, pp. 1107–1130, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  24. Y. She, “Thresholding-based iterative selection procedures for model selection and shrinkage,” Electronic Journal of Statistics, vol. 3, pp. 384–415, 2009. View at Publisher · View at Google Scholar · View at MathSciNet