Variable Density Sampling with Continuous Trajectories

Reducing acquisition time is a crucial challenge for many imaging techniques. Compressed Sensing (CS) theory offers an appealing framework to address this issue since it provides theoretical guarantees on the reconstruction of sparse signals by projection on a low dimensional linear subspace. In this paper, we focus on a setting where the imaging device allows to sense a fixed set of measurements. We first discuss the choice of an optimal sampling subspace (smallest subset) allowing perfect reconstruction of sparse signals. Its standard design relies on the random drawing of independent measurements. We discuss how to select the drawing distribution and show that a mixed strategy involving partial deterministic sampling and independent drawings can help breaking the so-called "coherence barrier". Unfortunately, independent random sampling is irrelevant for many acquisition devices owing to acquisition constraints. To overcome this limitation, the notion of Variable Density Samplers (VDS) is introduced and defined as a stochastic process with a prescribed limit empirical measure. It encompasses samplers based on independent measurements or continuous curves. The latter are crucial to extend CS results to actual applications. Our main contribution lies in two original continuous VDS. The first one relies on random walks over the acquisition space whereas the second one is heuristically driven and rests on the approximate solution of a Traveling Salesman Problem. Theoretical analysis and retrospective CS simulations in magnetic resonance imaging highlight that the TSP-based solution provides improved reconstructed images in terms of signal-to-noise ratio compared to standard sampling schemes (spiral, radial, 3D iid...).

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

[2]  John Odentrantz,et al.  Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues , 2000, Technometrics.

[3]  Vladislav Kargin A LARGE DEVIATION INEQUALITY FOR VECTOR FUNCTIONS ON FINITE REVERSIBLE MARKOV CHAINS , 2005 .

[4]  Dennis Goeckel,et al.  Performance Bounds for Grouped Incoherent Measurements in Compressive Sensing , 2015, IEEE Transactions on Signal Processing.

[5]  Ben Adcock,et al.  Breaking the coherence barrier: asymptotic incoherence and asymptotic sparsity in compressed sensing , 2013, ArXiv.

[6]  R. Bass,et al.  Review: P. Billingsley, Convergence of probability measures , 1971 .

[7]  Emilio Frazzoli,et al.  On the Dubins Traveling Salesman Problem , 2012, IEEE Transactions on Automatic Control.

[8]  Rachel Ward,et al.  Stable and Robust Sampling Strategies for Compressive Imaging , 2012, IEEE Transactions on Image Processing.

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

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

[11]  Pierre Weiss,et al.  An Analysis of Block Sampling Strategies in Compressed Sensing , 2013, IEEE Transactions on Information Theory.

[12]  O. Simonetti,et al.  Artifact and noise suppression in GRAPPA imaging using improved k‐space coil calibration and variable density sampling , 2005, Magnetic resonance in medicine.

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

[14]  J CandesEmmanuel,et al.  A Probabilistic and RIPless Theory of Compressed Sensing , 2011 .

[15]  David Gross,et al.  Recovering Low-Rank Matrices From Few Coefficients in Any Basis , 2009, IEEE Transactions on Information Theory.

[16]  Jean-Philippe Thiran,et al.  Spread Spectrum Magnetic Resonance Imaging , 2012, IEEE Transactions on Medical Imaging.

[17]  Charles R. Johnson,et al.  Topics in Matrix Analysis , 1991 .

[18]  D. Nishimura,et al.  Reduced aliasing artifacts using variable‐density k‐space sampling trajectories , 2000, Magnetic resonance in medicine.

[19]  W. K. Hastings,et al.  Monte Carlo Sampling Methods Using Markov Chains and Their Applications , 1970 .

[20]  Elsa D. Angelini,et al.  Compressed Sensing with off-axis frequency-shifting holography , 2010, Optics letters.

[21]  Justin P. Haldar,et al.  Compressed-Sensing MRI With Random Encoding , 2011, IEEE Transactions on Medical Imaging.

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

[23]  慧 廣瀬 A Mathematical Introduction to Compressive Sensing , 2015 .

[24]  Joel A. Tropp,et al.  User-Friendly Tail Bounds for Sums of Random Matrices , 2010, Found. Comput. Math..

[25]  Pierre Weiss,et al.  HYR2PICS: Hybrid regularized reconstruction for combined parallel imaging and compressive sensing in MRI , 2012, 2012 9th IEEE International Symposium on Biomedical Imaging (ISBI).

[26]  B. Javidi,et al.  Compressive Fresnel Holography , 2010, Journal of Display Technology.

[27]  P. Boesiger,et al.  SENSE: Sensitivity encoding for fast MRI , 1999, Magnetic resonance in medicine.

[28]  E. Sidky,et al.  Accurate image reconstruction from few-views and limited-angle data in divergent-beam CT , 2009, 0904.4495.

[29]  Dennis Goeckel,et al.  Grouped incoherent measurements for compressive sensing , 2012, 2012 IEEE Statistical Signal Processing Workshop (SSP).

[30]  Patrick L. Combettes,et al.  Proximal Splitting Methods in Signal Processing , 2009, Fixed-Point Algorithms for Inverse Problems in Science and Engineering.

[31]  Pierre Weiss,et al.  From variable density sampling to continuous sampling using Markov chains , 2013, 1307.6960.

[32]  J. Steele Subadditive Euclidean Functionals and Nonlinear Growth in Geometric Probability , 1981 .

[33]  Joachim Weickert,et al.  Dithering by Differences of Convex Functions , 2011, SIAM J. Imaging Sci..

[34]  Seung-Jean Kim,et al.  A fast method for designing time-optimal gradient waveforms for arbitrary k-space trajectories , 2008, IEEE Transactions on Medical Imaging.

[35]  Emmanuel J. Candès,et al.  Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.

[36]  P. Lezaud Chernoff-type bound for finite Markov chains , 1998 .

[37]  D M Spielman,et al.  Magnetic resonance fluoroscopy using spirals with variable sampling densities , 1995, Magnetic resonance in medicine.

[38]  Massimo Fornasier,et al.  Compressive Sensing and Structured Random Matrices , 2010 .

[39]  Pierre Weiss,et al.  An Algorithm for Variable Density Sampling with Block-Constrained Acquisition , 2014, SIAM J. Imaging Sci..

[40]  Pierre Weiss,et al.  Travelling salesman-based variable density sampling , 2013 .

[41]  P. Diaconis,et al.  Geometric Bounds for Eigenvalues of Markov Chains , 1991 .

[42]  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.

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

[44]  Arkadi Nemirovski,et al.  On verifiable sufficient conditions for sparse signal recovery via ℓ1 minimization , 2008, Math. Program..

[45]  Pierre Vandergheynst,et al.  On Variable Density Compressive Sampling , 2011, IEEE Signal Processing Letters.

[46]  Yannick Boursier,et al.  Spread spectrum for imaging techniques in radio interferometry , 2009, ArXiv.

[47]  Holger Rauhut,et al.  Compressive Sensing with structured random matrices , 2012 .

[48]  Elfar Adalsteinsson,et al.  Simple analytic variable density spiral design , 2003, Magnetic resonance in medicine.

[49]  Rebecca Willett Errata : Sampling Trajectories for Sparse Image Recovery , 2011 .

[50]  Mark Jerrum,et al.  Approximating the Permanent , 1989, SIAM J. Comput..

[51]  David L Donoho,et al.  Compressed sensing , 2006, IEEE Transactions on Information Theory.

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

[53]  D. Paulin Concentration inequalities for Markov chains by Marton couplings and spectral methods , 2012, 1212.2015.

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