Blind Deconvolution by a Steepest Descent Algorithm on a Quotient Manifold

In this paper, we propose a Riemannian steepest descent method for solving a blind deconvolution problem. We prove that the proposed algorithm with an appropriate initialization will recover the exact solution with high probability when the number of measurements is, up to log-factors, the information-theoretical minimum scaling. The quotient structure in our formulation yields a simpler penalty term in the cost function compared to [LLSW16], which eases the convergence analysis and yields a natural implementation. Empirically, the proposed algorithm has better performance than the Wirtinger gradient descent algorithm and an alternating minimization algorithm in the sense that i) it needs fewer operations, such as DFTs and matrix-vector multiplications, to reach a similar accuracy, and ii) it has a higher probability of successful recovery in synthetic tests. An image deblurring problem is also used to demonstrate the efficiency and effectiveness of the proposed algorithm.

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

[2]  Wen Huang,et al.  ROPTLIB , 2018, ACM Trans. Math. Softw..

[3]  Zhi-Quan Luo,et al.  Guaranteed Matrix Completion via Non-Convex Factorization , 2014, IEEE Transactions on Information Theory.

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

[5]  Levent Tunçel,et al.  Optimization algorithms on matrix manifolds , 2009, Math. Comput..

[6]  Wen Huang,et al.  A Broyden Class of Quasi-Newton Methods for Riemannian Optimization , 2015, SIAM J. Optim..

[7]  J. Christou,et al.  Restoration of Astronomical Images by Iterative Blind Deconvolution , 1993 .

[8]  Thomas Strohmer,et al.  Self-calibration and biconvex compressive sensing , 2015, ArXiv.

[9]  Frédo Durand,et al.  Understanding and evaluating blind deconvolution algorithms , 2009, 2009 IEEE Conference on Computer Vision and Pattern Recognition.

[10]  Xiaojing Zhu,et al.  A Riemannian conjugate gradient method for optimization on the Stiefel manifold , 2016, Computational Optimization and Applications.

[11]  H. Vincent Poor,et al.  Blind equalization and multiuser detection in dispersive CDMA channels , 1998, IEEE Trans. Commun..

[12]  Bart Vandereycken.  Low-Rank Matrix Completion by Riemannian Optimization , 2012, SIAM J. Optim..

[13]  Holger Boche,et al.  Sparse Signal Processing Concepts for Efficient 5G System Design , 2014, IEEE Access.

[14]  Wen Huang,et al.  Solving PhaseLift by Low-rank Riemannian Optimization Methods , 2017, ICCS.

[15]  Wen Huang,et al.  Intrinsic representation of tangent vectors and vector transports on matrix manifolds , 2017, Numerische Mathematik.

[16]  Xiaodong Li,et al.  Rapid, Robust, and Reliable Blind Deconvolution via Nonconvex Optimization , 2016, Applied and Computational Harmonic Analysis.

[17]  Gene H. Golub,et al.  Matrix computations , 1983 .

[18]  Hiroyuki Sato,et al.  A new, globally convergent Riemannian conjugate gradient method , 2013, 1302.0125.

[19]  Wen Huang,et al.  Optimization algorithms on Riemannian manifolds with applications , 2013 .

[20]  C. Baker.  RIEMANNIAN MANIFOLD TRUST-REGION METHODS WITH APPLICATIONS TO EIGENPROBLEMS , 2008 .

[21]  Wen Huang,et al.  A Riemannian BFGS Method Without Differentiated Retraction for Nonconvex Optimization Problems , 2018, SIAM J. Optim..

[22]  J. Borwein,et al.  Two-Point Step Size Gradient Methods , 1988 .

[23]  Hiroyuki Sato,et al.  A Dai–Yuan-type Riemannian conjugate gradient method with the weak Wolfe conditions , 2014, Comput. Optim. Appl..

[24]  Yuxuan Wang,et al.  A Leaf Recognition Algorithm for Plant Classification Using Probabilistic Neural Network , 2007, 2007 IEEE International Symposium on Signal Processing and Information Technology.

[25]  Yanjun Li,et al.  Blind Recovery of Sparse Signals From Subsampled Convolution , 2015, IEEE Transactions on Information Theory.

[26]  Renato D. C. Monteiro,et al.  A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization , 2003, Math. Program..

[27]  T. Chan,et al.  Guarantees of riemannian optimization for low rank matrix completion , 2016, Inverse Problems & Imaging.

[28]  Pierre-Antoine Absil,et al.  RTRMC: A Riemannian trust-region method for low-rank matrix completion , 2011, NIPS.

[29]  Bamdev Mishra,et al.  A Riemannian approach to large-scale constrained least-squares with symmetries , 2014 .

[30]  Wen Huang,et al.  A Riemannian symmetric rank-one trust-region method , 2014, Mathematical Programming.

[31]  Benedikt Wirth,et al.  Optimization Methods on Riemannian Manifolds and Their Application to Shape Space , 2012, SIAM J. Optim..

[32]  Justin K. Romberg,et al.  Blind Deconvolution Using Convex Programming , 2012, IEEE Transactions on Information Theory.

[33]  Xiaodong Li,et al.  Phase Retrieval via Wirtinger Flow: Theory and Algorithms , 2014, IEEE Transactions on Information Theory.

[34]  Amit Singer,et al.  Robust estimation of rotations from relative measurements by maximum likelihood , 2013, 52nd IEEE Conference on Decision and Control.

[35]  Mostafa Kaveh,et al.  A simple algorithm for joint blur identification and image restoration , 1994, Proceedings of 1st International Conference on Image Processing.

[36]  Steven G. Johnson,et al.  The Design and Implementation of FFTW3 , 2005, Proceedings of the IEEE.