Continuous Primal-Dual Methods for Image Processing
نویسنده
چکیده
In this article we study a continuous Primal-Dual method proposed by Appleton and Talbot and generalize it to other problems in image processing. We interpret it as an Arrow-Hurwicz method which leads to a better description of the system of PDEs obtained. We show existence and uniqueness of solutions and get a convergence result for the denoising problem. Our analysis also yields new a posteriori estimates. Acknowledgements. I would like to warmly thank my PhD advisor Antonin Chambolle for suggesting me this problem and for our fruitful discussions. This research was partially supported by ANR project MICA (20062009).
منابع مشابه
A primal-dual splitting algorithm for finding zeros of sums of maximally monotone operators
We consider the primal problem of finding the zeros of the sum of a maximally monotone operator with the composition of another maximally monotone operator with a linear continuous operator and a corresponding dual problem formulated by means of the inverse operators. A primal-dual splitting algorithm which simultaneously solves the two problems in finite-dimensional spaces is presented. The sc...
متن کاملAn Efficient Primal-Dual Hybrid Gradient Algorithm For Total Variation Image Restoration
We propose a simple yet efficient algorithm for total variation (TV) minimizations with applications in the image processing realm. This descent-type algorithm alternates between the primal and dual formulations and exploit the information from both the primal and dual variables. It converges significantly faster than some popular existing methods as demonstrated in our experiments. This approa...
متن کاملLocal Linear Convergence Analysis of Primal–Dual Splitting Methods
In this paper, we study the local linear convergence properties of a versatile class of Primal–Dual splitting methods for minimizing composite non-smooth convex optimization problems. Under the assumption that the non-smooth components of the problem are partly smooth relative to smooth manifolds, we present a unified local convergence analysis framework for these Primal–Dual splitting methods....
متن کاملA Primal-Dual Splitting Algorithm for Finding Zeros of Sums of Maximal Monotone Operators
We consider the primal problem of finding the zeros of the sum of a maximal monotone operator and the composition of another maximal monotone operator with a linear continuous operator. By formulating its Attouch-Théra-type dual inclusion problem, a primal-dual splitting algorithm which simultaneously solves the two problems in finitedimensional spaces is presented. The proposed scheme uses at ...
متن کاملPrimal-dual path-following algorithms for circular programming
Circular programming problems are a new class of convex optimization problems that include second-order cone programming problems as a special case. Alizadeh and Goldfarb [Math. Program. Ser. A 95 (2003) 3-51] introduced primal-dual path-following algorithms for solving second-order cone programming problems. In this paper, we generalize their work by using the machinery of Euclidean Jordan alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Imaging Sciences
دوره 4 شماره
صفحات -
تاریخ انتشار 2011