An official website of the United States government
The problem of imaging point objects can be formulated as estimation of an unknown atomic measure from its M+1 consecutive noisy Fourier coefficients. The standard resolution of this inverse problem is 1/M and super-resolution refers to the capability of resolving atoms at a higher resolution. When any two atoms are less than 1/M apart, this recovery problem is highly challenging and many existing algorithms either cannot deal with this situation or require restrictive assumptions on the sign of the measure. ESPRIT is an efficient method which does not depend on the sign of the measure. This paper provides an explicit error bound on the support matching distance of ESPRIT in terms of the minimum singular value of Vandermonde matrices. When the support consists of multiple well-separated clumps and noise is sufficiently small, the support error by ESPRIT scales like SRF2λ-2×Noise, where the Super-Resolution Factor (SRF) governs the difficulty of the problem and λ is the cardinality of the largest clump. Our error bound matches the min-max rate of a special model with one clump of closely spaced atoms up to a factor of M in the small noise regime, and therefore establishes the near-optimality of ESPRIT. Our theory is validated by numerical experiments. Keywords: Super-resolution, subspace methods, ESPRIT, stability, uncertainty principle.
more »
« less
Conditioning of restricted Fourier matrices and super-resolution of MUSIC
This paper studies stable recovery of a collection of point sources from its noisy M+1 low-frequency Fourier coefficients. We focus on the super-resolution regime where the minimum separation of the point sources is below 1/M. We propose a separated clumps model where point sources are clustered in far apart sets, and prove an accurate lower bound of the Fourier matrix with nodes restricted to the source locations. This estimate gives rise to a theoretical analysis on the super-resolution limit of the MUSIC algorithm.
more »
« less
- Award ID(s):
- 1818751
- PAR ID:
- 10148666
- Date Published:
- Journal Name:
- The 13th International conference on Sampling Theory and Applications (SampTA)
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
null (Ed.)Abstract We study the ubiquitous super-resolution problem, in which one aims at localizing positive point sources in an image, blurred by the point spread function of the imaging device. To recover the point sources, we propose to solve a convex feasibility program, which simply finds a non-negative Borel measure that agrees with the observations collected by the imaging device. In the absence of imaging noise, we show that solving this convex program uniquely retrieves the point sources, provided that the imaging device collects enough observations. This result holds true if the point spread function of the imaging device can be decomposed into horizontal and vertical components and if the translations of these components form a Chebyshev system, i.e., a system of continuous functions that loosely behave like algebraic polynomials. Building upon the recent results for one-dimensional signals, we prove that this super-resolution algorithm is stable, in the generalized Wasserstein metric, to model mismatch (i.e., when the image is not sparse) and to additive imaging noise. In particular, the recovery error depends on the noise level and how well the image can be approximated with well-separated point sources. As an example, we verify these claims for the important case of a Gaussian point spread function. The proofs rely on the construction of novel interpolating polynomials—which are the main technical contribution of this paper—and partially resolve the question raised in Schiebinger et al. (2017, Inf. Inference, 7, 1–30) about the extension of the standard machinery to higher dimensions.more » « less
-
null (Ed.)Abstract We study super-resolution multi-reference alignment, the problem of estimating a signal from many circularly shifted, down-sampled and noisy observations. We focus on the low SNR regime, and show that a signal in $${\mathbb{R}}^M$$ is uniquely determined when the number $$L$$ of samples per observation is of the order of the square root of the signal’s length ($$L=O(\sqrt{M})$$). Phrased more informally, one can square the resolution. This result holds if the number of observations is proportional to $$1/\textrm{SNR}^3$$. In contrast, with fewer observations recovery is impossible even when the observations are not down-sampled ($L=M$). The analysis combines tools from statistical signal processing and invariant theory. We design an expectation-maximization algorithm and demonstrate that it can super-resolve the signal in challenging SNR regimes.more » « less
-
Abstract We present 500 and 700 au resolution 1 and 3 mm Atacama Large Millimeter/submillimeter Array observations, respectively, of protostellar cores in protoclusters Sagittarius B2 (Sgr B2) North (N) and Main (M), parts of the most actively star-forming cloud in our Galaxy. Previous lower-resolution (5000 au) 3 mm observations of this region detected ∼150 sources inferred to be young stellar objects (YSOs) withM> 8M⊙. With a 10-fold increase in resolution, we detect 371 sources at 3 mm and 218 sources in the smaller field of view at 1 mm. The sources seen at low resolution are observed to fragment into an average of two objects. About one-third of the observed sources fragment. Most of the sources we report are marginally resolved and are at least partially optically thick. We determine that the observed sources are most consistent with Stage 0/I YSOs, i.e., rotationally supported disks with an active protostar and an envelope, that are warmer than those observed in the solar neighborhood. We report source-counting-based inferred stellar mass and the star formation rate of the cloud: 2800M⊙and 0.0038M⊙yr−1for Sgr B2 N and 6900M⊙and 0.0093M⊙yr−1for Sgr B2 M, respectively.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Conference Paper:
- https://doi.org/10109/SampTA45681.2019.9030936
