Matrix computations (3rd ed.)
Limits on Super-Resolution and How to Break Them
IEEE Transactions on Pattern Analysis and Machine Intelligence
Fundamental Limits of Reconstruction-Based Superresolution Algorithms under Local Translation
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Pattern Analysis and Machine Intelligence
Hi-index | 0.14 |
Wang and Feng [1] pointed out that the deduction in [2] overlooked the validity of the perturbation theorem used in [2]. In this paper, we show that, when the perturbation theorem is invalid, the probability of successful superresolution is very low. Therefore, we only have to derive the limits under the condition that validates the perturbation theorem, as done in [2].