Blind super-resolution can be cast as low rank matrix recovery problem by exploiting the inherent simplicity of the signal. In this paper, we develop a simple yet efficient nonconvex method for this problem based on the low rank structure of the vectorized Hankel matrix associated with the target matrix. Theoretical guarantees have been established under the similar conditions as convex approaches. Numerical experiments are also conducted to demonstrate its performance.

翻译：通过利用信号的内在简单性,盲人超分辨率可被视为低级矩阵回收问题。在本文件中,我们根据与目标矩阵相关的传导式汉克勒矩阵的低级结构,为这一问题开发了简单而有效的非节制方法。在类似曲线方法的条件下建立了理论保障。还进行了数值实验,以展示其性能。