A General Framework for Fast Image Deconvolution with Incomplete Observations. Applications to Unknown Boundaries, Inpainting, Superresolution, and Demosaicing

In image deconvolution problems, the diagonalization of the underlying operators by means of the FFT usually yields very large speedups. When there are incomplete observations (e.g., in the case of unknown boundaries), standard deconvolution techniques normally involve non-diagonalizable operators---resulting in rather slow methods---or, otherwise, use inexact convolution models, resulting in the occurrence of artifacts in the enhanced images. In this paper, we propose a new deconvolution framework for images with incomplete observations that allows us to work with diagonalized convolution operators, and therefore is very fast. We iteratively alternate the estimation of the unknown pixels and of the deconvolved image, using, e.g., a FFT-based deconvolution method. In principle, any fast deconvolution method can be used. We give an example in which a published method that assumes periodic boundary conditions is extended, through the use of this framework, to unknown boundary conditions. Furthermore, we propose an implementation of this framework, based on the alternating direction method of multipliers (ADMM). We provide a proof of convergence for the resulting algorithm, which can be seen as a "partial" ADMM, in which not all variables are dualized. We report experimental comparisons with other primal-dual methods, in which the proposed one performed at the level of the state of the art. Four different kinds of applications were tested in the experiments: deconvolution, deconvolution with inpainting, superresolution, and demosaicing, all with unknown boundaries.

[1]  I. Johnstone,et al.  Adapting to Unknown Smoothness via Wavelet Shrinkage , 1995 .

[2]  S. Wang,et al.  Decomposition Method with a Variable Parameter for a Class of Monotone Variational Inequality Problems , 2001 .

[3]  Wotao Yin,et al.  On the Global and Linear Convergence of the Generalized Alternating Direction Method of Multipliers , 2016, J. Sci. Comput..

[4]  Junfeng Yang,et al.  Alternating Direction Algorithms for 1-Problems in Compressive Sensing , 2009, SIAM J. Sci. Comput..

[5]  Marco Donatelli,et al.  Dealing with edge effects in least-squares image deconvolution problems , 2005 .

[6]  R. Rockafellar Monotone Operators and the Proximal Point Algorithm , 1976 .

[7]  Raymond H. Chan,et al.  A Fast Algorithm for Deblurring Models with Neumann Boundary Conditions , 1999, SIAM J. Sci. Comput..

[8]  Michal Sorel,et al.  Removing Boundary Artifacts for Real-Time Iterated Shrinkage Deconvolution , 2012, IEEE Transactions on Image Processing.

[9]  José M. Bioucas-Dias,et al.  An Augmented Lagrangian Approach to the Constrained Optimization Formulation of Imaging Inverse Problems , 2009, IEEE Transactions on Image Processing.

[10]  Lieven Vandenberghe,et al.  Primal-Dual Decomposition by Operator Splitting and Applications to Image Deblurring , 2014, SIAM J. Imaging Sci..

[11]  Jeffrey A. Fessler,et al.  Accelerated Edge-Preserving Image Restoration Without Boundary Artifacts , 2013, IEEE Transactions on Image Processing.

[12]  D K Smith,et al.  Numerical Optimization , 2001, J. Oper. Res. Soc..

[13]  Bingsheng He,et al.  On non-ergodic convergence rate of Douglas–Rachford alternating direction method of multipliers , 2014, Numerische Mathematik.

[14]  Mário A. T. Figueiredo,et al.  Parameter Estimation for Blind and Non-Blind Deblurring Using Residual Whiteness Measures , 2013, IEEE Transactions on Image Processing.

[15]  Bingsheng He,et al.  A new inexact alternating directions method for monotone variational inequalities , 2002, Math. Program..

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

[17]  Jianhong Shen,et al.  Deblurring images: Matrices, spectra, and filtering , 2007, Math. Comput..

[18]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[19]  Laurent Condat,et al.  A Generic Proximal Algorithm for Convex Optimization—Application to Total Variation Minimization , 2014, IEEE Signal Processing Letters.

[20]  Mário A. T. Figueiredo,et al.  Deconvolving Images With Unknown Boundaries Using the Alternating Direction Method of Multipliers , 2012, IEEE Transactions on Image Processing.

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

[22]  Laurent Condat,et al.  A Primal–Dual Splitting Method for Convex Optimization Involving Lipschitzian, Proximable and Linear Composite Terms , 2013, J. Optim. Theory Appl..

[23]  Rama Chellappa,et al.  Motion Deblurring: Algorithms and Systems , 2014 .

[24]  Andy M. Yip,et al.  Simultaneous total variation image inpainting and blind deconvolution , 2005, Int. J. Imaging Syst. Technol..

[25]  丸山 徹 Convex Analysisの二,三の進展について , 1977 .

[26]  Marc Teboulle,et al.  A proximal-based decomposition method for convex minimization problems , 1994, Math. Program..

[27]  Stanley J. Reeves,et al.  Fast image restoration without boundary artifacts , 2005, IEEE Transactions on Image Processing.

[28]  Jiaya Jia,et al.  Reducing boundary artifacts in image deconvolution , 2008, 2008 15th IEEE International Conference on Image Processing.

[29]  Patrick L. Combettes,et al.  A forward-backward view of some primal-dual optimization methods in image recovery , 2014, 2014 IEEE International Conference on Image Processing (ICIP).

[30]  I. M. Otivation Playing with Duality: An Overview of Recent Primal-Dual Approaches for Solving Large-Scale Optimization Problems , 2018 .

[31]  Dimitri P. Bertsekas,et al.  On the Douglas—Rachford splitting method and the proximal point algorithm for maximal monotone operators , 1992, Math. Program..

[32]  Karen O. Egiazarian,et al.  Video denoising by sparse 3D transform-domain collaborative filtering , 2007, 2007 15th European Signal Processing Conference.

[33]  Stephen P. Boyd,et al.  Proximal Algorithms , 2013, Found. Trends Optim..

[34]  K. Egiazarian,et al.  Blind image deconvolution , 2007 .

[35]  Mario Bertero,et al.  A simple method for the reduction of boundary effects in the Richardson-Lucy approach to image deconvolution , 2005 .

[36]  Gene H. Golub,et al.  Generalized cross-validation as a method for choosing a good ridge parameter , 1979, Milestones in Matrix Computation.

[37]  Rastislav Lukac,et al.  Single-Sensor Imaging: Methods and Applications for Digital Cameras , 2008 .

[38]  James G. Nagy,et al.  Synthetic boundary conditions for image deblurring , 2011 .

[39]  Stephen P. Boyd,et al.  Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers , 2011, Found. Trends Mach. Learn..

[40]  Karen O. Egiazarian,et al.  BM3D Frames and Variational Image Deblurring , 2011, IEEE Transactions on Image Processing.

[41]  Patrick L. Combettes,et al.  Proximal Splitting Methods in Signal Processing , 2009, Fixed-Point Algorithms for Inverse Problems in Science and Engineering.

[42]  Marco Donatelli,et al.  On the Treatment of Boundary Artifacts in Image Restoration by Reflection and/or Anti-Reflection , 2010 .

[43]  Bruce H. Pillman Super-Resolution Imaging , 2013, J. Electronic Imaging.

[44]  Heinz H. Bauschke,et al.  Convex Analysis and Monotone Operator Theory in Hilbert Spaces , 2011, CMS Books in Mathematics.