A. Cosse

activity

20172024

most citedFrom Blind deconvolution to Blind Super-Resolution through convex programming

3 citations · 3 across the 3 of their papers we have counts for

collaborators

3 papers

cs.IT2024

Sparse recovery from quadratic equations, part II: hardness and incoherence

Augustin Cosse

We study the square root bottleneck in the recovery of sparse vectors from quadratic equations. It is acknowledged that a sparse vector $x_{0} \in R^{n}$ , $\| \mathbf…

math.NA2020

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

Augustin Cosse

Let $μ (t) = \sum_{τ \in S} α_{τ} δ (t - τ)$ denote an $∣ S ∣$ -atomic measure defined on $[0, 1]$ , satisfying $min_{τ \neq = τ^{'}} ∣ τ - τ^{'} ∣ \geq ∣ S ∣ \cdot n^{- 1}$ . Let $η(θ) = \sum_{τ\in S} a_τD_n(θ-…

cs.IT2017★ 3 cited

From Blind deconvolution to Blind Super-Resolution through convex programming

Augustin Cosse

This paper discusses the recovery of an unknown signal $x \in R^{L}$ through the result of its convolution with an unknown filter $h \in R^{L}$ . This problem, also kno…