# On the Global Geometry of Sphere-Constrained Sparse Blind Deconvolution

**Authors:** Yuqian Zhang, Yenson Lau, Han-Wen Kuo, Sky Cheung, Abhay Pasupathy,, John Wright

arXiv: 1901.01913 · 2019-01-08

## TL;DR

This paper explores the geometric landscape of sphere-constrained sparse blind deconvolution, revealing that local minima are near true solutions, and proposes a two-stage algorithm for effective recovery in microscopy and image deblurring.

## Contribution

It characterizes the global geometry of the nonconvex sphere-constrained blind deconvolution problem and introduces a novel two-stage algorithm inspired by this geometry.

## Key findings

- Local minima are close to shifted ground truths under certain conditions.
- The proposed algorithm successfully recovers ground truth in microscopy and deblurring tasks.
- Insights extend to convolutional dictionary learning with multiple signals.

## Abstract

Blind deconvolution is the problem of recovering a convolutional kernel $\boldsymbol a_0$ and an activation signal $\boldsymbol x_0$ from their convolution $\boldsymbol y = \boldsymbol a_0 \circledast \boldsymbol x_0$. 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.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1901.01913/full.md

## Figures

22 figures with captions in the complete paper: https://tomesphere.com/paper/1901.01913/full.md

## References

30 references — full list in the complete paper: https://tomesphere.com/paper/1901.01913/full.md

---
Source: https://tomesphere.com/paper/1901.01913