Douglas-Rachford Networks: Learning Both the Image Prior and Data Fidelity Terms for Blind Image Deconvolution

被引:33
作者
Aljadaany, Raied [1 ]
Pal, Dipan K. [1 ]
Savvides, Marios [1 ]
机构
[1] Carnegie Mellon Univ, Dept Elect & Comp Engn, Pittsburgh, PA 15213 USA
来源
2019 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2019) | 2019年
关键词
ALGORITHM; SPARSE;
D O I
10.1109/CVPR.2019.01048
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Blind deconvolution problems are heavily ill-posed where the specific blurring kernel is not known. Recovering these images typically requires estimates of the kernel. In this paper, we present a method called Dr-Net, which does not require any such estimate and is further able to invert the effects of the blurring in blind image recovery tasks. These image recovery problems typically have two terms, the data fidelity term (for faithful reconstruction) and the image prior (for realistic looking reconstructions). We use the Douglas-Rachford iterations to solve this problem since it is a more generally applicable optimization procedure than methods such as the proximal gradient descent algorithm. Two proximal operators originate from these iterations, one for the data fidelity term and the second for the image prior. It is non-trivial to design a hand-crafted function to represent these proximal operators which would work with real-world image distributions. We therefore approximate both these proximal operators using deep networks. This provides a sound motivation for the final architecture for Dr-Net which we find outperforms the state-of-the-art on two mainstream blind deconvolution benchmarks. While doing so, we also find that Dr-Net is one of the fastest algorithms according to wall-clock times.
引用
收藏
页码:10227 / 10236
页数:10
相关论文
共 59 条
[1]  
[Anonymous], 2014, ACM T GRAPHICS TOG, DOI DOI 10.1145/2661229.2661260
[2]   Image coding using wavelet transform [J].
Antonini, Marc ;
Barlaud, Michel ;
Mathieu, Pierre ;
Daubechies, Ingrid .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 1992, 1 (02) :205-220
[3]   Firmly Nonexpansive Mappings and Maximally Monotone Operators: Correspondence and Duality [J].
Bauschke, Heinz H. ;
Moffat, Sarah M. ;
Wang, Xianfu .
SET-VALUED AND VARIATIONAL ANALYSIS, 2012, 20 (01) :131-153
[4]   A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems [J].
Beck, Amir ;
Teboulle, Marc .
SIAM JOURNAL ON IMAGING SCIENCES, 2009, 2 (01) :183-202
[5]  
Belfiore JC, 2005, 2005 IEEE International Symposium on Information Theory (ISIT), Vols 1 and 2, P362
[6]   Distributed optimization and statistical learning via the alternating direction method of multipliers [J].
Boyd S. ;
Parikh N. ;
Chu E. ;
Peleato B. ;
Eckstein J. .
Foundations and Trends in Machine Learning, 2010, 3 (01) :1-122
[7]  
CAMPISI P, 2016, BLIND IMAGE DECONVOL
[8]   A Neural Approach to Blind Motion Deblurring [J].
Chakrabarti, Ayan .
COMPUTER VISION - ECCV 2016, PT III, 2016, 9907 :221-235
[9]  
Chang JL, 2017, IEEE I CONF COMP VIS, P5880, DOI [10.1109/ICCV.2017.626, 10.1109/ICCV.2017.627]
[10]   UNIVERSAL APPROXIMATION TO NONLINEAR OPERATORS BY NEURAL NETWORKS WITH ARBITRARY ACTIVATION FUNCTIONS AND ITS APPLICATION TO DYNAMICAL-SYSTEMS [J].
CHEN, TP ;
CHEN, H .
IEEE TRANSACTIONS ON NEURAL NETWORKS, 1995, 6 (04) :911-917