Browse
Submit Data
Databases
API
Help

Dataset Information

26 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Accelerated calibrationless parallel transmit mapping using joint transmit and receive low-rank tensor completion.

ABSTRACT:

Purpose

To evaluate an algorithm for calibrationless parallel imaging to reconstruct undersampled parallel transmit field maps for the body and brain.

Methods

Using a combination of synthetic data and in vivo measurements from brain and body, 3 different approaches to a joint transmit and receive low-rank tensor completion algorithm are evaluated. These methods included: 1) virtual coils using the product of receive and transmit sensitivities, 2) joint-receiver coils that enforces a low rank structure across receive coils of all transmit modes, and 3) transmit low rank that uses a low rank structure for both receive and transmit modes simultaneously. The performance of each is investigated for different noise levels and different acceleration rates on an 8-channel parallel transmit 7 Tesla system.

Results

The virtual coils method broke down with increasing noise levels or acceleration rates greater than 2, producing normalized RMS error greater than 0.1. The joint receiver coils method worked well up to acceleration factors of 4, beyond which the normalized RMS error exceeded 0.1. Transmit low rank enabled an eightfold acceleration, with most normalized RMS errors remaining below 0.1.

Conclusion

This work demonstrates that undersampling factors of up to eightfold are feasible for transmit array mapping and can be reconstructed using calibrationless parallel imaging methods.

SUBMITTER: Hess AT

PROVIDER: S-EPMC7611890 | biostudies-literature |

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Similar Datasets

Accelerated MR parameter mapping with low-rank and sparsity constraints.

Project description:To enable accurate magnetic resonance (MR) parameter mapping with accelerated data acquisition, utilizing recent advances in constrained imaging with sparse sampling.A new constrained reconstruction method based on low-rank and sparsity constraints is proposed to accelerate MR parameter mapping. More specifically, the proposed method simultaneously imposes low-rank and joint sparse structures on contrast-weighted image sequences within a unified mathematical formulation. With a pre-estimated subspace, this formulation results in a convex optimization problem, which is solved using an efficient numerical algorithm based on the alternating direction method of multipliers.To evaluate the performance of the proposed method, two application examples were considered: (i) T2 mapping of the human brain and (ii) T1 mapping of the rat brain. For each application, the proposed method was evaluated at both moderate and high acceleration levels. Additionally, the proposed method was compared with two state-of-the-art methods that only use a single low-rank or joint sparsity constraint. The results demonstrate that the proposed method can achieve accurate parameter estimation with both moderately and highly undersampled data. Although all methods performed fairly well with moderately undersampled data, the proposed method achieved much better performance (e.g., more accurate parameter values) than the other two methods with highly undersampled data.Simultaneously imposing low-rank and sparsity constraints can effectively improve the accuracy of fast MR parameter mapping with sparse sampling.

| S-EPMC4344441 | biostudies-literature

Robust Low-rank Tensor Decomposition with the

Project description: Not available

| S-EPMC10783176 | biostudies-literature

High-resolution dynamic 31 P-MRSI using a low-rank tensor model.

Project description:PURPOSE:To develop a rapid 31 P-MRSI method with high spatiospectral resolution using low-rank tensor-based data acquisition and image reconstruction. METHODS:The multidimensional image function of 31 P-MRSI is represented by a low-rank tensor to capture the spatial-spectral-temporal correlations of data. A hybrid data acquisition scheme is used for sparse sampling, which consists of a set of "training" data with limited k-space coverage to capture the subspace structure of the image function, and a set of sparsely sampled "imaging" data for high-resolution image reconstruction. An explicit subspace pursuit approach is used for image reconstruction, which estimates the bases of the subspace from the "training" data and then reconstructs a high-resolution image function from the "imaging" data. RESULTS:We have validated the feasibility of the proposed method using phantom and in vivo studies on a 3T whole-body scanner and a 9.4T preclinical scanner. The proposed method produced high-resolution static 31 P-MRSI images (i.e., 6.9 × 6.9 × 10 mm3 nominal resolution in a 15-min acquisition at 3T) and high-resolution, high-frame-rate dynamic 31 P-MRSI images (i.e., 1.5 × 1.5 × 1.6 mm3 nominal resolution, 30 s/frame at 9.4T). CONCLUSIONS:Dynamic spatiospectral variations of 31 P-MRSI signals can be efficiently represented by a low-rank tensor. Exploiting this mathematical structure for data acquisition and image reconstruction can lead to fast 31 P-MRSI with high resolution, frame-rate, and SNR. Magn Reson Med 78:419-428, 2017. © 2017 International Society for Magnetic Resonance in Medicine.

| S-EPMC5562044 | biostudies-literature

High-Resolution Oscillating Steady-State fMRI Using Patch-Tensor Low-Rank Reconstruction.

Project description:The goals of fMRI acquisition include high spatial and temporal resolutions with a high signal to noise ratio (SNR). Oscillating Steady-State Imaging (OSSI) is a new fMRI acquisition method that provides large oscillating signals with the potential for high SNR, but does so at the expense of spatial and temporal resolutions. The unique oscillation pattern of OSSI images makes it well suited for high-dimensional modeling. We propose a patch-tensor low-rank model to exploit the local spatial-temporal low-rankness of OSSI images. We also develop a practical sparse sampling scheme with improved sampling incoherence for OSSI. With an alternating direction method of multipliers (ADMM) based algorithm, we improve OSSI spatial and temporal resolutions with a factor of 12 acquisition acceleration and 1.3 mm isotropic spatial resolution in prospectively undersampled experiments. The proposed model yields high temporal SNR with more activation than other low-rank methods. Compared to the standard grad- ient echo (GRE) imaging with the same spatial-temporal resolution, 3D OSSI tensor model reconstruction demonstrates 2 times higher temporal SNR with 2 times more functional activation.

| S-EPMC7751316 | biostudies-literature

Eight-channel parallel transmit-receive system for 7 T MRI with optically controlled and monitored on-coil current-mode RF amplifiers.

Project description:PurposeTo demonstrate a practical implementation of an eight-channel parallel-transmit system for brain imaging at 7 T based on on-coil amplifier technology.MethodsAn eight-channel parallel transmit-receive system was built with optimized on-coil switch-mode current RF power amplifiers. The amplifiers were optically controlled from an eight-channel interface that was connected to a 7 T MRI scanner. The interface also optically received a down-converted version of the coil current sensed in each amplifier for monitoring and feedback adjustments.ResultsEach on-coil amplifier delivered more than 100 W peak power and provided enough amplifier decoupling (<-15 dB) for the implemented eight-channel array configuration. Phantom and human images were acquired to demonstrate practical operation of this new technology in a 7 T MRI scanner.ConclusionFurther development and improvement of previously demonstrated on-coil technology led to successful implementation of an eight-channel parallel-transmit system able to deliver strong B1 fields for typical brain imaging applications. This is an important step forward toward implementation of on-coil RF amplification for high-field MRI.

| S-EPMC7722142 | biostudies-literature

Multi-shot sensitivity-encoded diffusion data recovery using structured low-rank matrix completion (MUSSELS).

Project description:PurposeTo introduce a novel method for the recovery of multi-shot diffusion weighted (MS-DW) images from echo-planar imaging (EPI) acquisitions.MethodsCurrent EPI-based MS-DW reconstruction methods rely on the explicit estimation of the motion-induced phase maps to recover artifact-free images. In the new formulation, the k-space data of the artifact-free DWI is recovered using a structured low-rank matrix completion scheme, which does not require explicit estimation of the phase maps. The structured matrix is obtained as the lifting of the multi-shot data. The smooth phase-modulations between shots manifest as null-space vectors of this matrix, which implies that the structured matrix is low-rank. The missing entries of the structured matrix are filled in using a nuclear-norm minimization algorithm subject to the data-consistency. The formulation enables the natural introduction of smoothness regularization, thus enabling implicit motion-compensated recovery of the MS-DW data.ResultsOur experiments on in-vivo data show effective removal of artifacts arising from inter-shot motion using the proposed method. The method is shown to achieve better reconstruction than the conventional phase-based methods.ConclusionWe demonstrate the utility of the proposed method to effectively recover artifact-free images from Cartesian fully/under-sampled and partial Fourier acquired data without the use of explicit phase estimates. Magn Reson Med 78:494-507, 2017. © 2016 International Society for Magnetic Resonance in Medicine.

| S-EPMC5336529 | biostudies-literature

Accelerated High-Dimensional MR Imaging With Sparse Sampling Using Low-Rank Tensors.

Project description:High-dimensional MR imaging often requires long data acquisition time, thereby limiting its practical applications. This paper presents a low-rank tensor based method for accelerated high-dimensional MR imaging using sparse sampling. This method represents high-dimensional images as low-rank tensors (or partially separable functions) and uses this mathematical structure for sparse sampling of the data space and for image reconstruction from highly undersampled data. More specifically, the proposed method acquires two datasets with complementary sampling patterns, one for subspace estimation and the other for image reconstruction; image reconstruction from highly undersampled data is accomplished by fitting the measured data with a sparsity constraint on the core tensor and a group sparsity constraint on the spatial coefficients jointly using the alternating direction method of multipliers. The usefulness of the proposed method is demonstrated in MRI applications; it may also have applications beyond MRI.

| S-EPMC5487008 | biostudies-literature

A new method based on the manifold-alternative approximating for low-rank matrix completion.

Project description:In this paper, a new method is proposed for low-rank matrix completion which is based on the least squares approximating to the known elements in the manifold formed by the singular vectors of the partial singular value decomposition alternatively. The method can achieve a reduction of the rank of the manifold by gradually reducing the number of the singular value of the thresholding and get the optimal low-rank matrix. It is proven that the manifold-alternative approximating method is convergent under some conditions. Furthermore, compared with the augmented Lagrange multiplier and the orthogonal rank-one matrix pursuit algorithms by random experiments, it is more effective as regards the CPU time and the low-rank property.

| S-EPMC6290672 | biostudies-other

Multicomponent MR fingerprinting reconstruction using joint-sparsity and low-rank constraints.

Project description:PurposeTo develop an efficient algorithm for multicomponent MR fingerprinting (MC-MRF) reconstructions directly from highly undersampled data without making prior assumptions about tissue relaxation times and expected number of tissues.MethodsThe proposed method reconstructs MC-MRF maps from highly undersampled data by iteratively applying a joint-sparsity constraint to the estimated tissue components. Intermediate component maps are obtained by a low-rank multicomponent alternating direction method of multipliers (MC-ADMM) including the non-negativity of tissue weights as an extra regularization term. Over iterations, the used dictionary compression is adjusted. The proposed method (k-SPIJN) is compared with a two-step approach in which image reconstruction and multicomponent estimations are performed sequentially and tested in numerical simulations and in vivo by applying different undersampling factors in eight healthy volunteers. In the latter case, fully sampled data serves as the reference.ResultsThe proposed method shows improved precision and accuracy in simulations compared with a state-of-art sequential approach. Obtained in vivo magnetization fraction maps for different tissue types show reduced systematic errors and reduced noise-like effects. Root mean square errors in estimated magnetization fraction maps significantly reduce from 13.0% ± $$ \pm $$ 5.8% with the conventional, two-step approach to 9.6% ± $$ \pm $$ 3.9% and 9.6% ± $$ \pm $$ 3.2% with the proposed MC-ADMM and k-SPIJN methods, respectively. Mean standard deviation in homogeneous white matter regions reduced significantly from 8.6% to 2.9% (two step vs. k-SPIJN).ConclusionThe proposed MC-ADMM and k-SPIJN reconstruction methods estimate MC-MRF maps from highly undersampled data resulting in improved image quality compared with the existing method.

| S-EPMC9825911 | biostudies-literature

Efficient Dynamic Parallel MRI Reconstruction for the Low-Rank Plus Sparse Model.

Project description:The low-rank plus sparse (L+S) decomposition model enables the reconstruction of under-sampled dynamic parallel magnetic resonance imaging (MRI) data. Solving for the low-rank and the sparse components involves non-smooth composite convex optimization, and algorithms for this problem can be categorized into proximal gradient methods and variable splitting methods. This paper investigates new efficient algorithms for both schemes. While current proximal gradient techniques for the L+S model involve the classical iterative soft thresholding algorithm (ISTA), this paper considers two accelerated alternatives, one based on the fast iterative shrinkage-thresholding algorithm (FISTA), and the other with the recent proximal optimized gradient method (POGM). In the augmented Lagrangian (AL) framework, we propose an efficient variable splitting scheme based on the form of the data acquisition operator, leading to simpler computation than the conjugate gradient (CG) approach required by existing AL methods. Numerical results suggest faster convergence of the efficient implementations for both frameworks, with POGM providing the fastest convergence overall and the practical benefit of being free of algorithm tuning parameters.

| S-EPMC6867710 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data