Accelerated Non-Overlapping Domain Decomposition Method For Total Variation Minimization

We concern with fast domain decomposition methods for solving the total variation minimization problems in image processing. By decomposing the image domain into non-overlapping subdomains and interfaces, we consider the primal-dual problem on the interfaces such that the subdomain problems become independent problems and can be solved in parallel. Suppose both the interfaces and subdomain problems are uniformly convex, we can apply the acceleration method to achieve an O(1/n(2)) convergent domain decomposition algorithm. The convergence analysis is provided as well. Numerical results on image denoising, inpainting, deblurring, and segmentation are provided and comparison results with existing methods are discussed, which not only demonstrate the advantages of our method but also support the theoretical convergence rate.