A Non-Convex Blind Calibration Method for Randomised Sensing Strategies
arXiv:1605.02615 · doi:10.1109/CoSeRa.2016.7745690
Abstract
The implementation of computational sensing strategies often faces calibration problems typically solved by means of multiple, accurately chosen training signals, an approach that can be resource-consuming and cumbersome. Conversely, blind calibration does not require any training, but corresponds to a bilinear inverse problem whose algorithmic solution is an open issue. We here address blind calibration as a non-convex problem for linear random sensing models in which we aim to recover an unknown signal from its projections on sub-Gaussian random vectors, each of which is subject to an unknown multiplicative factor (gain). To solve this optimisation problem we resort to projected gradient descent starting from a suitable initialisation. An analysis of this algorithm allows us to show that it converges to the global optimum provided a sample complexity requirement is met, i.e., relating convergence to the amount of information collected during the sensing process. Finally, we present some numerical experiments in which our algorithm allows for a simple solution to blind calibration of sensor gains in computational sensing applications.
arXiv comment6 pages, 4 figures. A 5-page version of this draft was accepted and will be presented at the IEEE 2016 4th International Workshop on Compressed Sensing Theory and its Applications to Radar, Sonar, and Remote Sensing (CoSeRa 2016)
References in corpus (7)
- Phase Retrieval via Wirtinger Flow: Theory and Algorithms
- General Deviants: An Analysis of Perturbations in Compressed Sensing
- Self-Calibration and Biconvex Compressive Sensing
- Convex Optimization Approaches for Blind Sensor Calibration using Sparsity
- Lifting for Blind Deconvolution in Random Mask Imaging: Identifiability and Convex Relaxation
- The local convexity of solving systems of quadratic equations
- Blind Deconvolution Meets Blind Demixing: Algorithms and Performance Bounds
Cited by in corpus (6)
- Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview
- Complete Dictionary Recovery over the Sphere II: Recovery by Riemannian Trust-region Method
- Asymptotically Optimal Blind Calibration of Uniform Linear Sensor Arrays for Narrowband Gaussian Signals
- Through the Haze: a Non-Convex Approach to Blind Gain Calibration for Linear Random Sensing Models
- From Blind deconvolution to Blind Super-Resolution through convex programming
- Signal Recovery in Perturbed Fourier Compressed Sensing