Super-resolution by means of Beurling minimal extrapolation

preprint2016arXivOpen access

Abstract

Let M(Td)M(\mathbb{T}^d) be the space of complex bounded Radon measures defined on the dd-dimensional torus group (R/Z)d=Td(\mathbb{R}/\mathbb{Z})^d=\mathbb{T}^d, equipped with the total variation norm ∥⋅∥\|\cdot\|; and let μ^\hatμ denote the Fourier transform of μ∈M(Td)μ\in M(\mathbb{T}^d). We address the super-resolution problem: For given spectral (Fourier transform) data defined on a finite set Λ⊂ZdΛ\subset\mathbb{Z}^d, determine if there is a unique μ∈M(Td)μ\in M(\mathbb{T}^d) of minimal norm for which μ^\hatμ equals this data on ΛΛ. Without additional assumptions on μμ and ΛΛ, our main theorem shows that the solutions to the super-resolution problem, which we call minimal extrapolations, depend crucially on the set Γ⊂ΛΓ\subsetΛ, defined in terms of μμ and ΛΛ. For example, when Γ=0Γ=0, the minimal extrapolations are singular measures supported in the zero set of an analytic function, and when Γ≥2Γ\geq 2, the minimal extrapolations are singular measures supported in the intersection of (Γ2)Γ\choose 2 hyperplanes. By theory and example, we show that the case Γ=1Γ=1 is different from other cases and is deeply connected with the existence of positive minimal extrapolations. This theorem has implications to the possibility and impossibility of uniquely recovering μμ from ΛΛ. We illustrate how to apply our theory to both directions, by computing pertinent analytical examples. These examples are of interest in both super-resolution and deterministic compressed sensing. Our concept of an admissibility range fundamentally connects Beurling's theory of minimal extrapolation with Candes and Fernandez-Granda's work on super-resolution. This connection is exploited to address situations where current algorithms fail to compute a numerical solution to the super-resolution problem.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.