# US 2013/0278256 A1 · Self-constraint non-iterative grappa reconstruction with closed-form solution

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2013/0278256 A1
- Document ID: US20130278256A1
- Status: Published application
- Kind: A1
- Application number: 13/803,536
- Filed: 2013-03-14
- Published: 2013-10-24
- Earliest claimed: 2012-04-19
- Assignees: The Ohio State University
- Applicants: The Ohio State University
- Inventors: Rizwan Ahmad; Yu Ding; Orlando Simonetti; Samuel Tze Luong Ting; Hui Xue
- Web page: https://patentgrep.com/patent/US20130278256A1

## CPC

- G01R 33/5611: {Parallel magnetic resonance imaging, e.g. sensitivity encoding [SENSE], simultaneous acquisition of spatial harmonics [SMASH], unaliasing by Fourier encoding of the overlaps using the temporal dimension [UNFOLD], k-t-broad-use linear acquisition speed-up technique [k-t-BLAST], k-t-SENSE (structural details of arrays of sub-coils G01R33/3415)}
- G01R 33/4824: {using a non-Cartesian trajectory}
- G01R 33/5612: {Parallel RF transmission, i.e. RF pulse transmission using a plurality of independent transmission channels}
- G01R: MEASURING ELECTRIC VARIABLES; MEASURING MAGNETIC VARIABLES (indicating correct tuning of resonant circuits H03J3/12)

## Abstract

Parallel magnetic resonance imaging (pMRI) reconstruction techniques are commonly used to reduce scan time by undersampling the k-space data. In GRAPPA, a k-space based pMRI technique, the missing k-space data are estimated by solving a set of linear equations; however, this set of equations does not take advantage of the correlations within the missing k-space data. All k-space data in a neighborhood acquired from a phased-array coil are correlated. The correlation can be estimated easily as a self-constraint condition, and formulated as an extra set of linear equations to improve the performance of GRAPPA. We propose a modified k-space based pMRI technique call self-constraint GRAPPA (SC-GRAPPA) which combines the linear equations of GRAPPA with these extra equations to solve for the missing k-space data. Since SC-GRAPPA utilizes a least-squares solution of the linear equations, it has a closed-form solution that does not require an iterative solver.

## Claims

### Claim 1

A method of determining a Self-Constraint (SC) GeneRalized Autocalibrating Partially Parallel Acquisition (GRAPPA) reconstruction, comprising:
sampling k-space data as a set of ACS lines acquired from an MRI apparatus;
estimating a GRAPPA kernel from the ACS lines;
estimating a null projection matrix N from the ACS lines;
performing a GRAPPA reconstruction to calculate k0; and
calculating a k-space of the SC-GRAPPA in accordance with the GRAPPA reconstruction and a self-constraint condition defined by local k-space correlations among acquired and unacquired k-space samples.

### Claim 2 (depends on 1)

The method of claim 1, further comprising estimating the GRAPPA kernel using a linear regression.

### Claim 3 (depends on 1)

The method of claim 1, further comprising estimated the null projection matrix N using a parallel reconstruction using null operations (PRUNO) method.

### Claim 4 (depends on 3)

The method of claim 3, wherein the null projection matrix is defined by:
[
0
0
]
=
[
N
11
N
12
N
21
N
22
]

[
k
acq
k
unacq
]
,
wherein kunacq and kacq are vectorized unacquired and acquired k-space data, respectively,

### Claim 5 (depends on 1)

The method of claim 1, calculating a k-space of the SC-GRAPPA further comprising solving a set of linear equations in accordance with correlations within missing k-space data.

### Claim 6 (depends on 5)

The method of claim 5, wherein the set of linear equations are defined by:
k=k0+w; and
0=Nk+v,
wherein k0 represents the GRAPPA reconstruction, w and v are random noise terms, and k is vectorized local k-space data.

### Claim 7 (depends on 6)

The method of claim 6, wherein calculating the k-space of the SC-GRAPPA is performed in accordance with:
k=k0−RNT(Q+NRNT)−1Nk0,
where Q and R are covariance matrices of w and v, respectively.

### Claim 8 (depends on 1)

The method of claim 1, wherein the k-space of the SC-GRAPPA is performed using a least squares problem with prior estimation.

### Claim 9 (depends on 8)

The method of claim 8, wherein the prior estimation is k0.

### Claim 10 (depends on 1)

The method of claim 1, further comprising applying a channel combination using either the sum-of-squares or B1-weighted summation.

### Claim 11

A tangible computer-readable medium having computer executable instructions stored thereon that when executed by a processor of a computing device determines a Self-Constraint (SC) GeneRalized Autocalibrating Partially Parallel Acquisition (GRAPPA) reconstruction, comprising:
sampling k-space data, including a set of ACS lines, from an MRI apparatus;
estimating a GRAPPA kernel from the ACS lines;
estimating a null projection matrix N is estimated from the ACS lines;
performing a GRAPPA reconstruction to calculate k0; and
calculating a k-space of the SC-GRAPPA in accordance with the GRAPPA reconstruction and a self-constraint condition defined by local k-space correlations among acquired and unacquired k-space samples.

### Claim 12 (depends on 11)

The tangible computer-readable medium of claim 11, further comprising estimated the null projection matrix N using a parallel reconstruction using null operations (PRUNO) method.

### Claim 13 (depends on 11)

The tangible computer-readable medium of claim 11, calculating a k-space of the SC-GRAPPA further comprising solving a set of linear equations in accordance with correlations within missing k-space data.

### Claim 14 (depends on 13)

The tangible computer-readable medium of claim 13, wherein the set of linear equations are defined by:
k=k0+w; and
0=Nk+v,
wherein k0 represents the GRAPPA reconstruction, w and v are random noise terms, and k is vectorized local k-space data.

### Claim 15 (depends on 14)

The tangible computer-readable medium of claim 14, wherein calculating the k-space of the SC-GRAPPA is performed in accordance with:
k=k0−RNT(Q+NRNT)−1Nk0,
wherein Q and R are covariance matrices of w and v, respectively.

### Claim 16 (depends on 11)

The tangible computer-readable medium of claim 11, wherein the k-space of the SC-GRAPPA is performed using a least squares problem with prior estimation.

### Claim 17 (depends on 16)

The tangible computer-readable medium of claim 16, wherein the prior estimation is k0.

### Claim 18 (depends on 11)

The tangible computer-readable medium of claim 11, further comprising applying a channel combination using either the sum-of-squares or B1-weighted summation.

### Claim 19

An apparatus for determining a Self-Constraint (SC) GeneRalized Autocalibrating Partially Parallel Acquisition (GRAPPA) reconstruction, comprising:
a memory;
a processor executing computer executable instructions in the memory, the computer executable instructions,
wherein the apparatus samples k-space data on a set of ACS lines acquired from an MRI apparatus, estimates a GRAPPA kernel from the ACS lines, estimates a null projection matrix N from the ACS lines, performs a GRAPPA reconstruction to calculate k0, and calculates a k-space of the SC-GRAPPA in accordance with the GRAPPA reconstruction and a self-constraint condition defined by local k-space correlations among acquired and unacquired k-space samples.

### Claim 20 (depends on 19)

The apparatus of claim 19, wherein a k-space of the SC-GRAPPA is calculated by solving a set of linear equations in accordance with correlations within missing k-space data.
