Abstract: Computational sensing strategies often suffer from calibration errors in the physical implementation of their ideal sensing models. Such uncertainties are typically addressed by using multiple, accurately chosen training signals to recover the missing information on the sensing model, an approach that can be resource-consuming and cumbersome.
Abstract: Performing blind calibration is highly important in modern sensing strategies, particularly when calibration aided by multiple, accurately designed training signals is infeasible or resource-consuming. We here address it as a naturally-formulated non-convex problem for a linear model with sub-Gaussian ran- dom sensing vectors in which both the sensor gains and the sig- nal are unknown.
Abstract: Blind calibration is a bilinear inverse problem arising in modern sensing strategies, whose solution becomes crucial when traditional calibration aided by multiple, accurately designed training signals is either infeasible or resource-consuming.
2016
Proceedings of the “37th WIC Symposium on Information Theory in the Benelux, 6th joint WIC/IEEE SP Symposium on Information Theory and Signal Processing in the Benelux”