# US 2026/0065557 A1 · System and method for subspace parallel imaging in k-space

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

- Number: US 2026/0065557 A1
- Document ID: US20260065557A1
- Status: Published application
- Kind: A1
- Application number: 18/989,531
- Filed: 2024-12-20
- Published: 2026-03-05
- Earliest claimed: 2024-08-30
- Assignees: GE Precision Healthcare LLC
- Applicants: GE Precision Healthcare LLC
- Inventors: Robert Marc Lebel
- Web page: https://patentgrep.com/patent/US20260065557A1

## CPC

- G06T 12/10: Image preprocessing, e.g. calibration, positioning of sources or scatter correction
- 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)}
- G06T 12/20: Inverse problem, i.e. transformations from projection space into object space
- G06T 2210/41: Medical
- G06T 2211/424: Iterative
- G06T 2211/441: AI-based methods, deep learning or artificial neural networks
- G06T: IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G01R: MEASURING ELECTRIC VARIABLES; MEASURING MAGNETIC VARIABLES (indicating correct tuning of resonant circuits H03J3/12)

## Abstract

A computer-implemented method includes obtaining, via a processing system including one or more processors, multi-channel k-space data of a subject acquired with a magnetic resonance imaging scanner. The computer-implemented method also includes utilizing, via the processing system, subspace convolutional kernels on the multi-channel k-space data to combine information from local neighboring k-space locations and across multiple channels to generate subspace compressed k-space data having fewer channels than a number of channels utilized to acquire the multi-channel k-space data.

## Claims

### Claim 1

A computer-implemented method, comprising:
obtaining, via a processing system comprising one or more processors, multi-channel k-space data of a subject acquired with a magnetic resonance imaging scanner; and
utilizing, via the processing system, subspace convolutional kernels on the multi-channel k-space data to combine information from local neighboring k-space locations and across multiple channels to generate subspace compressed k-space data having fewer channels than a number of channels utilized to acquire the multi-channel k-space data.

### Claim 2 (depends on 1)

The computer-implemented method of claim 1, further comprising utilizing, via the processing system, complex conjugates of the subspace convolutional kernels to perform transposed convolution on the subspace compressed k-space data to restore the multi-channel k-space data.

### Claim 3 (depends on 2)

The computer-implemented method of claim 2, wherein the subspace convolutional kernels comprise weights that provide consistency when the multi-channel k-space data is mapped down to the subspace compressed k-space data and the subspace compressed k-space data is restored to the multi-channel k-space data.

### Claim 4 (depends on 3)

The computer-implemented method of claim 3, wherein the multi-channel k-space data as originally acquired provides data consistency with the multi-channel k-space data after restoration.

### Claim 5 (depends on 4)

The computer-implemented method of claim 4, wherein the subspace convolution kernels are learnable.

### Claim 6 (depends on 5)

The computer-implemented method of claim 5, wherein the multi-channel k-space data is undersampled.

### Claim 7 (depends on 6)

The computer-implemented method of claim 6, further comprising:
in an iterative manner for a certain number of cycles:
performing, via the processing system, data consistency on the multi-channel k-space data after restoration;
mapping down, via the processing system, the multi-channel k-space data after restoration to the subspace compressed k-space data utilizing the subspace convolutional kernels; and
restoring, via the processing system, the subspace compressed k-space data to the multi-channel k-space data utilizing the complex conjugates of the subspace convolutional kernels; and
upon reaching the certain number of cycles, applying, via the processing system, a loss function in one or more locations.

### Claim 8 (depends on 7)

The computer-implemented method of claim 7, further comprising applying the loss function in a multi-channel domain between the multi-channel k-space data as originally acquired and the multi-channel k-space data after restoration.

### Claim 9 (depends on 7)

The computer-implemented method of claim 7, further comprising applying the loss function on subspace compressed data.

### Claim 10 (depends on 7)

The computer-implemented method of claim 7, further comprising applying the loss function on the subspace convolutional kernels.

### Claim 11 (depends on 7)

The computer-implemented method of claim 7, further comprising updating, via the processing system, parameters or weights of the subspace convolutional kernels utilizing gradient back projection upon reaching the certain number of cycles.

### Claim 12 (depends on 2)

The computer-implemented method of claim 2, further comprising performing, via the processing system, inverse Fourier transformation on the subspace compressed k-space data to generate subspace compressed image data utilizing a smaller number of inverse Fourier transforms than a number of inverse Fourier transforms needed to generate image data from the multi-channel k-space data as originally acquired.

### Claim 13 (depends on 12)

The computer-implemented method of claim 12, wherein the performing inverse Fourier transformation is part of iterative reconstruction or model-based reconstruction.

### Claim 14 (depends on 12)

The computer-implemented method of claim 12, further comprising performing, via the processing system, spatial regularization on the subspace compressed image data.

### Claim 15 (depends on 14)

The computer-implemented method of claim 14, further comprising performing, via the processing system, forward Fourier transformation on the subspace compressed image data after spatial regularization to generate the subspace compressed k-space data.

### Claim 16 (depends on 12)

The computer-implemented method of claim 12, further comprising performing, via the processing system, forward Fourier transformation on the subspace compressed image data to generate the subspace compressed k-space data.

### Claim 17

A system, comprising:
a memory encoding processor-executable routines; and
a processing system comprising one or more processors and configured to access the memory and to execute the processor-executable routines, wherein the processor-executable routines, when executed by the processing system, cause the processing system to:
obtain multi-channel k-space data of a subject acquired with a magnetic resonance imaging scanner; and
utilize subspace convolutional kernels on the multi-channel k-space data to combine information from local neighboring k-space locations and across multiple channels to generate subspace compressed k-space data having fewer channels than a number of channels utilized to acquire the multi-channel k-space data.

### Claim 18 (depends on 17)

The system of claim 17, wherein the processor-executable routines, when executed by the processing system, further cause the processing system to utilize complex conjugates of the subspace convolutional kernels to perform transposed convolution on the subspace compressed k-space data to restore the multi-channel k-space data.

### Claim 19

A non-transitory computer-readable medium, the non-transitory computer-readable medium comprising processor-executable code that when executed by a processing system comprising one or more processors, causes the processing system to:
obtain multi-channel k-space data of a subject acquired with a magnetic resonance imaging scanner; and
utilize subspace convolutional kernels on the multi-channel k-space data to combine information from local neighboring k-space locations and across multiple channels to generate subspace compressed k-space data having fewer channels than a number of channels utilized to acquire the multi-channel k-space data.

### Claim 20 (depends on 19)

The non-transitory computer-readable medium of claim 19, wherein the processor-executable code, when executed by the processing system, further causes the processing system to utilize complex conjugates of the subspace convolutional kernels to perform transposed convolution on the subspace compressed k-space data to restore the multi-channel k-space data.
