A proximal decomposition method for solving convex variational inverse problems

Inverse Problems

Volumn 24, Issue 6, 2008, Pages

  Combettes, Patrick L ^a   Pesquet, Jean Christophe ^b  

^a SORBONNE UNIVERSITÉ   (France)

^b UNIVERSITÉ PARIS EST   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; DIFFERENTIAL EQUATIONS; IMAGE PROCESSING; QUEUEING NETWORKS;

ARBITRARY NUMBERS; CONVEX FUNCTIONS; DECOMPOSITION ALGORITHMS; DECOMPOSITION METHODS; NON-SMOOTH FUNCTIONS; NUMERICAL APPLICATIONS; PROXIMITY OPERATORS; SIGNAL AND IMAGE PROCESSING; WEAK CONVERGENCES;

INVERSE PROBLEMS;

EID: 62649171652     PISSN: 02665611     EISSN: 13616420     Source Type: Journal    
DOI: 10.1088/0266-5611/24/6/065014     Document Type: Article

References (52)

1. Andrews H C and Hunt B R 1977 Digital Image Restoration (Englewood Cliffs, NJ: Prentice-Hall)
2. Artzy E, Elfving T and Herman G T 1979 Quadratic optimization for image reconstruction II Comput. Graph. Image Process. 11 242-61
3. Bauschke H H and Borwein J M 1993 On the convergence of von Neumann's alternating projection algorithm for two sets Set-Valued Anal. 1 185-212
4. Bauschke H H and Borwein J M 1996 On projection algorithms for solving convex feasibility problems SIAM Rev. 38 367-426
5. 1 unified variational framework for image restoration Proc. Eighth Europ. Conf. Comput. Vision (Prague 2004) (Lecture Notes in Comput. Sci. 3024) ed T Pajdla and J Matas (New York: Springer) pp 1-13
6. Bioucas-Dias J M and Figueiredo M A 2007 A new TwIST: two-step iterative shrinkage/thresholding algorithms for image restoration IEEE Trans. Image Process. 16 2992-3004
7. Boyle J P and Dykstra R L 1986 A method for finding projections onto the intersection of convex sets in Hilbert spaces Lecture Notes Stat. 37 28-47
8. Bredies K and Lorenz D A 2008 Iterated hard shrinkage for minimization problems with sparsity constraints SIAM J. Sci. Comput. 30 657-83
9. Bredies K and Lorenz D A Linear convergence of iterative soft-thresholding J. Fourier Anal. Appl. at press
10. Byrne C L 2005 Signal Processing - A Mathematical Approach (A K Peters: Wellesley, MA)
11. Byrne C L and Censor Y 2001 Proximity function minimization using multiple Bregman projections, with applications to split feasibility and Kullback-Leibler distance minimization Ann. Oper. Res. 105 77-98
12. Censor Y 1984 Iterative methods for the convex feasibility problem Ann. Discrete Math. 20 83-91
13. Censor Y, Bortfeld T, Martin B and Tromov A 2006 A unified approach for inversion problems in intensity-modulated radiation therapy Phys. Med. Biol. 51 2353-65
14. Chambolle A, DeVore R A, Lee N Y and Lucier B J 1998 Nonlinear wavelet image processing: Variational problems, compression, and noise removal through wavelet shrinkage IEEE Trans. Image Process. 7 319-35
15. Chambolle A and Lions P-L 1997 Image recovery via total variation minimization and related problems Numer. Math. 76 167-88
16. Chaux C, Combettes P L, Pesquet J-C and Wajs V R 2007 A variational formulation for frame-based inverse problems Inverse Problems 23 1495-518
17. Combettes P L 1994 Inconsistent signal feasibility problems: least-squares solutions in a product space IEEE Trans. Signal Process. 42 2955-66
18. Combettes P L 1996 The convex feasibility problem in image recovery Advances in Imaging and Electron Physics vol 95 ed P Hawkes (New York: Academic) pp 155-270
19. Combettes P L 1997 Convex set theoretic image recovery by extrapolated iterations of parallel subgradient projections IEEE Trans. Image Process. 6 493-506
20. Combettes P L 2000 Strong convergence of block-iterative outer approximation methods for convex optimization SIAM J. Control Optim. 38 538-65
21. Combettes P L 2003 A block-iterative surrogate constraint splitting method for quadratic signal recovery IEEE Trans. Signal Process. 51 1771-82
22. Combettes P L 2004 Solving monotone inclusions via compositions of nonexpansive averaged operators Optimization 53 475-504
23. Combettes P L and Bondon P 1999 Hard-constrained inconsistent signal feasibility problems IEEE Trans. Signal Process. 47 2460-68
24. Combettes P L and Pesquet J-C 2007 Proximal thresholding algorithm for minimization over orthonormal bases SIAM J. Optim. 18 1351-76
25. Combettes P L and Pesquet J-C 2007 A Douglas-rachford splitting approach to nonsmooth convex variational signal recovery IEEE J. Selected Topics Signal Process. 1 564-74
26. Combettes P L and Wajs V R 2005 Signal recovery by proximal forward-backward splitting Multiscale Model. Simul. 4 1168-200
27. Daubechies I 1992 Ten Lectures on Wavelets SIAM (Philadelphia, PA: SIAM)
28. Daubechies I, Defrise M and Mol C De 2004 An iterative thresholding algorithm for linear inverse problems with a sparsity constraint Comm. Pure Appl. Math. 57 1413-57
29. Daubechies I, Teschke G and Vese L 2007 Iteratively solving linear inverse problems under general convex constraints Inverse Problems and Imaging 1 29-46
30. Deutsch F 2001 Best Approximation in Inner Product Spaces (New York: Springer)
31. Ekeland I and Temam R 1974 Analyse Convexe et Problèmes Variationnels (Paris: Dunod)
32. Ekeland I and Temam R 1999 Convex Analysis and Variational Problems SIAM (Philadelphia, PA: SIAM)
33. Fornasier M 2007 Domain decomposition methods for linear inverse problems with sparsity constraints Inverse Problems 23 2505-26
34. Gaffke N and Mathar R 1989 A cyclic projection algorithm via duality Metrika 36 29-54
35. Hirstoaga S A 2006 Iterative selection methods for common fixed point problems J. Math. Anal. Appl. 324 1020-35
36. Jain A K 1989 Fundamentals of Digital Image Processing (London: Prentice-Hall)
37. Kiwiel K C and Łopuch B 1997 Surrogate projection methods for finding fixed points of firmly inonexpansive mappings SIAM J. Optim. 7 1084-102
38. Levi A and Stark H 1983 Signal reconstruction from phase by projection onto convex sets J. Opt. Soc. Amer. 73 810-22
39. Lions P-L and Mercier B 1979 Splitting algorithms for the sum of two nonlinear operators SIAM J. Numer. Anal. 16 964-79
40. Moreau J-J 1965 Proximité et dualité dans un espace hilbertien Bull. Soc. Math. France 93 273-99
41. Nobakht R A and Civanlar M R 1995 Optimal pulse shape design for digital communication systems by projections onto convex sets IEEE Trans. Commun. 43 2874-77
42. Pesquet J-C, Krim H and Carfantan H 1996 Time-invariant orthonormal wavelet representations IEEE Trans. Signal Process 44 1964-70
43. Porat M and Shachor G 1999 Signal representation in the combined phase-spatial space: Reconstruction and criteria for uniqueness IEEE Trans. Signal Process. 47 1701-07
44. Rockafellar R T 1970 Convex Analysis (Princeton, NJ: Princeton University Press)
45. Rudin L I, Osher S and Fatemi E 1992 Nonlinear total variation based noise removal algorithms Physica D 60 259-68
46. Spingarn J E 1985 Applications of the method of partial inverses to convex programming: Decomposition Math. Programming 32 199-223
47. Stark H (ed) 1987 Image Recovery: Theory and Application (San Diego, CA: Academic)
48. Strong D and Chan T 2003 Edge-preserving and scale-dependent properties of total variation regularization Inverse Problems 19 pp S165-S187
49. Tropp J A 2006 Just relax: Convex programming methods for identifying sparse signals in noise IEEE Trans. Inform. Theory 52 1030-51
50. Yamada I, Ogura N, Yamashita Y and Sakaniwa K 1998 Quadratic optimization of fixed points of nonexpansive mappings in Hilbert space Numer. Funct. Anal. Optim. 19 165-90
51. Youla D C and Webb H 1982 Image restoration by the method of convex projections: part 1-theory IEEE Trans. Medical Imaging 1 81-94
52. Zlinescu C 2002 Convex Analysis in General Vector Spaces (River Edge, NJ: World Scientific)