A weighted difference of anisotropic and isotropic total variation model for image processing

SIAM Journal on Imaging Sciences

Volumn 8, Issue 3, 2015, Pages 1798-1823

  Lou, Yifei ^a   Zeng, Tieyong ^b   Osher, Stanley ^c   Xin, Jack ^d  

^a UNIVERSITY OF TEXAS AT DALLAS   (United States)

^b HONG KONG BAPTIST UNIVERSITY   (Hong Kong)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Anisotropic TV; Bregman and split Bregman iterations; Convergence to stationary points; Difference of convex algorithm; Isotropic TV; Stable oscillatory errors; Weighted difference

Indexed keywords

ALGORITHMS; ANISOTROPY; IMAGE DENOISING; IMAGE ENHANCEMENT; ITERATIVE METHODS; MAGNETIC RESONANCE IMAGING; NUMERICAL METHODS;

AND SPLITS; ANISOTROPIC TV; DIFFERENCE OF CONVEX ALGORITHMS; STATIONARY POINTS; WEIGHTED DIFFERENCE;

IMAGE PROCESSING;

EID: 84943549432     PISSN: None     EISSN: 19364954     Source Type: Journal    
DOI: 10.1137/14098435X     Document Type: Article

References (48)

1. L. Bregman, The relaxation method of finding the common points of convex sets and its application to the solution of problems in convex programming, USSR Comp. Math. Math. Phys., 7 (1967), pp. 200–217.
2. X. Cai, R. Chan, and T. Zeng, A two-stage image segmentation method using a convex variant of the Mumford–Shah model and thresholding, SIAM J. Imaging Sci., 6 (2013), pp. 368–390.
3. E. Candes, J. Romberg, and T. Tao, Stable signal recovery from incomplete and inaccurate measurements, Comm. Pure Appl. Math., 59 (2006), pp. 1207–1223.
4. W. Cao, J. Sun, and Z. Xu, Fast image deconvolution using closed-form thresholding formulas of lq(q = 1/2, 2/3) regularization, J. Vis. Commun. Image Represent., 24 (2013), pp. 31–41.
5. A. Chambolle, An algorithm for total variation minimization and applications, J. Math. Imaging Vision, 20 (2004), pp. 89–97.
6. A. Chambolle and P.-L. Lions, Image recovery via total variation minimization and related problems, Numer. Math., 76 (1997), pp. 167–188.
7. T. F. Chan and J. Shen, Image Processing and Analysis: Variational, PDE, Wavelet, and Stochastic Methods, SIAM, Philadelphia, 2005.
8. T. F. Chan and J. Shen, Mathematical models for local nontexture inpainting, SIAM J. Appl. Math., 62 (2002), pp. 1019–1043.
9. T. F. Chan and C. K. Wong, Total variation blind deconvolution, IEEE Trans. Image Process., 7 (1998), pp. 370–375.
10. R. Chartrand, Exact reconstruction of sparse signals via nonconvex minimization, IEEE Trans. Signal Process., 10 (2007), pp. 707–710.
11. Y. Chen, W. W. Hager, M. Yashtini, X. Ye, and H. Zhang, Bregman operator splitting with variable stepsize for total variation image reconstruction, Comput. Optim. Appl., 54 (2013), pp. 317–342.
12. R. Choksi, Y. van Gennip, and A. Oberman, Anisotropic total variation regularized l1-approximation and denoising/deblurring of 2D bar codes, Inverse Probl. Imaging, 3 (2011), pp. 591–617.
13. K. Dabov, A. Foi, and K. Egiazarian, Image restoration by sparse 3D transform-domain collaborative filtering, in Proceedings of SPIE Electronic Imaging, San Jose, CA, 2008, 6812-07.
14. D. L. Donoho, Compressed sensing, IEEE Trans. Inform. Theory, 52 (2006), pp. 1289–1306.
15. S. Esedoḡlu and S. J. Osher, Decomposition of images by the anisotropic Rudin-Osher-Fatemi model, Comm. Pure Appl. Math, 57 (2003), pp. 1609–1626.
16. E. Esser, Y. Lou, and J. Xin, A method for finding structured sparse solutions to nonnegative least squares problems with applications, SIAM J. Imaging Sci., 6 (2013), pp. 2010–2046.
17. D. J. Eyre, An Unconditionally Stable One-Step Scheme for Gradient Systems, manuscript, 1998.
18. S. Geman and D. Geman, Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images, IEEE Trans. Pattern Anal. Machine Intell., 6 (1984), pp. 721–741.
19. T. Goldstein and S. Osher, The split Bregman method for L1-regularized problems, SIAM J. Imaging Sci., 2 (2009), pp. 323–343.
20. A. Hantoute, M. A. López, and C. Zălinescu, Subdifferential calculus rules in convex analysis: A unifying approach via pointwise supremum functions, SIAM J. Optim., 19 (2008), pp. 863–882.
21. L. He, A. Marquina, and S. Osher, Blind deconvolution using TV regularization and Bregman iteration, Internat. J. Imaging Syst. Tech., 15 (2005), pp. 74–83.
22. Q. He and J. Xin, A randomly perturbed INFOMAX algorithm for blind source separation, in Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP), 2013, IEEE, Washington, DC, pp. 3218–3222.
23. N. Hurley and S. Rickard, Comparing measures of sparsity, IEEE Trans. Inform. Theory, 55 (2009), pp. 4723–4741.
24. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, Optimization by simulated annealing, Science, 220 (1983), pp. 671–680.
25. D. Krishnan and R. Fergus, Fast image deconvolution using hyper-Laplacian priors, in Advances in Neural Information Processing Systems (NIPS), Vancouver, Canada, 2009, pp. 1033–1041.
26. D. Krishnan, T. Tay, and R. Fergus, Blind deconvolution using a normalized sparsity measure, in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (Providence, RI), IEEE, Washington, DC, 2011, pp. 233–240.
27. Y. Lou, P. Yin, Q. He, and J. Xin, Computing sparse representation in a highly coherent dictionary based on difference of L1 and L2, J. Sci. Comput., 64 (2015), pp. 178–196.
28. M. Lysaker, S. Osher, and X. C. Tai, Noise removal using smoothed normals and surface fitting, IEEE Trans. Image Process., 13 (2004), pp. 1345–1357.
29. A. Marquina, Nonlinear inverse scale space methods for total variation blind deconvolution, SIAM J. Imaging Sci., 2 (2009), pp. 64–83.
30. A. Marquina and S. Osher, Image super-resolution by TV-regularization and Bregman iteration, J. Sci. Comput., 37 (2008), pp. 367–382.
31. D. Martin, C. Fowlkes, D. Tal, and J. Malik, A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics, in Proceedings of the International Conference on Computer Vision, Vol. 2, 2001, pp. 416–423.
32. D. Mumford and J. Shah, Boundary detection by minimizing functionals, in Proceedings of the IEEE International Conference on Computer Vision and Pattern Recognition (CVPR), Vancouver, Canada, 1985, pp. 137–154.
33. S. Osher, M. Burger, D. Goldfarb, J. Xu, and W. Yin, An iterated regularization method for total variation-based image restoration, Multiscale Model. Simul, 4 (2005), pp. 460–489.
34. J. Portilla, Image restoration through l0 analysis-based sparse optimization in tight frames, in Proceedings of the IEEE International Conference on Image Processing (Cairo, Egypt), IEEE, Washington, DC, 2009, pp. 3909–3912.
35. R. B. Potts, Some generalized order-disorder transformations, Proc. Cambridge Philos. Soc., 48 (1952), pp. 106–109.
36. R. T. Rockafellar and R. J.-B. Wets, Variational Analysis, Grundlehren Math. Wiss. 317, Springer- Verlag, Berlin, 1998.
37. L. Rudin, S. Osher, and E. Fatemi, Nonlinear total variation based noise removal algorithms, Phys. D, 60 (1992), pp. 259–268.
38. S. Setzer, Split Bregman algorithm, Douglas-Rachford splitting and frame shrinkage, in Scale Space and Variational Methods in Computer Vision, Lecture Notes in Comput. Sci. 5567, Springer, Berlin, 2009, pp. 464–476.
39. M. Storath, A. Weinmann, and L. Demaret, Jump-sparse and sparse recovery using Potts functionals, IEEE Trans. Signal Process., 62 (2014), pp. 3654–3666.
40. X. C. Tai and C. Wu, Augmented Lagrangian method, dual methods and split Bregman iteration for ROF model, in Scale Space and Variational Methods in Computer Vision, Lecture Notes in Comput. Sci. 5567, Springer, Berlin, 2009, pp. 502–513.
41. P. Tao and L. T. H. An, A D.C. optimization algorithm for solving the trust-region subproblem, SIAM J. Optim., 8 (1998), pp. 476–505.
42. P. D. Tao and L. T. H. An, Convex analysis approach to d.c. programming: Theory, algorithms and applications, Acta Math. Vietnam., 22 (1997), pp. 289–355.
43. Z. Wang, A. C. Bovik, H. R. Sheikh, and E. P. Simoncelli, Image quality assessment: From error visibility to structural similarity, IEEE Trans. Image Process., 13 (2004), pp. 600–612.
44. C. Wu and X. C. Tai, Augmented Lagrangian method, dual methods, and split Bregman iteration for ROF, vectorial TV, and high order models, SIAM J. Imaging Sci., 3 (2010), pp. 300–339.
45. L. Xu, C. Lu, Y. Xu, and J. Jia, Image smoothing via L0 gradient minimization, in Proceedings of the 2011 SIGGRAPH Asia Conference, ACM Trans. Graphics, 30 (2011), 174.
46. Z. Xu, X. Chang, F. Xu, and H. Zhang, L1/2 regularization: A thresholding representation theory and a fast solver, IEEE Trans. Neural Networks, 23 (2012), pp. 1013–1027.
47. P. Yin, E. Esser, and J. Xin, Ratio and difference of L1 and L2 norms and sparse representation with coherent dictionaries, Commun. Inf. Syst., 14 (2014), pp. 87–109.
48. P. Yin, Y. Lou, Q. He, and J. Xin, Minimization of ℓ1−2 for compressed sensing, SIAM J. Sci. Comput., 37 (2015), pp. A536–A563.