Recovery of sparse perturbations in Least Squares problems

Abstract

We show that the exact recovery of sparse perturbations on the coefficient matrix in overdetermined Least Squares problems is possible for a large class of perturbation structures. The well established theory of Compressed Sensing enables us to prove that if the perturbation structure is sufficiently incoherent, then exact or stable recovery can be achieved using linear programming. We derive sufficiency conditions for both exact and stable recovery using known results of 0/ 1 equivalence. However the problem turns out to be more complicated than the usual setting used in various sparse reconstruction problems. We propose and solve an optimization criterion and its convex relaxation to recover the perturbation and the solution to the Least Squares problem simultaneously. Then we demonstrate with numerical examples that the proposed method is able to recover the perturbation and the unknown exactly with high probability. The performance of the proposed technique is compared in blind identification of sparse multipath channels.

Robust Entangled-Photon Ghost Imaging with Compressive Sensing

“…Then, we rearrange the sequence into a matrix with size normalM×normalN. This ill-posed [31,32,33] problem can be solved by exploiting the sparsity of the signal if AM×N satisfies the restricted isometry property (RIP) [34,35].…”

Competitive least squares problem with bounded data uncertainties

“…A wide range of applications in the signal processing literature deal with LS problems [1]- [3], [6]. However, in different applications, the performance of the LS estimators may substantially degrade due to possible errors in the model parameters.…”