A fast alternating minimization algorithm for total variation deblurring without boundary artifacts

DOI10.1016/J.JMAA.2014.01.061MaRDI QIDQ2338869zbMATH OpenOpenAlexWikidataFDO

Authors Marco Donatelli, Zheng-Jian Bai, D. Cassani, Stefano Serra Capizzano

Publication date 27 March 2015

Published in Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1308.6754

zbMATH Keywords

total variationimage deblurringvariational methodsreflective and anti-reflective boundary conditions

Mathematics Subject Classification ID

Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Newton-type methods (49M15)

Abstract: Recently, a fast alternating minimization algorithm for total variation image deblurring (FTVd) has been presented by Wang, Yang, Yin, and Zhang [{em SIAM J. Imaging Sci.}, 1 (2008), pp. 248--272]. The method in a nutshell consists of a discrete Fourier transform-based alternating minimization algorithm with periodic boundary conditions and in which two fast Fourier transforms (FFTs) are required per iteration. In this paper, we propose an alternating minimization algorithm for the continuous version of the total variation image deblurring problem. We establish convergence of the proposed continuous alternating minimization algorithm. The continuous setting is very useful to have a unifying representation of the algorithm, independently of the discrete approximation of the deconvolution problem, in particular concerning the strategies for dealing with boundary artifacts. Indeed, an accurate restoration of blurred and noisy images requires a proper treatment of the boundary. A discrete version of our continuous alternating minimization algorithm is obtained following two different strategies: the imposition of appropriate boundary conditions and the enlargement of the domain. The first one is computationally useful in the case of a symmetric blur, while the second one can be efficiently applied for a nonsymmetric blur. Numerical tests show that our algorithm generates higher quality images in comparable running times with respect to the Fast Total Variation deconvolution algorithm.

Recommendations

• A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
• A Fast Total Variation Minimization Method for Image Restoration
• A fast fixed point algorithm for total variation deblurring and segmentation
• Constrained total variation deblurring models and fast algorithms based on alternating direction method of multipliers
• Fast Preconditioners for Total Variation Deblurring with Antireflective Boundary Conditions

Cites work

• scientific article; zbMATH DE number 5819359 (Why is no real title available?)
• scientific article; zbMATH DE number 430432 (Why is no real title available?)
• scientific article; zbMATH DE number 3872359 (Why is no real title available?)
• scientific article; zbMATH DE number 3872795 (Why is no real title available?)
• scientific article; zbMATH DE number 1376935 (Why is no real title available?)
• scientific article; zbMATH DE number 2208228 (Why is no real title available?)
• A Fast Algorithm for Deblurring Models with Neumann Boundary Conditions
• A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
• A Note on Antireflective Boundary Conditions and Fast Deblurring Models
• Accelerated Edge-Preserving Image Restoration Without Boundary Artifacts
• An Augmented Lagrangian Approach to the Constrained Optimization Formulation of Imaging Inverse Problems
• Anti-reflective boundary conditions and re-blurring
• Antireflective boundary conditions for deblurring problems
• Computational Methods for Inverse Problems
• Deconvolving Images With Unknown Boundaries Using the Alternating Direction Method of Multipliers
• Fast Image Recovery Using Variable Splitting and Constrained Optimization
• Fast Preconditioners for Total Variation Deblurring with Antireflective Boundary Conditions
• Fast transforms for high order boundary conditions in deconvolution problems
• Image Processing and Analysis
• Improved image deblurring with anti-reflective boundary conditions and re-blurring
• Isoperimetric estimates for the first eigenvalue of the \(p\)-Laplace operator and the Cheeger constant.
• Numerical Optimization
• On the treatment of boundary artifacts in image restoration by reflection and/or anti-reflection
• Removing Boundary Artifacts for Real-Time Iterated Shrinkage Deconvolution
• Spectral analysis of the anti-reflective algebra
• Synthetic boundary conditions for image deblurring
• The anti-reflective transform and regularization by filtering

Cited in

(10)

• A multigrid frame based method for image deblurring
• A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
• Removing Boundary Artifacts for Real-Time Iterated Shrinkage Deconvolution
• Structure preserving preconditioners for image deblurring
• Regularization preconditioners for frame-based image deblurring with reduced boundary artifacts
• A note on Taylor boundary conditions for accurate image restoration
• Fast Preconditioners for Total Variation Deblurring with Antireflective Boundary Conditions
• A fast fixed point algorithm for total variation deblurring and segmentation
• A Fast Algorithm for Deblurring Models with Neumann Boundary Conditions
• Total variation image restoration method based on subspace optimization

Describes a project that uses

Uses Software

• RecPF

This page was built for publication: A fast alternating minimization algorithm for total variation deblurring without boundary artifacts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2338869)