On the Global Geometry of Sphere-Constrained Sparse Blind Deconvolution
On the Global Geometry of Sphere-Constrained Sparse Blind Deconvolution
复制标题
DOI:
10.1109/tpami.2019.2939237
复制
发表时间:
2019-01
影响因子:
23.6
通讯作者:
Yuqian Zhang;Yenson Lau;Han-Wen Kuo;S. Cheung;A. Pasupathy;John Wright
中科院分区:
文献类型:
--
作者:
Yuqian Zhang;Yenson Lau;Han-Wen Kuo;S. Cheung;A. Pasupathy;John Wright
Blind deconvolution is the problem of recovering a convolutional kernel $\boldsymbol{a}_0$a0 and an activation signal $\boldsymbol{x}_0$x0 from their convolution $\boldsymbol{y} = \boldsymbol{a}_0 \circledast \boldsymbol{x}_0$y=a0⊛x0. This problem is ill-posed without further constraints or priors. This paper studies the situation where the nonzero entries in the activation signal are sparsely and randomly populated. We normalize the convolution kernel to have unit Frobenius norm and cast the sparse blind deconvolution problem as a nonconvex optimization problem over the sphere. With this spherical constraint, every spurious local minimum turns out to be close to some signed shift truncation of the ground truth, under certain hypotheses. This benign property motivates an effective two stage algorithm that recovers the ground truth from the partial information offered by a suboptimal local minimum. This geometry-inspired algorithm recovers the ground truth for certain microscopy problems, also exhibits promising performance in the more challenging image deblurring problem. Our insights into the global geometry and the two stage algorithm extend to the convolutional dictionary learning problem, where a superposition of multiple convolution signals is observed.