2020
DOI: 10.48550/arxiv.2001.01644
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Compressed Super-Resolution I: Maximal Rank Sum-of-Squares

Abstract: Let µ(t) = ∑ τ ∈S ατ δ(t − τ ) denote an S -atomic measure defined on [0, 1], satisfying min, denote the polynomial obtained from the Dirichlet kernel Dn(θ) = 1 n+1 ∑ k ≤n e 2πikθ and its derivative by solving the system {η(τ ) = 1, η ′ (τ ) = 0, ∀τ ∈ S}. We provide evidence that for sufficiently large n, ∆ ≳ S 2 n −1 , the non negative polynomial 1 − η(θ) 2 which vanishes at the atoms τ ∈ S, and is bounded by 1 everywhere else on the [0, 1] interval, can be written as a sum-of-squares with associated Gram mat… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 9 publications
0
2
0
Order By: Relevance
“…Inspired by [41], [42], we propose a novel approach to reduce the computational complexity of (ANM) by projecting the positivity constraint T (x) 0 to a lower dimension. Consider a matrix M ∈ C M ×N with M ≤ N and full rank, i.e.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…Inspired by [41], [42], we propose a novel approach to reduce the computational complexity of (ANM) by projecting the positivity constraint T (x) 0 to a lower dimension. Consider a matrix M ∈ C M ×N with M ≤ N and full rank, i.e.…”
Section: Resultsmentioning
confidence: 99%
“…Finally, numerical experiments are provided to demonstrate the effectiveness of the proposed algorithm. Our work is related to the compressed ANM proposed in [41], [42], but focuses on the positive case where we provide guarantees without imposing any separation condition on the sources.…”
Section: Introduction Super-resolutionmentioning
confidence: 99%