Domain Decomposition Methods for Total Variation Minimization

In this paper, overlapping domain decomposition methods (DDMs) are used for solving the Rudin-Osher-Fatemi (ROF) model in image restoration. It is known that this problem is nonlinear and the minimization functional is non-strictly convex and non-differentiable. Therefore, it is difficult to analyze the convergence rate for this problem. In this work, we use the dual formulation of the ROF model in connection with proper subspace correction. With this approach, we overcome the problems caused by the non-strict-convexity and non-differentiability of the ROF model. However, the dual problem has a global constraint for the dual variable which is difficult to handle for subspace correction methods. We propose a stable unit decomposition, which allows us to construct the successive subspace correction method (SSC) and parallel subspace correction method (PSC) based domain decomposition. Numerical experiments are supplied to demonstrate the efficiency of our proposed methods.

[1]  B. V. Dean,et al.  Studies in Linear and Non-Linear Programming. , 1959 .

[2]  R. Glowinski,et al.  Augmented Lagrangian and Operator-Splitting Methods in Nonlinear Mechanics , 1987 .

[3]  C. Vogel.  Computational Methods for Inverse Problems , 1987 .

[4]  Jacques Periaux,et al.  On Domain Decomposition Methods , 1988 .

[5]  L. Rudin,et al.  Nonlinear total variation based noise removal algorithms , 1992 .

[6]  C. Vogel,et al.  Analysis of bounded variation penalty methods for ill-posed problems , 1994 .

[7]  C. Vogel.  A Multigrid Method for Total Variation-Based Image Denoising , 1995 .

[8]  Curtis R. Vogel,et al.  Iterative Methods for Total Variation Denoising , 1996, SIAM J. Sci. Comput..

[9]  Xuecheng Tai,et al.  Applications of a space decomposition method to linear and nonlinear elliptic problems , 1998 .

[10]  Xuecheng Tai,et al.  Rate of Convergence of Some Space Decomposition Methods for Linear and Nonlinear Problems , 1998 .

[11]  Curtis R. Vogel,et al.  Ieee Transactions on Image Processing Fast, Robust Total Variation{based Reconstruction of Noisy, Blurred Images , 2022 .

[12]  Stanley Osher,et al.  Explicit Algorithms for a New Time Dependent Model Based on Level Set Motion for Nonlinear Deblurring and Noise Removal , 2000, SIAM J. Sci. Comput..

[13]  Jinchao Xu,et al.  Global and uniform convergence of subspace correction methods for some convex optimization problems , 2002, Math. Comput..

[14]  Xue-Cheng Tai,et al.  Rate of Convergence for some constraint decomposition methods for nonlinear variational inequalities , 2003, Numerische Mathematik.

[15]  Karl Kunisch,et al.  Total Bounded Variation Regularization as a Bilaterally Constrained Optimization Problem , 2004, SIAM J. Appl. Math..

[16]  Michael Hintermüller,et al.  A Second Order Shape Optimization Approach for Image Segmentation , 2004, SIAM J. Appl. Math..

[17]  M. Nikolova.  An Algorithm for Total Variation Minimization and Applications , 2004 .

[18]  Andrea Toselli,et al.  Domain decomposition methods : algorithms and theory , 2005 .

[19]  Hugues Talbot,et al.  Globally Optimal Geodesic Active Contours , 2005, Journal of Mathematical Imaging and Vision.

[20]  S. Lui,et al.  Domain decomposition methods in image denoising using Gaussian curvature , 2006 .

[21]  Yin Zhang,et al.  A Fast Algorithm for Image Deblurring with Total Variation Regularization , 2007 .

[22]  Ke Chen,et al.  A Nonlinear Multigrid Method for Total Variation Minimization from Image Restoration , 2007, J. Sci. Comput..

[23]  Michael K. Ng,et al.  On Semismooth Newton’s Methods for Total Variation Minimization , 2007, Journal of Mathematical Imaging and Vision.

[24]  Junfeng Yang,et al.  A New Alternating Minimization Algorithm for Total Variation Image Reconstruction , 2008, SIAM J. Imaging Sci..

[25]  Tom Goldstein,et al.  The Split Bregman Method for L1-Regularized Problems , 2009, SIAM J. Imaging Sci..

[26]  Carola-Bibiane Schönlieb,et al.  Subspace Correction Methods for Total Variation and 1-Minimization , 2007, SIAM J. Numer. Anal..

[27]  Massimo Fornasier,et al.  Domain decomposition methods for compressed sensing , 2009, 0902.0124.

[28]  Yiqiu Dong,et al.  An Efficient Primal-Dual Method for L1TV Image Restoration , 2009, SIAM J. Imaging Sci..

[29]  Carola-Bibiane Schönlieb,et al.  A convergent overlapping domain decomposition method for total variation minimization , 2009, Numerische Mathematik.

[30]  Antonin Chambolle,et al.  A First-Order Primal-Dual Algorithm for Convex Problems with Applications to Imaging , 2011, Journal of Mathematical Imaging and Vision.

[31]  Xue-Cheng Tai,et al.  Augmented Lagrangian Method, Dual Methods, and Split Bregman Iteration for ROF, Vectorial TV, and High Order Models , 2010, SIAM J. Imaging Sci..

[32]  Xuecheng Tai,et al.  A two-level domain decomposition method for image restoration , 2010 .

[33]  O. Scherzer.  Handbook of mathematical methods in imaging , 2011 .

[34]  Xue-Cheng Tai,et al.  Domain decomposition methods with graph cuts algorithms for total variation minimization , 2012, Adv. Comput. Math..

[35]  Michael Hintermüller,et al.  Subspace Correction Methods for a Class of Nonsmooth and Nonadditive Convex Variational Problems with Mixed L1/L2 Data-Fidelity in Image Processing , 2013, SIAM J. Imaging Sci..

[36]  Jing Qin,et al.  Domain decomposition method for image deblurring , 2014, J. Comput. Appl. Math..

[37]  Danping Yang,et al.  Domain Decomposition Methods for Nonlocal Total Variation Image Restoration , 2014, J. Sci. Comput..

[38]  Michael Hintermüller,et al.  Non-Overlapping Domain Decomposition Methods For Dual Total Variation Based Image Denoising , 2014, Journal of Scientific Computing.