Algorithmic Foundations for the Diffraction Limit

Abstract

For more than a century and a half it has been widely-believed (but was never rigorously shown) that the physics of diffraction imposes certain fundamental limits on the resolution of an optical system. However our understanding of what exactly can and cannot be resolved has never risen above heuristic arguments which, even worse, appear contradictory. In this work we remedy this gap by studying the diffraction limit as a statistical inverse problem and, based on connections to provable algorithms for learning mixture models, we rigorously prove upper and lower bounds on the statistical and algorithmic complexity needed to resolve closely spaced point sources. In particular we show that there is a phase transition where the sample complexity goes from polynomial to exponential. Surprisingly, we show that this does not occur at the Abbe limit, which has long been presumed to be the true diffraction limit.

arXiv comment55 pages, 5 figures, v2: improved lower bound going beyond the Abbe limit

References in corpus (7)

• A Two-round Variant of EM for Gaussian Mixtures
• Support detection in super-resolution
• Upholding the diffraction limit in the focusing of light and sound
• MUSIC for multidimensional spectral estimation: stability and super-resolution
• Conservative classical and quantum resolution limits for incoherent imaging
• Outlier-robust moment-estimation via sum-of-squares
• Super-Resolution Off the Grid

Cited by in corpus (4)

• Generalized Leverage Score Sampling for Neural Networks
• End-to-End Nanophotonic Inverse Design for Imaging and Polarimetry
• Circumventing the resolution-time tradeoff in Ultrasound Localization Microscopy by Velocity Filtering
• Robust Model Selection and Nearly-Proper Learning for GMMs