Super-Resolution on the Sphere Using Convex Optimization
From MaRDI portal
Abstract: This paper considers the problem of recovering an ensemble of Diracs on a sphere from its low resolution measurements. The Diracs can be located at any location on the sphere, not necessarily on a grid. We show that under a separation condition, one can recover the ensemble with high precision by a three-stage algorithm, which consists of solving a semi-definite program, root finding and least-square fitting. The algorithm's computation time depends solely on the number of measurements, and not on the required solution accuracy. We also show that in the special case of non-negative ensembles, a sparsity condition is sufficient for recovery. Furthermore, in the discrete setting, we estimate the recovery error in the presence of noise as a function of the noise level and the super-resolution factor.
Cited in
(12)- Prony's method under an almost sharp multivariate Ingham inequality
- Prony's method on the sphere
- Super-resolution meets machine learning: approximation of measures
- Robust recovery of stream of pulses using convex optimization
- Adapting to unknown noise level in sparse deconvolution
- Spherical designs and nonconvex minimization for recovery of sparse signals on the sphere
- Recovery of atomic measures on the unit sphere
- Anisotropic diffusion in consensus-based optimization on the sphere
- A Convex Approach to Superresolution and Regularization of Lines in Images
- A derivative-free geometric algorithm for optimization on a sphere
- Bézier splines interpolation on Stiefel and Grassmann manifolds
- A multivariate generalization of Prony's method
This page was built for publication: Super-Resolution on the Sphere Using Convex Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580540)
