Location of Repository

Compressed Sensing with nonlinear observations and related non-linear optimisation problems

By Thomas Blumensath


Non-convex constraints have recently proven a valuable tool in many optimisation problems. In particular sparsity constraints have had a significant impact on sampling theory, where they are used in Compressed Sensing and allow structured signals to be sampled far below the rate traditionally prescribed. <br/><br/>Nearly all of the theory developed for Compressed Sensing signal recovery assumes that samples are taken using linear measurements. In this paper we instead address the Compressed Sensing recovery problem in a setting where the observations are non-linear. We show that, under conditions similar to those required in the linear setting, the Iterative Hard Thresholding algorithm can be used to accurately recover sparse or structured signals from few non-linear observations. <br/><br/>Similar ideas can also be developed in a more general non-linear optimisation framework. In the second part of this paper we therefore present related result that show how this can be done under sparsity and union of subspaces constraints, whenever a generalisation of the Restricted Isometry Property traditionally imposed on the Compressed Sensing system holds

Topics: QA
Year: 2013
OAI identifier: oai:eprints.soton.ac.uk:164753
Provided by: e-Prints Soton

Suggested articles



  1. (2008). COSAMP: Iterative signal reovery from incomplete and inacurate samples.,&quot; doi
  2. (2008). es, \The restricted isometry property and its implications for compressed sensing.,&quot; Compte Rendus de l'Academie des Sciences, Paris, Serie I,
  3. (2009). Iterative Hard Thresholding for Compressed Sensing,&quot; doi
  4. (2010). Model-based compressive sensing,&quot; doi
  5. Non-convexly constrained inverse problems,&quot; submitted,
  6. (2000). Regularization of Inverse Problems, doi
  7. (2006). Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information.,&quot; doi
  8. (2010). Sampling and reconstructing signals form a union of subspaces,&quot; submitted, doi
  9. (2010). Sparse Recovery Algorithms: Sucient Conditions in terms of the Restricted Isometry Constants,&quot; doi
  10. Sparse Recovery with Orthogonal Matching Pursuit under RIP,&quot; doi
  11. (2009). Subspace pursuit for compressed sensing: Closing the gap between performance and complexity,&quot;
  12. (2008). Wakin \An introduction to compressive sampling,&quot;

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.