An algorithm for variable density sampling with block-constrained acquisition

DOI10.1137/130941560MaRDI QIDQ2876836zbMATH OpenOpenAlexFDO

Authors Claire Boyer, Pierre Weiss, Jérémie Bigot

Publication date 20 August 2014

Published in SIAM Journal on Imaging Sciences (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1310.4393

zbMATH Keywords

compressed sensingblocks of measurementsblock-constrained acquisitiondissimilarity measure between discrete probabilitiesoptimization on metric spaces

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Abstract: Reducing acquisition time is of fundamental importance in various imaging modalities. The concept of variable density sampling provides a nice framework to achieve this. It was justified recently from a theoretical point of view in the compressed sensing (CS) literature. Unfortunately, the sampling schemes suggested by current CS theories may not be relevant since they do not take the acquisition constraints into account (for example, continuity of the acquisition trajectory in Magnetic Resonance Imaging - MRI). In this paper, we propose a numerical method to perform variable density sampling with block constraints. Our main contribution is to propose a new way to draw the blocks in order to mimic CS strategies based on isolated measurements. The basic idea is to minimize a tailored dissimilarity measure between a probability distribution defined on the set of isolated measurements and a probability distribution defined on a set of blocks of measurements. This problem turns out to be convex and solvable in high dimension. Our second contribution is to define an efficient minimization algorithm based on Nesterov's accelerated gradient descent in metric spaces. We study carefully the choice of the metrics and of the prox function. We show that the optimal choice may depend on the type of blocks under consideration. Finally, we show that we can obtain better MRI reconstruction results using our sampling schemes than standard strategies such as equiangularly distributed radial lines.

Recommendations

• Variable density sampling with continuous trajectories
• On the generation of sampling schemes for magnetic resonance imaging
• Compressed sensing with structured sparsity and structured acquisition
• Optimal compressive imaging of Fourier data
• Energy preserved sampling for compressed sensing MRI

Cited in

(9)

• The quest for optimal sampling: computationally efficient, structure-exploiting measurements for compressed sensing
• Variable density sampling with continuous trajectories
• On the generation of sampling schemes for magnetic resonance imaging
• Sparsity/undersampling tradeoffs in anisotropic undersampling, with applications in MR imaging/spectroscopy
• Contrast invariant SNR and isotonic regressions
• Optimal Transport Approximation of 2-Dimensional Measures
• Submatrices with nonuniformly selected random supports and insights into sparse approximation
• Compressed sensing with structured sparsity and structured acquisition
• Lower bounds for parallel and randomized convex optimization

This page was built for publication: An algorithm for variable density sampling with block-constrained acquisition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2876836)