CoChat

Blind Deconvolution Meets Blind Demixing: Algorithms and Performance Bounds

Open access
Ling, Shuyang, Strohmer, Thomas · 2017 · IEEE Transactions on Information Theory
Cited by 101

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

Abstract

Suppose that we have r sensors and each one intends to send a fun9810427ction g (e.g., a signal or an image) to a receiver common to all r sensors. During transmission, each g gets convolved with a function fi. The receiver records the function y, given by the sum of all these convolved signals. When and under which conditions is it possible to recover the individual signals g and the blurring functions f from just one received signal y? This challenging problem, which intertwines blind deconvolution with blind demixing, appears in a variety of applications, such as audio processing, image processing, neuroscience, spectroscopy, and astronomy. It is also expected to play a central role in connection with the future Internet-of-Things. We will prove that under reasonable and practical assumptions, it is possible to solve this, otherwise, highly ill-posed problem and recover the r transmitted functions giand the impulse responses fiin a robust, reliable, and efficient manner, from just one single received function y by solving a semidefinite program. We derive explicit bounds on the number of measurements needed for successful recovery and prove that our method is robust in the presence of noise. Our theory is actually suboptimal, since numerical experiments demonstrate that, quite remarkably, recovery is still possible if the number of measurements is close to the number of degrees of freedom.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tit.2017.2701342

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 2 references

Cited by

Metadata

Authors
Ling, S., & Strohmer, T.
Venue
IEEE Transactions on Information Theory
Published
2017-07
Volume
63
Issue
7
Pages
4497-4520
ISSN
  • 0018-9448 (ISSN-L)
  • 1557-9654
OpenAlex
W2962818938
Cited by
101
References
2
FWCI
13.81
Type
journal article
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.