Efficient large-array k-domain parallel MRI using channel-by-channel array reduction

Shuo Feng, Yudong Zhu, Jim Ji

Research output: Contribution to journalArticle

11 Citations (Scopus)

Abstract

This article presents a method to explore the flexibility of channel reduction in k-domain parallel imaging (PI) with massive arrays to improve the computation efficiency. In PI, computation cost increases with the number of channels. For the k-domain methods requiring channel-by-channel reconstruction, this increase can be significant with massive arrays. In this article, a method for efficient k-domain PI reconstruction in large array systems is proposed. The method is based on the fact that in large arrays the channel sensitivity is localized, which allows channel reduction through channel cross correlation. The method is tested with simulated and in vivo MRI data from a 32-channel and 64-channel systems using the multicolumn multiline interpolation (MCMLI) method. Results show that the proposed algorithm can achieve similar or improved reconstruction quality with significantly reduced computation time for massive arrays with localized sensitivity.

Original languageEnglish
Pages (from-to)209-215
Number of pages7
JournalMagnetic Resonance Imaging
Volume29
Issue number2
DOIs
Publication statusPublished - Feb 2011
Externally publishedYes

Fingerprint

Magnetic resonance imaging
Imaging techniques
Interpolation
Costs
Costs and Cost Analysis

Keywords

  • Channel reduction
  • GRAPPA
  • Large arrays
  • MCMLI
  • Parallel imaging

ASJC Scopus subject areas

  • Biophysics
  • Radiology Nuclear Medicine and imaging
  • Biomedical Engineering

Cite this

Efficient large-array k-domain parallel MRI using channel-by-channel array reduction. / Feng, Shuo; Zhu, Yudong; Ji, Jim.

In: Magnetic Resonance Imaging, Vol. 29, No. 2, 02.2011, p. 209-215.

Research output: Contribution to journalArticle

@article{448a171e9a22453882f82f797c1e75e7,
title = "Efficient large-array k-domain parallel MRI using channel-by-channel array reduction",
abstract = "This article presents a method to explore the flexibility of channel reduction in k-domain parallel imaging (PI) with massive arrays to improve the computation efficiency. In PI, computation cost increases with the number of channels. For the k-domain methods requiring channel-by-channel reconstruction, this increase can be significant with massive arrays. In this article, a method for efficient k-domain PI reconstruction in large array systems is proposed. The method is based on the fact that in large arrays the channel sensitivity is localized, which allows channel reduction through channel cross correlation. The method is tested with simulated and in vivo MRI data from a 32-channel and 64-channel systems using the multicolumn multiline interpolation (MCMLI) method. Results show that the proposed algorithm can achieve similar or improved reconstruction quality with significantly reduced computation time for massive arrays with localized sensitivity.",
keywords = "Channel reduction, GRAPPA, Large arrays, MCMLI, Parallel imaging",
author = "Shuo Feng and Yudong Zhu and Jim Ji",
year = "2011",
month = "2",
doi = "10.1016/j.mri.2010.08.008",
language = "English",
volume = "29",
pages = "209--215",
journal = "Magnetic Resonance Imaging",
issn = "0730-725X",
publisher = "Elsevier Inc.",
number = "2",

}

TY - JOUR

T1 - Efficient large-array k-domain parallel MRI using channel-by-channel array reduction

AU - Feng, Shuo

AU - Zhu, Yudong

AU - Ji, Jim

PY - 2011/2

Y1 - 2011/2

N2 - This article presents a method to explore the flexibility of channel reduction in k-domain parallel imaging (PI) with massive arrays to improve the computation efficiency. In PI, computation cost increases with the number of channels. For the k-domain methods requiring channel-by-channel reconstruction, this increase can be significant with massive arrays. In this article, a method for efficient k-domain PI reconstruction in large array systems is proposed. The method is based on the fact that in large arrays the channel sensitivity is localized, which allows channel reduction through channel cross correlation. The method is tested with simulated and in vivo MRI data from a 32-channel and 64-channel systems using the multicolumn multiline interpolation (MCMLI) method. Results show that the proposed algorithm can achieve similar or improved reconstruction quality with significantly reduced computation time for massive arrays with localized sensitivity.

AB - This article presents a method to explore the flexibility of channel reduction in k-domain parallel imaging (PI) with massive arrays to improve the computation efficiency. In PI, computation cost increases with the number of channels. For the k-domain methods requiring channel-by-channel reconstruction, this increase can be significant with massive arrays. In this article, a method for efficient k-domain PI reconstruction in large array systems is proposed. The method is based on the fact that in large arrays the channel sensitivity is localized, which allows channel reduction through channel cross correlation. The method is tested with simulated and in vivo MRI data from a 32-channel and 64-channel systems using the multicolumn multiline interpolation (MCMLI) method. Results show that the proposed algorithm can achieve similar or improved reconstruction quality with significantly reduced computation time for massive arrays with localized sensitivity.

KW - Channel reduction

KW - GRAPPA

KW - Large arrays

KW - MCMLI

KW - Parallel imaging

UR - http://www.scopus.com/inward/record.url?scp=79451472530&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79451472530&partnerID=8YFLogxK

U2 - 10.1016/j.mri.2010.08.008

DO - 10.1016/j.mri.2010.08.008

M3 - Article

VL - 29

SP - 209

EP - 215

JO - Magnetic Resonance Imaging

JF - Magnetic Resonance Imaging

SN - 0730-725X

IS - 2

ER -