Rank-deficient and discrete ill-posed problems: numerical aspects of linear inversion
Rank-deficient and discrete ill-posed problems: numerical aspects of linear inversion
Decoding by linear programming
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
IEEE Transactions on Information Theory
Feature-enhanced synthetic aperture radar image formation based on nonquadratic regularization
IEEE Transactions on Image Processing
Hi-index | 0.00 |
In Magnetic Resonance Imaging (MRI) studies, for clinical applications and for research as well, reduction of scanning time is an essential issue. This time reduction could be obtained by using fast acquisition sequences, such as EPI and spiral k-space trajectories, and by acquiring less data, this being possible based on the new sampling theories that gave rise to the so called Compressed Sampling (CS for short). However the main assumption for the application of CS to Fourier data is that magnitude and phase are both sparse in some given domain. This assumption is not always true for fast acquisition sequences because of the non-homogeneities of the main magnetic field. In this article we propose a new model for MRI with different regularization penalties for magnitude and phase. Magnitude regularization exploits the sparsity assumption on the signal and the suggested penalty for phase takes into account its smoothness. We show results of numerical experiments with simulated data.