Bregmanized nonlocal regularization for deconvolution and sparse reconstruction

SIAM Journal on Imaging Sciences

Volumn 3, Issue 3, 2010, Pages 253-276

  Zhang, Xiaoqun ^a   Burger, Martin ^b   Bresson, Xavier ^a   Osher, Stanley ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF MÜNSTER   (Germany)

Author keywords

Bregman iteration; Nonlocal regularization; Primal dual method

Indexed keywords

ALGORITHM FRAMEWORK; BREGMAN ITERATION; COMPRESSIVE SENSING; CONVEX FUNCTIONALS; MULTISCALE MODELS; NON-LOCAL REGULARIZATION; NONLOCAL; NONLOCAL FUNCTIONALS; NUMERICAL RESULTS; OPERATOR-SPLITTING; OPTIMIZATION METHOD; PRIMAL-DUAL METHODS; PROBLEM REGULARIZATION; REGULARIZATION METHODS; REGULARIZATION TECHNIQUE; SPARSE RECONSTRUCTION; SUB-PROBLEMS; TOTAL VARIATION; TOTAL VARIATION REGULARIZATION;

ALGORITHMS; DECONVOLUTION; IMAGE PROCESSING; INVERSE PROBLEMS; ITERATIVE METHODS; SURFACE MORPHOLOGY;

MATHEMATICAL OPERATORS;

EID: 78149463074     PISSN: None     EISSN: 19364954     Source Type: Journal    
DOI: 10.1137/090746379     Document Type: Article

References (50)

1. M. Aharon, M. Elad, and A. Bruckstein, K-SVD: An algorithm for designing overcomplete dictionariesfor sparse representation, IEEE Trans. Signal Process., 54 (2006), pp. 4311-4322.
2. P. Arias, V. Caselles, and G. Sapiro, A variational framework for non-local image inpainting, inProceedings of the 7th International Conference on Energy Minimization Methods in Computer Visionand Pattern Recognition, Lecture Notes in Comput. Sci. 5681, D. Cremers, Y. Boykov, A. Blake, andF. R. Schmidt, eds., Springer, Berlin, Heidelberg, 2009, pp. 345-358.
3. T. Brox and D. Cremers, Iterated nonlocal means for texture restoration, in Scale Space and VariationalMethods in Computer Vision, Lecture Notes in Comput. Sci. 4485, Springer, Berlin, Heidelberg, 2007,pp. 13-24.
4. A. Buades, B. Coll, and J. M. Morel, A review of image denoising algorithms, with a new one,Multiscale Model. Simul., 4 (2005), pp. 490-530.
5. A. Buades, B. Coll, and J. M. Morel, Image Enhancement by Non-local Reverse Heat Equation,Technical report 22, CMLA, ENS-Cachan, Cachan, France, 2006.
6. M. Burger and S. Osher, A guide to TV Zoo II: Computational methods, in Level Set and PDE-BasedReconstruction Methods, Lecture Notes in Math., Springer, New York, to appear.
7. 1-norm minimization,Math. Comp., 78 (2009), pp. 2127-2136.
8. J.-F. Cai, S. Osher, and Z. Shen, Linearized Bregman iterations for frame-based image deblurring,SIAM J. Imaging Sci., 2 (2009), pp. 226-252.
9. E. J. Candès and D. L. Donoho, Curvelets-a surprisingly effective nonadaptive representation forobjects with edges, in Curves and Surface Fitting: Saint-Malo 1999, Vanderbilt University Press,Nashville, TN, 2000, pp. 105-120.
10. E. J. Candès, J. Romberg, and T. Tao, Robust uncertainty principles: Exact signal reconstructionfrom highly incomplete frequency information, IEEE Trans. Inform. Theory, 52 (2006), pp. 489-509.
11. E. J. Candès and M. Wakin, An introduction to compressive sampling, IEEE Signal Processing Magazine,25 (2) (2008), pp. 21-30.
12. A. Chambolle, An algorithm for total variation minimization and applications, J. Math. Imaging Vision,20 (2004), pp. 89-97.
13. F. R. K. Chung, Spectral Graph Theory, AMS, Providence, RI, 1997.
14. P. L. Combettes and V. R. Wajs, Signal recovery by proximal forward-backward splitting, MultiscaleModel. Simul., 4 (2005), pp. 1168-1200.
15. J. Darbon and M. Sigelle, Exact optimization of discrete constrained total variation minimizationproblems, in Combinatorial Image Analysis, Lecture Notes in Comput. Sci. 3322, Springer, Berlin,2004, pp. 548-557.
16. I. Daubechies, M. Defrise, and C. D. Mol, An iterative thresholding algorithm for linear inverseproblems with a sparsity constraint, Commun. Pure Appl. Math., 57 (2004), pp. 1413-1457.
17. M. N. Do and M. Vetterli, The contourlet transform: An efficient directional multiresolution imagerepresentation, IEEE Trans. Image Process., 14 (2005), pp. 2091-2106.
18. D. L. Donoho, Nonlinear solution of linear inverse problems by wavelet-vaguelette decomposition, Appl.Comput. Harmon. Anal., 2 (1995), pp. 101-126.
19. J. Douglas and H. Rachford, On the numerical solutions of heat conduction problems in two andthree space variables, Trans. Amer. Math. Soc., 1 (1976), pp. 97-116.
20. J. Eckstein and D. P. Bertsekas, On the Douglas-Rachford splitting method and the proximal pointalgorithm for maximal monotone operators, Math. Programming, 55 (1992), pp. 293-318.
21. A. A. Efros and T. K. Leung, Texture synthesis by non-parametric sampling, in Proceedings of theInternational Conference on Computer Vision, Vol. 2, IEEE Computer Society, Washington, DC,1999, pp. 1033-1038.
22. M. Elad, P. Milanfar, and R. Rubinstein, Analysis versus synthesis in signal priors, Inverse Problems,23 (2007), pp. 947-968.
23. A. Elmoataz, O. Lezoray, and S. Bougleux, Nonlocal discrete regularization on weighted graphs: Aframework for image and manifold processing, IEEE Trans. Image Process., 17 (2008), pp. 1047-1060.
24. M. A. T. Figueiredo and R. D. Nowak, An EM algorithm for wavelet-based image restoration, IEEETrans. Image Process., 12 (2003), pp. 906-916.
25. M. A. T. Figueiredo, R. D. Nowak, and S. J. Wright, Gradient projection for sparse reconstruction:Application to compressed sensing and other inverse problems, IEEE J. Sel. Top. Signal Process., 1(2007), pp. 586-598.
26. D. Gabay, Applications of the method of multipliers to variational inequalities, in Augmented LagrangianMethods: Applications to the Numerical Solution of Boundary-Valued Problems, North-Holland,Amsterdam, 1983, pp. 299-331.
27. G. Gilboa and S. Osher, Nonlocal operators with applications to image processing, Multiscale Model.Simul., 7 (2008), pp. 1005-1028.
28. R. Glowinski and P. Le Tallec, Augmented Lagrangian and Operator Splitting Methods in NonlinearMechanics, SIAM Stud. Appl. Math. 9, SIAM, Philadelphia, 1989.
29. D. Goldfarb and W. Yin, Parametric Maximum Flow Algorithms for Fast Total Variation Minimization,CAAM Technical report TR07-09, Rice University, Houston, TX, 2007.
30. T. Goldstein and S. Osher, The split Bregman method for L1-regularized problems, SIAM J. ImagingSci., 2 (2009), pp. 323-343.
31. E. T. Hale, W. Yin, and Y. Zhang, Fixed-point continuation for L1-regularized minimization: Methodologyand convergence, SIAM J. Optim., 19 (2008), pp. 1107-1130.
32. D. S. Hochbaum, An efficient algorithm for image segmentation, Markov random fields and relatedproblems, J. ACM, 48 (2001), pp. 686-701.
33. S. Kindermann, S. Osher, and P. W. Jones, Deblurring and denoising of images by nonlocal functionals,Multiscale Model. Simul., 4 (2005), pp. 1091-1115.
34. C. Lemaréchal and C. Sagastiźabal, Practical aspects of the Moreau-Yosida regularization: Theoreticalpreliminaries, SIAM J. Optim., 7 (1997), pp. 367-385.
35. Y. Lou, X. Zhang, S. Osher, and A. Bertozzi, Image recovery via nonlocal operators, J. Sci. Comput.,42 (2010), pp. 185-197.
36. M. Lustig, S. Boyd, S.-J. Kim, K. Koh, and D. Gorinevsky, An interior-point method for large-scaleL1-regularized least squares, IEEE J. Sel. Top. Signal Process., 1 (2007), pp. 606-617.
37. J.-J. Moreau, Fonctions convexes duales et points proximaux dans un espace hilbertien, C. R. Acad. Sci.Paris, 255 (1962), pp. 2897-2899.
38. S. Osher, M. Burger, D. Goldfarb, J. Xu, and W. Yin, An iterative regularization method for totalvariation-based image restoration, Multiscale Model. Simul., 4 (2005), pp. 460-489.
39. S. Osher, Y. Mao, B. Dong, and W. Yin, Fast linearized Bregman iteration for compressive sensingand sparse denoising, Commun. Math. Sci., 8 (2010), pp. 93-111.
40. G. Peyré, Image processing with nonlocal spectral bases, Multiscale Model. Simul., 7 (2008), pp. 703-730.
41. G. Peyré, S. Bougleux, and L. Cohen, Non-local regularization of inverse problems, in ECCV 2008,Part III, Lecture Notes in Comput. Sci. 5304, Springer, Berlin, Heidelberg, 2008, pp. 57-68.
42. R. Rockafellar, Augmented Lagrangians and applications of the proximal point algorithm in convexprogramming, Math. Oper. Res., 1 (1976), pp. 97-116.
43. J. Romberg, Imaging via compressive sampling, IEEE Signal Processing Magazine, 25 (2) (2008), pp. 14-20.
44. L. I. Rudin, S. Osher, and E. Fatemi, Nonlinear total variation based noise removal algorithms, Phys.D, 60 (1992), pp. 259-268.
45. S. Setzer, Split Bregman algorithm, Douglas-Rachford splitting and frame shrinkage, in Scale Space andVariational Methods in Computer Vision, Lecture Notes in Comput. Sci. 5567, X.-C. Tai, K. Morten,M. Lysaker, and K.-A. Lie, eds., Springer, Berlin, 2009, pp. 464-476.
46. P. Tseng, Applications of a splitting algorithm to decomposition in convex programming and variationalinequalities, SIAM J. Control Optim., 29 (1991), pp. 119-138.
47. W. Yin, Analysis and Generalizations of the Linearized Bregman Method, CAAM report TR09-02, RiceUniversity, Houston, TX, 2008.
48. W. Yin, S. Osher, D. Goldfarb, and J. Darbon, Bregman iterative algorithms for _1-minimizationwith applications to compressed sensing, SIAM J. Imaging Sci., 1 (2008), pp. 143-168.
49. D. Zhou and B. Scḧolkopf, Regularization on discrete spaces, in Pattern Recognition, Proceedings of the 27th DAGM Symposium, Springer, Berlin, 2005, pp. 361-368.
50. W. Zulehner, Analysis of iterative methods for saddle point problems: A unified approach, Math. Comput.,71 (2001), pp. 479-505.