Parallel MRI is a fast imaging technique that enables the acquisition of
highly resolved images in space or/and in time. The performance of parallel
imaging strongly depends on the reconstruction algorithm, which can proceed
either in the original k-space (GRAPPA, SMASH) or in the image domain
(SENSE-like methods). To improve the performance of the widely used SENSE
algorithm, 2D- or slice-specific regularization in the wavelet domain has been
deeply investigated.
Dual-tree wavelet decompositions have recently gained much popularity, mainly
due to their ability to provide an accurate directional analysis of images
combined with a reduced redundancy. When the decomposition of a random process
is performed -- which occurs in particular when an additive noise is corrupting
the signal to be analyzed -- it is useful to characterize the statistical
properties of the dual-tree wavelet coefficients of this process.
We propose a primal-dual splitting algorithm for solving monotone inclusions
involving a mixture of sums, linear compositions, and parallel sums of
set-valued and Lipschitzian operators. An important feature of the algorithm is
that the Lipschitzian operators present in the formulation can be processed
individually via explicit steps, while the set-valued operators are processed
individually via their resolvents. In addition, the algorithm is highly
parallel in that most of its steps can be executed simultaneously.
Parallel MRI is a fast imaging technique that enables the acquisition of
highly resolved images in space. It relies on $k$-space undersampling and
multiple receiver coils with complementary sensitivity profiles in order to
reconstruct a full Field-Of-View (FOV) image. The performance of parallel
imaging mainly depends on the reconstruction algorithm, which can proceed
either in the original $k$-space (GRAPPA, SMASH) or in the image domain
(SENSE-like methods).
The proximity operator of a convex function is a natural extension of the
notion of a projection operator onto a convex set. This tool, which plays a
central role in the analysis and the numerical solution of convex optimization
problems, has recently been introduced in the arena of signal processing, where
it has become increasingly important. In this paper, we review the basic
properties of proximity operators which are relevant to signal processing and
present optimization methods based on these operators.
To reduce scanning time and/or improve spatial/temporal resolution in some
MRI applications, parallel MRI (pMRI) acquisition techniques with multiple
coils acquisition have emerged since the early 1990s as powerful 3D imaging
methods that allow faster acquisition of reduced Field of View (FOV) images. In
these techniques, the full FOV image has to be reconstructed from the resulting
acquired undersampled k-space data. To this end, several reconstruction
techniques have been proposed such as the widely-used SENSE method.
To reduce scanning time and/or improve spatial/temporal resolution in some
MRI applications, parallel MRI (pMRI) acquisition techniques with multiple
coils acquisition have emerged since the early 1990s as powerful 3D imaging
methods that allow faster acquisition of reduced Field of View (FOV) images. In
these techniques, the full FOV image has to be reconstructed from the resulting
acquired undersampled k-space data. To this end, several reconstruction
techniques have been proposed such as the widely-used SENSE method.