Mathematical Theory of Computational Resolution Limit in Multi-dimensions

03/22/2021
by   Ping Liu, et al.
0

Resolving a linear combination of point sources from their band-limited Fourier data is a fundamental problem in imaging and signal processing. With the incomplete Fourier data and the inevitable noise in the measurement, there is a fundamental limit on the separation distance between point sources that can be resolved. This is the so-called resolution limit problem. Characterization of this resolution limit is still a long-standing puzzle despite the prevalent use of the classic Rayleigh limit. It is well-known that Rayleigh limit is heuristic and its drawbacks become prominent when dealing with data that is subjected to delicate processing, as is what modern computational imaging methods do. Therefore, more precise characterization of the resolution limit becomes increasingly necessary with the development of data processing methods. For this purpose, we developed a theory of "computational resolution limit" for both number detection and support recovery in one dimension in [arXiv:2003.02917[cs.IT], arXiv:1912.05430[eess.IV]]. In this paper, we extend the one-dimensional theory to multi-dimensions. More precisely, we define and quantitatively characterize the "computational resolution limit" for the number detection and support recovery problems in a general k-dimensional space. Our results indicate that there exists a phase transition phenomenon regarding to the super-resolution factor and the signal-to-noise ratio in each of the two recovery problems. Our main results are derived using a subspace projection strategy. Finally, to verify the theory, we proposed deterministic subspace projection based algorithms for the number detection and support recovery problems in dimension two and three. The numerical results confirm the phase transition phenomenon predicted by the theory.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

02/26/2020

Resolution Limit for Line Spectral Estimation: Theory and Algorithm

Line spectral estimation is a classical signal processing problem aimed ...
04/16/2020

Algorithmic Foundations for the Diffraction Limit

For more than a century and a half it has been widely-believed (but was ...
05/03/2019

Super-resolution limit of the ESPRIT algorithm

The problem of imaging point objects can be formulated as estimation of ...
05/29/2021

Stability and Super-resolution of MUSIC and ESPRIT for Multi-snapshot Spectral Estimation

This paper studies the spectral estimation problem of estimating the loc...
11/13/2018

Fundamental Limits of Exact Support Recovery in High Dimensions

We study the support recovery problem for a high-dimensional signal obse...
10/26/2020

The planted k-factor problem

We consider the problem of recovering an unknown k-factor, hidden in a w...
07/03/2018

Robustness of Two-Dimensional Line Spectral Estimation Against Spiky Noise

The aim of two-dimensional line spectral estimation is to super-resolve ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.