Short-and-Sparse Deconvolution -- A Geometric Approach

08/28/2019
by   Yenson Lau, et al.
7

Short-and-sparse deconvolution (SaSD) is the problem of extracting localized, recurring motifs in signals with spatial or temporal structure. Variants of this problem arise in applications such as image deblurring, microscopy, neural spike sorting, and more. The problem is challenging in both theory and practice, as natural optimization formulations are nonconvex. Moreover, practical deconvolution problems involve smooth motifs (kernels) whose spectra decay rapidly, resulting in poor conditioning and numerical challenges. This paper is motivated by recent theoretical advances, which characterize the optimization landscape of a particular nonconvex formulation of SaSD. This is used to derive a provable algorithm which exactly solves certain non-practical instances of the SaSD problem. We leverage the key ideas from this theory (sphere constraints, data-driven initialization) to develop a practical algorithm, which performs well on data arising from a range of application areas. We highlight key additional challenges posed by the ill-conditioning of real SaSD problems, and suggest heuristics (acceleration, continuation, reweighting) to mitigate them. Experiments demonstrate both the performance and generality of the proposed method.

READ FULL TEXT

page 2

page 9

page 10

page 13

page 24

page 25

page 26

page 28

research
01/02/2019

Geometry and Symmetry in Short-and-Sparse Deconvolution

We study the Short-and-Sparse (SaS) deconvolution problem of recovering ...
research
06/01/2018

Structured Local Optima in Sparse Blind Deconvolution

Blind deconvolution is a ubiquitous problem of recovering two unknown si...
research
05/26/2018

Global Geometry of Multichannel Sparse Blind Deconvolution on the Sphere

Multichannel blind deconvolution is the problem of recovering an unknown...
research
01/07/2019

On the Global Geometry of Sphere-Constrained Sparse Blind Deconvolution

Blind deconvolution is the problem of recovering a convolutional kernel ...
research
01/20/2020

Finding the Sparsest Vectors in a Subspace: Theory, Algorithms, and Applications

The problem of finding the sparsest vector (direction) in a low dimensio...
research
02/21/2018

Fast Nonconvex Deconvolution of Calcium Imaging Data

Calcium imaging data promises to transform the field of neuroscience by ...
research
09/11/2020

Boosting the Sliding Frank-Wolfe solver for 3D deconvolution

In the context of gridless sparse optimization, the Sliding Frank Wolfe ...

Please sign up or login with your details

Forgot password? Click here to reset