期刊
SIAM JOURNAL ON MATHEMATICAL ANALYSIS
卷 51, 期 1, 页码 1-44出版社
SIAM PUBLICATIONS
DOI: 10.1137/17M1147822
关键词
sparsity; inverse problems; super-resolution; convex analysis; image processing; polynomial interpolation
This paper studies sparse super-resolution in arbitrary dimensions. More precisely, it develops a theoretical analysis of support recovery for the so-called beurling least angle regression (BLASSO) method, which is an off-the-grid generalization of l(1) regularization (also known as the least angle regression). While super-resolution is of paramount importance in overcoming the limitations of many imaging devices, its theoretical analysis is still lacking beyond the one-dimensional case. The reason is that in the two-dimensional (2-D) case and beyond, the relative position of the spikes enters the picture, and different geometrical configurations lead to different stability properties. Our first main contribution is a connection, in the limit where the spikes cluster at a given point, between solutions of the dual of the BLASSO problem and the least interpolant space for Hermite polynomial interpolation. This interpolation space, introduced by De Boor, can be computed by Gaussian elimination and lead to an algorithmic description of limiting solutions to the dual problem. With this construction at hand, our second main contribution is a detailed analysis of the support stability and super-resolution effect in the case of a pair of spikes. This includes in particular a sharp analysis of how the signal-to-noise ratio should scale with respect to the separation distance between the spikes. Lastly, numerical simulations on different classes of kernels show the applicability of this theory and highlight the richness of super-resolution in 2-D.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据