Travelling salesman-based compressive sampling

Compressed sensing theory indicates that selecting a few measurements independently at random is a near optimal strategy to sense sparse or compressible signals. This is infeasible in practice for many acquisition devices that acquire samples along continuous trajectories (e.g., radial, spiral, ...). Examples include magnetic resonance imaging (MRI) or radiointerferometry. In this paper, we propose to generate continuous sampling trajectories by drawing a small set of measurements independently and joining them using a travelling salesman problem solver. Our contribution lies in the theoretical derivation of the appropriate probability density of the initial drawings. Preliminary computational results show that this strategy is as efficient as independent drawings while being implementable on real acquisition systems.

[1]  Pierre Weiss,et al.  Variable density compressed sensing in MRI. Theoretical vs heuristic sampling strategies , 2013, 2013 IEEE 10th International Symposium on Biomedical Imaging.

[2]  D. Donoho,et al.  Sparse MRI: The application of compressed sensing for rapid MR imaging , 2007, Magnetic resonance in medicine.

[3]  A. M. Frieze,et al.  Probabilistic Analysis of the TSP , 2007 .

[4]  Emmanuel J. Candès,et al.  Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? , 2004, IEEE Transactions on Information Theory.

[5]  J. Beardwood,et al.  The shortest path through many points , 1959, Mathematical Proceedings of the Cambridge Philosophical Society.

[6]  Massimo Fornasier,et al.  Theoretical Foundations and Numerical Methods for Sparse Recovery , 2010, Radon Series on Computational and Applied Mathematics.

[7]  Yong Wang,et al.  Smoothed random-like trajectory for compressed sensing MRI , 2012, 2012 Annual International Conference of the IEEE Engineering in Medicine and Biology Society.

[8]  Rudolf Stollberger,et al.  Adapted random sampling patterns for accelerated MRI , 2011, Magnetic Resonance Materials in Physics, Biology and Medicine.

[9]  H. Rauhut Compressive Sensing and Structured Random Matrices , 2009 .

[10]  J. Yukich Probability theory of classical Euclidean optimization problems , 1998 .

[11]  W. Marsden I and J , 2012 .