2017/10/09 by Wen Huang, Huang, Wen, Paul Hand +1
Computer Science · Mathematics · #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1710.03309
arxiv created 2018/04/14 · arxiv updated 2018/04/17
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.