Pith. sign in

REVIEW 1 cited by

Multichannel Sparse Blind Deconvolution on the Sphere

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1805.10437 v2 pith:NPAU225P submitted 2018-05-26 cs.IT cs.CVcs.LGmath.ITmath.OC

classification cs.ITcs.CVcs.LGmath.ITmath.OC
keywords sparseblindcircledastconvolutiondeconvolutionfiltermultichannelsphere
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

Multichannel blind deconvolution is the problem of recovering an unknown signal $f$ and multiple unknown channels $x_i$ from their circular convolution $y_i=x_i \circledast f$ ($i=1,2,\dots,N$). We consider the case where the $x_i$'s are sparse, and convolution with $f$ is invertible. Our nonconvex optimization formulation solves for a filter $h$ on the unit sphere that produces sparse output $y_i\circledast h$. Under some technical assumptions, we show that all local minima of the objective function correspond to the inverse filter of $f$ up to an inherent sign and shift ambiguity, and all saddle points have strictly negative curvatures. This geometric structure allows successful recovery of $f$ and $x_i$ using a simple manifold gradient descent (MGD) algorithm. Our theoretical findings are complemented by numerical experiments, which demonstrate superior performance of the proposed approach over the previous methods.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution

    eess.SP 2019-08 conditional novelty 6.0 of 10

    For multichannel sparse blind deconvolution, Huber-loss Riemannian gradient descent with random initialization plus an LP-rounding step provably recovers the kernel and sparse signals up to a signed shift, with sample...

Pith tools