IP Library Granted Patent US 12,586,277
Granted Patent B2
US 12,586,277 · App. 18/358,158 · Granted Mar 24, 2026

Quasi-Newton MRI deep learning reconstruction

Inventors: Simon Arberet (Princeton, NJ); Marcel Dominik Nickel (Herzogenaurach, DE)
Assignee: Siemens Healthineers AG
G06T11/006A61B5/055A61B5/7264A61B5/742G01R33/4818G01R33/5608G06T2211/424G06T2211/441
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,586,277
App. No.
18/358,158
Granted
Mar 24, 2026
Kind
B2
Abstract

Systems and methods reconstruction for a medical imaging system using a quasi-newton method. An unrolled iterative reconstruction process is used to reconstruct an image from the scan data. The unrolled iterative reconstruction process includes a plurality of cascades that include at least a data-consistency step and a regularization step. The data-consistency step is modified based at least in part on information of already calculated gradients of one or more previous cascades of the plurality of cascades using a quasi-newton computation.

Claims (34)

1 . A system for reconstruction of a magnetic resonance image, the system comprising:

a medical imaging scanner configured to acquire under sampled k-space data of a patient; and

an image processor configured to reconstruct and output the magnetic resonance image from the under sampled k-space data using an unrolled iterative reconstruction process comprising an inverse problem, wherein each iteration of the unrolled iterative reconstruction process comprises a data-consistency step and a regularization step performed by a trained neural network, wherein the image processor is configured to compute the data-consistency step, for each cascade, using a quasi-Newton preconditioner that is dynamically adapted to a locally trained data-consistency loss of a current cascade by an:

initialization of the quasi-Newton preconditioner using a direct sensitivity encoding (SENSE) pseudo-inverse matrix;

an update of the quasi-Newton preconditioner using a limited-memory Broyden-Fletcher-Goldfarb-Shanno (L-BFGS) algorithm with gradients and inputs retained from previous cascades; and

an application of the updated quasi-Newton preconditioner to a gradient direction that is weighted in the k-space domain by a learned density-compensation function.

2 . The system of claim 1 , further comprising:

a display configured to display the magnetic resonance image.

3 . The system of claim 1 , wherein the under sampled k-space data is under sampled using a general pattern.

4 . The system of claim 3 , wherein the unrolled iterative reconstruction process comprises a proximal optimization step that balances the data-consistency steps and the regularization steps.

5 . The system of claim 1 , wherein the under sampled k-space data is under sampled using a regular pattern.

6 . The system of claim 1 , wherein the image processor is configured to calculate coil sensitivity data from a reference scan and perform a singular value decomposition to compute a data-consistency term for the data-consistency step.

7 . A method for MR image reconstruction, the method comprising:

acquiring, by a medical imaging scanner, under sampled k-space data acquired using a general pattern;

reconstructing the MR image from the under sampled k-space data using an unrolled iterative reconstruction comprising an inverse problem, wherein each iteration of the unrolled iterative reconstruction comprises a data-consistency step and a regularization step performed by a trained neural network, wherein the data-consistency step is computed, for each cascade, using a quasi-Newton preconditioner that is dynamically adapted to a locally trained data-consistency loss of the current cascade by:

initializing of the quasi-Newton preconditioner using a direct sensitivity encoding (SENSE) pseudo-inverse matrix;

updating the quasi-Newton preconditioner using a limited-memory Broyden-Fletcher-Goldfarb-Shanno (L-BFGS) algorithm with gradients and inputs retained from previous cascades; and

applying the updated quasi-Newton preconditioner to a gradient direction that is weighted in the k-space domain by a learned density-compensation function; and

outputting the reconstructed MR image.

8 . The method of claim 7 , wherein for the unrolled iterative reconstruction, an image prior is weighted differently in an image space.

9 . The method of claim 7 , further comprising applying a density-compensation function to the optimization that weights k-space coefficients differently.

10 . The method of claim 7 , wherein the regularization step is performed using a convolutional neural network.

11 . A method for MR image reconstruction, the method comprising:

acquiring, by a medical imaging scanner, under sampled k-space data acquired using a regular sampling pattern;

reconstructing the MR image using an unrolled iterative reconstruction that is formulated as an inverse problem, wherein each iteration of the unrolled iterative reconstruction comprises a data-consistency step and a regularization step performed by a trained neural network, wherein the data-consistency step is computed, for each cascade, using a quasi-Newton preconditioner that is dynamically adapted to a locally trained data-consistency loss of the current cascade by:

initializing of the quasi-Newton preconditioner using a direct sensitivity encoding (SENSE) pseudo-inverse matrix;

updating the quasi-Newton preconditioner using a limited-memory Broyden-Fletcher-Goldfarb-Shanno (L-BFGS) algorithm with gradients and inputs retained from previous cascades; and

applying the updated quasi-Newton preconditioner to a gradient direction that is weighted in the k-space domain by a learned density-compensation function; and

outputting the reconstructed MR image.

12 . The method of claim 11 , wherein initializing the quasi-Newton preconditioner using the direct sensitivity encoding (SENSE) pseudo-inverse matrix comprises performing a singular value decomposition of an encoding matrix that represents a combination of a Fourier operator, a coil-sensitivity matrix, and a sampling operator, and computing a regularized inverse of an encoding matrix from the singular value decomposition by truncating or thresholding small singular values to improve conditioning of the quasi-Newton preconditioner.

13 . The method of claim 12 , further comprising:

calculating a coil sensitivity data from a reference scan;

decoupling an encoding matrix into aliased blocks; and

performing the singular value decomposition on each of the aliased blocks.

Assignments (4)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 20, 2023
From: SIEMENS HEALTHCARE GMBH
To: SIEMENS HEALTHINEERS AG
Reel/Frame 066267/0346 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 14, 2023
From: SIEMENS MEDICAL SOLUTIONS USA, INC.
To: SIEMENS HEALTHCARE GMBH
Reel/Frame 065553/0437 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 8, 2023
From: NICKEL, MARCEL DOMINIK
To: SIEMENS HEALTHCARE GMBH
Reel/Frame 065491/0493 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 7, 2023
From: ARBERET, SIMON
To: SIEMENS MEDICAL SOLUTIONS USA, INC.
Reel/Frame 064828/0646 →
Continuity (2)
Provisional Application 63498354 · Apr 26, 2023
Related Publication 20240362835A1 · Oct 31, 2024
References Cited (12)
Hosseini et al (Unrolled Physics-Based Deep Learning MRI Reconstruction with Dense Connections using Nesterov Acceleration, 2020). [cited by examiner]
Iyer et al (Accelerating Convergence of Proximal Methods for Compressed Sensing using Polynomials with Application to MRI, 2022). [cited by examiner]
Sterck et al (Nonlinearly Preconditioned L-BFGS as an Acceleration Mechanism for Alternating Least Squares, with Application to Tensor Decomposition, Jun. 27, 2018). [cited by examiner]
Uecker et al (ESPIRiT—An Eigenvalue Approach to Autocalibrating Parallel MRI, Mar. 2014). [cited by examiner]
Aggarwal, Hemant K., Merry P. Mani, and Mathews Jacob. “MoDL: Model-based deep learning architecture for inverse problems.” IEEE transactions on medical imaging 38.2 (2018): 394-405. [cited by applicant]
Bertsekas, Dimitri P. “Nonlinear programming.” Journal of the Operational Research Society 48, No. 3 (1997): 334-334. [cited by applicant]
Huang, Gao, et al. “Convolutional networks with dense connectivity.” IEEE transactions on pattern analysis and machine intelligence 44.12 (2019): 8704-8716. [cited by applicant]
Liang, Jingyun, et al. “Swinir: Image restoration using swin transformer.” Proceedings of the IEEE/CVF international conference on computer vision. 2021. (pp. 1833-1844). [cited by applicant]
Nocedal, Jorge. “Updating quasi-Newton matrices with limited storage.” Mathematics of computation 35.151 (1980): 773-782. [cited by applicant]
Ronneberger, Olaf, Philipp Fischer, and Thomas Brox. “U-net: Convolutional networks for biomedical image segmentation.” In International Conference on Medical image computing and computer-assisted intervention, pp. 234-… [cited by applicant]
Yu, Songhyun, Bumjun Park, and Jechang Jeong. “Deep iterative down-up cnn for image denoising.” Proceedings of the IEEE/CVF conference on computer vision and pattern recognition workshops. 2019. 1-9. [cited by applicant]
Zhang, Kai, et al. “Practical blind denoising via swin-conv-unet and data synthesis.” arXiv preprint arXiv:2203.13278 (2022). [cited by applicant]