CN112710975A - Magnetic resonance diffusion image reconstruction method based on sparse and local low-rank matrix decomposition - Google Patents

Magnetic resonance diffusion image reconstruction method based on sparse and local low-rank matrix decomposition Download PDF

Info

Publication number
CN112710975A
CN112710975A CN202110098931.XA CN202110098931A CN112710975A CN 112710975 A CN112710975 A CN 112710975A CN 202110098931 A CN202110098931 A CN 202110098931A CN 112710975 A CN112710975 A CN 112710975A
Authority
CN
China
Prior art keywords
magnetic resonance
image
sparse
local
resonance diffusion
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202110098931.XA
Other languages
Chinese (zh)
Inventor
黄建平
李锐
李飞
朱良宽
宋文龙
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Northeast Forestry University
Original Assignee
Northeast Forestry University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Northeast Forestry University filed Critical Northeast Forestry University
Priority to CN202110098931.XA priority Critical patent/CN112710975A/en
Publication of CN112710975A publication Critical patent/CN112710975A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G01MEASURING; TESTING
    • G01RMEASURING ELECTRIC VARIABLES; MEASURING MAGNETIC VARIABLES
    • G01R33/00Arrangements or instruments for measuring magnetic variables
    • G01R33/20Arrangements or instruments for measuring magnetic variables involving magnetic resonance
    • G01R33/44Arrangements or instruments for measuring magnetic variables involving magnetic resonance using nuclear magnetic resonance [NMR]
    • G01R33/48NMR imaging systems
    • G01R33/54Signal processing systems, e.g. using pulse sequences ; Generation or control of pulse sequences; Operator console
    • G01R33/56Image enhancement or correction, e.g. subtraction or averaging techniques, e.g. improvement of signal-to-noise ratio and resolution
    • G01R33/563Image enhancement or correction, e.g. subtraction or averaging techniques, e.g. improvement of signal-to-noise ratio and resolution of moving material, e.g. flow contrast angiography
    • G01R33/56341Diffusion imaging
    • AHUMAN NECESSITIES
    • A61MEDICAL OR VETERINARY SCIENCE; HYGIENE
    • A61BDIAGNOSIS; SURGERY; IDENTIFICATION
    • A61B5/00Measuring for diagnostic purposes; Identification of persons
    • A61B5/05Detecting, measuring or recording for diagnosis by means of electric currents or magnetic fields; Measuring using microwaves or radio waves 
    • A61B5/055Detecting, measuring or recording for diagnosis by means of electric currents or magnetic fields; Measuring using microwaves or radio waves  involving electronic [EMR] or nuclear [NMR] magnetic resonance, e.g. magnetic resonance imaging

Landscapes

  • Health & Medical Sciences (AREA)
  • Physics & Mathematics (AREA)
  • Nuclear Medicine, Radiotherapy & Molecular Imaging (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • General Health & Medical Sciences (AREA)
  • Engineering & Computer Science (AREA)
  • High Energy & Nuclear Physics (AREA)
  • Radiology & Medical Imaging (AREA)
  • Surgery (AREA)
  • Biophysics (AREA)
  • Heart & Thoracic Surgery (AREA)
  • Medical Informatics (AREA)
  • Molecular Biology (AREA)
  • Pathology (AREA)
  • Animal Behavior & Ethology (AREA)
  • Biomedical Technology (AREA)
  • Public Health (AREA)
  • Veterinary Medicine (AREA)
  • Vascular Medicine (AREA)
  • Signal Processing (AREA)
  • Condensed Matter Physics & Semiconductors (AREA)
  • General Physics & Mathematics (AREA)
  • Magnetic Resonance Imaging Apparatus (AREA)

Abstract

The invention discloses a magnetic resonance diffusion image reconstruction method based on sparse and local low-rank matrix decomposition, belongs to the technical field of digital image processing, and particularly relates to a magnetic resonance diffusion weighted imaging technology; the magnetic resonance diffusion image reconstruction method comprises the steps of firstly obtaining k-space undersampled data, calculating an initial reconstructed image, then constructing a magnetic resonance diffusion image compressed sensing reconstruction model based on sparse and local low-rank matrix decomposition, solving a magnetic resonance diffusion image background component by adopting a singular value soft threshold method, solving a sparse component by adopting a soft threshold algorithm, then updating the reconstructed image by adopting data consistency, and finally judging whether to continue iteration or obtain a final result of the reconstructed image according to whether a convergence condition is met or not; the magnetic resonance diffusion image reconstruction method based on sparse and local low-rank matrix decomposition can retain the detail information of the image, realize the high-quality reconstruction of DW images in a plurality of different diffusion directions and accelerate the heart magnetic resonance diffusion imaging speed.

Description

Magnetic resonance diffusion image reconstruction method based on sparse and local low-rank matrix decomposition
Technical Field
The invention discloses a magnetic resonance diffusion image reconstruction method based on sparse and local low-rank matrix decomposition, belongs to the technical field of digital image processing, and particularly relates to a magnetic resonance diffusion weighted imaging technology.
Background
The magnetic resonance diffusion imaging deduces the microstructure of the tissue by measuring the diffusion information of water molecules, has the advantages of non-invasion, no need of contrast agents and the like, and is the mainstream non-invasive method for detecting the microstructure information of the living tissue at present. Magnetic resonance Diffusion Tensor Imaging (DTI) is a magnetic resonance Diffusion Imaging method that describes the Diffusion movement of water molecules in biological tissues as a Diffusion Tensor. The Diffusion tensor for each voxel is computed by measuring more than 6 Diffusion Weighted (DW) images of different Diffusion gradient directions (not coplanar). The diffusion tensor reflects the diffusion anisotropy characteristics of water molecules in the voxel, and the fiber structure information of the tissue can be estimated. However, magnetic resonance diffusion imaging is slow and susceptible to motion. In the imaging process, the displacement of water molecules generated by respiratory motion and heart pulsation is far larger than the displacement caused by the self diffusion of the water molecules, so that a diffusion signal is additionally attenuated, the signal-to-noise ratio is reduced, and the reconstruction of myocardial fibers is seriously influenced.
Reducing the data volume is an effective method for improving the imaging speed, shortening the data acquisition time and reducing the motion influence. However, the conventional k-space undersampling scheme is difficult to realize high sparse sampling and high quality data reconstruction, limited by hardware conditions and theory. Compressed Sensing (CS) theory is a newly proposed nonlinear signal sampling theory, which indicates that a compressible signal can be nearly lossless restored to an original signal by a nonlinear reconstruction method using a priori knowledge of signal sparsity and the like, from a data amount far below that required by the Nyquist sampling theorem. Magnetic resonance diffusion tensor imaging acquires spectral data, i.e., k-space data, of DW images. The method comprises the steps of obtaining k-space sparse sampling data by performing down-sampling on original frequency spectrum data, and then reconstructing a magnetic resonance diffusion image from the k-space sparse sampling data through a nonlinear reconstruction method by utilizing prior knowledge such as signal sparsity. The reconstruction result influences the calculation of the diffusion tensor, and further influences the accuracy of the reconstruction of the myocardial fibers. How to utilize the essential characteristics of limited k-space data and a magnetic resonance diffusion image, solving the nonlinear reconstruction problem through prior condition constraint, inhibiting interference factors such as artifacts and noises, and reconstructing a high-quality magnetic resonance diffusion image is the key for accurately reconstructing a myocardial fiber structure.
In magnetic resonance diffusion imaging, magnetic resonance diffusion weighted images acquired from different diffusion directions image the same anatomical tissue, so that the images have relevance and correlation of physical information essentially. Due to the fact that the magnetic resonance diffusion weighting image has sparsity, and meanwhile, images in different diffusion gradient directions have low rank. Therefore, the Compressive sensing-based magnetic resonance Diffusion Imaging k-space undersampling reconstruction method usually adopts Low Rank constraint as prior information, and the common methods include a GLR (global Low Rank) Model introduced in an article "Phase-Constrained Low-Rank Model for Compressive Diffusion-Weighted MRI" and an article "Accelerated Heart Diffusion furnace Imaging Using Joint Low-Rank and sparse Constraints"; the LLR Model introduced in the article "influencing cardiac dispersion sensitivity Imaging combining local low-rank and 3D TV constraint", the L + S Model introduced in the article "Model-based compensated dispersion sensitivity Imaging" and the article "Parallel Imaging and compensated Combined frame for influencing High-Resolution dispersion sensitivity Imaging Using Inter-Image Correlation", etc.
However, these reconstruction algorithms do not sufficiently exploit sparsity of the magnetic resonance diffusion image and correlation information of the diffusion image in different diffusion gradient directions, and further improvement in the reconstructed image quality and the like is desired.
Disclosure of Invention
In order to solve the problem of low reconstruction effect of the existing reconstruction algorithm, the invention considers the characteristics of the cardiac magnetic resonance diffusion imaging, fully utilizes the sparsity and the correlation of magnetic resonance diffusion weighted images in different diffusion directions, and provides a magnetic resonance diffusion image reconstruction method based on sparse and local low-rank matrix decomposition, so that the detail information of the images can be reserved, the high-quality reconstruction of DW images in a plurality of different diffusion directions is realized, and the cardiac magnetic resonance diffusion imaging speed is accelerated.
The purpose of the invention is realized as follows:
the magnetic resonance diffusion image reconstruction method based on sparse and local low-rank matrix decomposition comprises the following steps:
step a, obtaining frequency domain data, namely k space data y, by adopting a random undersampling scheme; zero filling processing is carried out on the data which are not collected, inverse Fourier transform is carried out on the data which are subjected to the zero filling processing, and an initial reconstruction image X is obtained0
B, constructing a magnetic resonance diffusion image compressed sensing reconstruction model based on sparse and local low-rank matrix decomposition;
step c, solving the background component L of the magnetic resonance diffusion image by adopting a singular value soft threshold method, wherein,
Figure BDA0002915007760000021
Nx,Nyrepresenting the number of pixels of the magnetic resonance diffusion image, NdThe magnetic resonance diffusion gradient direction number is shown, and the magnetic resonance diffusion image background component L in the k iteration process is shown as Lk
Step d, solving the sparse component S by adopting a soft threshold algorithm, wherein,
Figure BDA0002915007760000022
the sparse component S in the kth iteration is represented as Sk
And e, updating the reconstructed image X by adopting data consistency, wherein,
Figure BDA0002915007760000023
the reconstructed image X in the kth iteration is denoted Xk
Step f, judging whether the convergence condition is met, if:
if not, returning to the step b;
then, the final result of the reconstructed image X is obtained.
The magnetic resonance diffusion image reconstruction method based on sparse and local low-rank matrix decomposition comprises the following specific steps of:
Figure BDA0002915007760000031
in the formula:
min represents a minimization function;
Furepresents a random undersampling of k-space and has: fuPF, where P is a random undersampling scheme and F denotes fourier transform;
Rbrepresenting a local 3D image block extraction operation;
Ω represents a set of all local 3D image blocks;
Ψ represents a sparse transform;
|| ||2represents the l2 norm;
|| ||1is a norm of l 1;
||||*is a nuclear norm;
Σ denotes a summation symbol;
both τ and λ represent regularization parameters.
The magnetic resonance diffusion image reconstruction method based on sparse and local low-rank matrix decomposition comprises the following specific steps of:
extraction operation R with local 3D image blocksbFor the image Lk-1=Xk-1-Sk-1Extracting a series of overlapping image blocks, using Rb Lk-1Represents; extracted local 3D image block size of [ n ]x×ny,nd]I.e. Rb Lk-1Has a size of [ n ]x×ny,nd](ii) a Solving a low-rank matrix formed by local 3D image blocks by adopting an iterative singular value soft threshold method, wherein the low-rank matrix is expressed as [ u [ ]bb,vb]=SVD(RbLk-1) Obtaining a processed local 3D image block matrix ubΛτb)vb(ii) a Inverse operation R with local 3D image block extractionb TObtaining a background component L of the reconstructed magnetic resonance diffusion imagekIs shown as
Figure BDA0002915007760000032
Wherein, Λα(x) For soft threshold operation, denoted as
Figure BDA0002915007760000033
α is a threshold value.
In the magnetic resonance diffusion image reconstruction method based on sparse and local low-rank matrix decomposition, in step d:
for soft threshold operation, one of two schemes is employed:
in the first scheme, all local image blocks adopt the same threshold;
according to the second scheme, different thresholds are adopted for each local image block; the threshold value is selected by adopting an empirical value.
The magnetic resonance diffusion image reconstruction method based on sparse and local low-rank matrix decomposition comprises the following specific steps of:
the sparse component S is obtained by adopting a soft threshold algorithm and is expressed as Sk=ΨTα(Ψ(Xk-1-Lk-1) ))) wherein, Λ isα(x) For soft threshold operation, denoted as
Figure BDA0002915007760000041
α is a threshold value, Ψ is a sparse transform, ΨTThe inverse of it.
The sparse transform adopts an orthogonal transform basis.
The orthogonal transformation base is discrete wavelet transformation.
The magnetic resonance diffusion image reconstruction method based on sparse and local low-rank matrix decomposition comprises the following specific steps of:
updating a reconstructed image X with data consistency, denoted Xk=Lk+Sk-(Fu)T(Fu(Lk+Sk) -y) wherein FuFor k-space undersampling operations, (F)u)TIs FuThe inverse of (1).
In the magnetic resonance diffusion image reconstruction method based on sparse and local low-rank matrix decomposition, the convergence condition is one of the following two conditions:
setting a maximum iteration number K under the condition one;
second, the difference of the quality of the reconstructed image is less than a certain specified threshold tol and is expressed as
Figure BDA0002915007760000042
Has the advantages that:
the invention provides a magnetic resonance diffusion image reconstruction method based on sparse and local low-rank matrix decomposition, which comprises the steps of firstly adopting a random undersampling scheme to obtain frequency domain data, carrying out zero filling processing on data which are not acquired, and carrying out inverse Fourier transform on the data subjected to the zero filling processing to obtain an initial reconstruction image; then constructing a magnetic resonance diffusion image compressed sensing reconstruction model based on sparse and local low-rank matrix decomposition; then solving the background component of the magnetic resonance diffusion image by adopting a singular value soft threshold method, solving the sparse component by adopting a soft threshold algorithm, then updating the reconstructed image by adopting data consistency, and finally selecting continuous iteration or obtaining the final result of the reconstructed image according to whether the convergence condition is met. The steps are taken as a whole, the sparsity and the correlation of the magnetic resonance diffusion weighted images in different diffusion directions are fully utilized, further, the detail information of the images can be kept, the high-quality reconstruction of the DW images in a plurality of different diffusion directions is realized, and the heart magnetic resonance diffusion imaging speed is accelerated.
Drawings
Fig. 1 is a flow chart of the magnetic resonance diffusion image reconstruction method based on sparse and local low-rank matrix decomposition of the present invention.
Fig. 2 is a diagram showing the number of pixels and the number of gradient directions in a magnetic resonance diffusion image.
Fig. 3 is a schematic diagram of a one-dimensional random variable density sampling scheme.
Fig. 4 is a schematic diagram of a two-dimensional random variable density sampling scheme.
Fig. 5 shows a schematic diagram of a partial 3D image block extraction operation.
Fig. 6 is an initial reconstructed image obtained using a one-dimensional random variable density sampling scheme.
Fig. 7 is a final reconstructed image obtained using a one-dimensional random variable density sampling scheme.
Detailed Description
The following describes embodiments of the present invention in further detail with reference to the accompanying drawings.
Detailed description of the invention
In the magnetic resonance diffusion image reconstruction method based on sparse and local low-rank matrix decomposition according to the present embodiment, a flowchart is shown in fig. 1, and the method includes the following steps:
step a, obtaining frequency domain data, namely k space data y, by adopting a random undersampling scheme; zero filling processing is carried out on the data which are not collected, inverse Fourier transform is carried out on the data which are subjected to the zero filling processing, and an initial reconstruction image X is obtained0
B, constructing a magnetic resonance diffusion image compressed sensing reconstruction model based on sparse and local low-rank matrix decomposition;
step c, solving the background component L of the magnetic resonance diffusion image by adopting a singular value soft threshold method, wherein,
Figure BDA0002915007760000051
Nx,Nyrepresenting the number of pixels of the magnetic resonance diffusion image, NdRepresenting the magnetic resonance diffusion gradient direction number, as shown in FIG. 2, the background component L of the magnetic resonance diffusion image during the k-th iteration is represented as Lk
Step d, solving the sparse component S by adopting a soft threshold algorithm, wherein,
Figure BDA0002915007760000052
the sparse component S in the kth iteration is represented as Sk
And e, updating the reconstructed image X by adopting data consistency, wherein,
Figure BDA0002915007760000053
the reconstructed image X in the kth iteration is denoted Xk
Step f, judging whether the convergence condition is met, if:
if not, returning to the step b;
then, the final result of the reconstructed image X is obtained.
Detailed description of the invention
In the magnetic resonance diffusion image reconstruction method based on sparse and local low-rank matrix decomposition in the present embodiment, on the basis of the first specific embodiment, a random undersampling scheme is further defined to select a one-dimensional random variable density sampling scheme, as shown in fig. 3.
Detailed description of the invention
In the magnetic resonance diffusion image reconstruction method based on sparse and local low-rank matrix decomposition in the present embodiment, on the basis of the first specific embodiment, a random undersampling scheme is further defined to select a two-dimensional random variable density sampling scheme, as shown in fig. 4.
Detailed description of the invention
In the magnetic resonance diffusion image reconstruction method based on sparse and local low-rank matrix decomposition in this embodiment, on the basis of the first specific embodiment, the second specific embodiment, or the third specific embodiment, the specific method in step b is further defined as follows:
Figure BDA0002915007760000061
in the formula:
min represents a minimization function;
Furepresents a random undersampling of k-space and has: fuPF, where P is a random undersampling scheme and F denotes fourier transform;
Rbrepresents a local 3D image block extraction operation, as shown in fig. 5;
Ω represents a set of all local 3D image blocks;
Ψ represents a sparse transform;
|| ||2represents the l2 norm;
|| ||1is a norm of l1;
||||*Is a nuclear norm;
Σ denotes a summation symbol;
both τ and λ represent regularization parameters.
Detailed description of the invention
In the magnetic resonance diffusion image reconstruction method based on sparse and local low-rank matrix decomposition in this embodiment, on the basis of the first specific embodiment, the second specific embodiment, or the third specific embodiment, the specific method in step c is further defined as follows:
extraction operation R with local 3D image blocksbFor the image Lk-1=Xk-1-Sk-1Extracting a series of overlapping image blocks, using Rb Lk-1Represents; extracted local 3D image block size of [ n ]x×ny,nd]I.e. Rb Lk-1Has a size of [ n ]x×ny,nd](ii) a Solving a low-rank matrix formed by local 3D image blocks by adopting an iterative singular value soft threshold method, wherein the low-rank matrix is expressed as [ u [ ]bb,vb]=SVD(RbLk-1) Obtaining a processed local 3D image block matrix ubΛτb)vb(ii) a Inverse operation R with local 3D image block extractionb TObtaining a background component L of the reconstructed magnetic resonance diffusion imagekIs shown as
Figure BDA0002915007760000071
Wherein, Λα(x) For soft threshold operation, denoted as
Figure BDA0002915007760000072
α is a threshold value.
Detailed description of the invention
In this embodiment, the magnetic resonance diffusion image reconstruction method based on sparse and local low-rank matrix decomposition is further defined in step d on the basis of the first embodiment, the second embodiment, or the third embodiment:
for soft threshold operation, one of two schemes is employed:
in the first scheme, all local image blocks adopt the same threshold;
according to the second scheme, different thresholds are adopted for each local image block; the threshold value is selected by adopting an empirical value.
Detailed description of the invention
In the magnetic resonance diffusion image reconstruction method based on sparse and local low-rank matrix decomposition in this embodiment, on the basis of the first specific embodiment, the second specific embodiment, or the third specific embodiment, the specific method of step d is further defined as follows:
the sparse component S is obtained by adopting a soft threshold algorithm and is expressed as Sk=ΨTα(Ψ(Xk-1-Lk-1) ))) wherein, Λ isα(x) For soft threshold operation, denoted as
Figure BDA0002915007760000073
α is a threshold value, Ψ is a sparse transform, ΨTThe inverse of it.
Detailed description of the invention
In the magnetic resonance diffusion image reconstruction method based on sparse and local low-rank matrix decomposition in the present embodiment, on the basis of the seventh specific embodiment, it is further limited that the sparse transform employs an orthogonal transform basis.
Detailed description of the invention
In the magnetic resonance diffusion image reconstruction method based on sparse and local low-rank matrix decomposition in the present embodiment, on the basis of the eighth specific embodiment, the orthogonal transformation basis is further limited to discrete wavelet transformation.
Detailed description of the preferred embodiment
In the magnetic resonance diffusion image reconstruction method based on sparse and local low-rank matrix decomposition in this embodiment, on the basis of the first specific embodiment, the second specific embodiment, or the third specific embodiment, the specific method of step e is further defined as follows:
updating a reconstructed image X with data consistency, denoted Xk=Lk+Sk-(Fu)T(Fu(Lk+Sk) -y) wherein FuFor k-space undersampling operations, (F)u)TIs FuThe inverse of (1).
Detailed description of the invention
In the magnetic resonance diffusion image reconstruction method based on sparse and local low-rank matrix decomposition according to this embodiment, on the basis of the first embodiment, the second embodiment, or the third embodiment, the convergence condition is further defined as one of the following two conditions:
setting a maximum iteration number K under the condition one;
second, the difference of the quality of the reconstructed image is less than a certain specified threshold tol and is expressed as
Figure BDA0002915007760000081
Detailed description of the invention
In the magnetic resonance diffusion image reconstruction method based on sparse and local low-rank matrix decomposition in the present embodiment, for specifically displaying the image for executing the method of the present invention, an initial reconstructed image obtained by using the one-dimensional random variable density sampling scheme shown in fig. 3 is shown in fig. 6, and a final result of the reconstructed image X obtained by using the reconstruction algorithm of the present invention is shown in fig. 7.
It should be noted that in the above embodiments, permutation and combination can be performed without any contradictory technical solutions, and since a person skilled in the art can exhaust the results of all permutation and combination according to the mathematical knowledge of permutation and combination learned in high-school stages, the results are not listed in this application, but it should be understood that each permutation and combination result is described in this application.
It should be noted that the above embodiments are only illustrative for the patent, and do not limit the protection scope thereof, and those skilled in the art can make modifications to the parts thereof without departing from the spirit of the patent.

Claims (9)

1. The magnetic resonance diffusion image reconstruction method based on sparse and local low-rank matrix decomposition is characterized by comprising the following steps of:
step a, obtaining frequency domain data, namely k space data y, by adopting a random undersampling scheme; zero filling processing is carried out on the data which are not collected, inverse Fourier transform is carried out on the data which are subjected to the zero filling processing, and an initial reconstruction image X is obtained0
B, constructing a magnetic resonance diffusion image compressed sensing reconstruction model based on sparse and local low-rank matrix decomposition;
step c, solving the background component L of the magnetic resonance diffusion image by adopting a singular value soft threshold method, wherein,
Figure FDA0002915007750000011
Nx,Nyrepresenting the number of pixels of the magnetic resonance diffusion image, NdThe magnetic resonance diffusion gradient direction number is shown, and the magnetic resonance diffusion image background component L in the k iteration process is shown as Lk
Step d, solving the sparse component S by adopting a soft threshold algorithm, wherein,
Figure FDA0002915007750000012
the sparse component S in the kth iteration is represented as Sk
And e, updating the reconstructed image X by adopting data consistency, wherein,
Figure FDA0002915007750000013
the reconstructed image X in the kth iteration is denoted Xk
Step f, judging whether the convergence condition is met, if:
if not, returning to the step b;
then, the final result of the reconstructed image X is obtained.
2. The sparse and local low-rank matrix decomposition-based magnetic resonance diffusion image reconstruction method according to claim 1, wherein the specific method of step b is as follows:
Figure FDA0002915007750000014
in the formula:
min represents a minimization function;
Furepresents a random undersampling of k-space and has: fuPF, where P is a random undersampling scheme and F denotes fourier transform;
Rbrepresenting a local 3D image block extraction operation;
Ω represents a set of all local 3D image blocks;
Ψ represents a sparse transform;
||||2represents the l2 norm;
||||1is a norm of l 1;
||||*is a nuclear norm;
Σ denotes a summation symbol;
both τ and λ represent regularization parameters.
3. The sparse-and-local-low-rank-matrix-decomposition-based magnetic resonance diffusion image reconstruction method according to claim 1, wherein the specific method of the step c is as follows:
extraction operation R with local 3D image blocksbFor the image Lk-1=Xk-1-Sk-1Extracting a series of overlapping image blocks, using RbLk-1Represents; extracted local 3D image block size of [ n ]x×ny,nd]I.e. RbLk-1Has a size of [ n ]x×ny,nd](ii) a Solving a low-rank matrix formed by local 3D image blocks by adopting an iterative singular value soft threshold method, wherein the low-rank matrix is expressed as [ u [ ]bb,vb]=SVD(RbLk -1) Obtaining a processed local 3D image block matrix ubΛτb)vb(ii) a Inverse operation R with local 3D image block extractionb TObtaining the background component of the reconstructed magnetic resonance diffusion imageLkIs shown as
Figure FDA0002915007750000021
Wherein, Λα(x) For soft threshold operation, denoted as
Figure FDA0002915007750000022
α is a threshold value.
4. The sparse and local low rank matrix decomposition based magnetic resonance diffusion image reconstruction method of claim 1, wherein in step d:
for soft threshold operation, one of two schemes is employed:
in the first scheme, all local image blocks adopt the same threshold;
according to the second scheme, different thresholds are adopted for each local image block; the threshold value is selected by adopting an empirical value.
5. The sparse and local low-rank matrix decomposition-based magnetic resonance diffusion image reconstruction method according to claim 1, wherein the specific method of step d is as follows:
the sparse component S is obtained by adopting a soft threshold algorithm and is expressed as Sk=ΨTα(Ψ(Xk-1-Lk-1) ))) wherein, Λ isα(x) For soft threshold operation, denoted as
Figure FDA0002915007750000023
α is a threshold value, Ψ is a sparse transform, ΨTThe inverse of it.
6. The sparse-and-local-low-rank-matrix-decomposition-based magnetic resonance diffusion image reconstruction method according to claim 5, wherein the sparse transform employs an orthogonal transform basis.
7. The sparse-and local-low-rank matrix decomposition-based magnetic resonance diffusion image reconstruction method of claim 6, wherein the orthogonal transformation basis is a discrete wavelet transform.
8. The sparse and local low-rank matrix decomposition-based magnetic resonance diffusion image reconstruction method according to claim 1, wherein the specific method of step e is as follows:
updating a reconstructed image X with data consistency, denoted Xk=Lk+Sk-(Fu)T(Fu(Lk+Sk) -y) wherein FuFor k-space undersampling operations, (F)u)TIs FuThe inverse of (1).
9. The sparse-and local-low-rank matrix decomposition-based magnetic resonance diffusion image reconstruction method of claim 1, wherein the convergence condition is one of the following two conditions:
setting a maximum iteration number K under the condition one;
second, the difference of the quality of the reconstructed image is less than a certain specified threshold tol and is expressed as
Figure FDA0002915007750000031
CN202110098931.XA 2021-01-25 2021-01-25 Magnetic resonance diffusion image reconstruction method based on sparse and local low-rank matrix decomposition Pending CN112710975A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110098931.XA CN112710975A (en) 2021-01-25 2021-01-25 Magnetic resonance diffusion image reconstruction method based on sparse and local low-rank matrix decomposition

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110098931.XA CN112710975A (en) 2021-01-25 2021-01-25 Magnetic resonance diffusion image reconstruction method based on sparse and local low-rank matrix decomposition

Publications (1)

Publication Number Publication Date
CN112710975A true CN112710975A (en) 2021-04-27

Family

ID=75549497

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110098931.XA Pending CN112710975A (en) 2021-01-25 2021-01-25 Magnetic resonance diffusion image reconstruction method based on sparse and local low-rank matrix decomposition

Country Status (1)

Country Link
CN (1) CN112710975A (en)

Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102389309A (en) * 2011-07-08 2012-03-28 首都医科大学 Compressed sensing theory-based reconstruction method of magnetic resonance image
CN104933683A (en) * 2015-06-09 2015-09-23 南昌大学 Non-convex low-rank reconstruction method for rapid magnetic resonance (MR) imaging
CN107330953A (en) * 2017-07-06 2017-11-07 桂林电子科技大学 A kind of Dynamic MRI method for reconstructing based on non-convex low-rank
CN108447102A (en) * 2018-02-11 2018-08-24 南京邮电大学 A kind of dynamic magnetic resonance imaging method of low-rank and sparse matrix decomposition
CN108577840A (en) * 2018-02-11 2018-09-28 南京邮电大学 A kind of steady PCA imaging methods of dynamic magnetic resonance
CN108828482A (en) * 2018-08-03 2018-11-16 厦门大学 In conjunction with the method for reconstructing of sparse and low-rank characteristic lack sampling magnetic resonance diffusion spectrum
CN109633502A (en) * 2018-12-03 2019-04-16 深圳先进技术研究院 Fast magnetic resonance parametric imaging method and device
CN109872376A (en) * 2019-02-20 2019-06-11 四川大学华西医院 A kind of method, apparatus and readable storage medium storing program for executing for rebuilding dynamic magnetic resonance image
CN110161442A (en) * 2018-02-12 2019-08-23 深圳先进技术研究院 Magnetic resonance parameters imaging method, device, medical supply and storage medium

Patent Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102389309A (en) * 2011-07-08 2012-03-28 首都医科大学 Compressed sensing theory-based reconstruction method of magnetic resonance image
CN104933683A (en) * 2015-06-09 2015-09-23 南昌大学 Non-convex low-rank reconstruction method for rapid magnetic resonance (MR) imaging
CN107330953A (en) * 2017-07-06 2017-11-07 桂林电子科技大学 A kind of Dynamic MRI method for reconstructing based on non-convex low-rank
CN108447102A (en) * 2018-02-11 2018-08-24 南京邮电大学 A kind of dynamic magnetic resonance imaging method of low-rank and sparse matrix decomposition
CN108577840A (en) * 2018-02-11 2018-09-28 南京邮电大学 A kind of steady PCA imaging methods of dynamic magnetic resonance
CN110161442A (en) * 2018-02-12 2019-08-23 深圳先进技术研究院 Magnetic resonance parameters imaging method, device, medical supply and storage medium
CN108828482A (en) * 2018-08-03 2018-11-16 厦门大学 In conjunction with the method for reconstructing of sparse and low-rank characteristic lack sampling magnetic resonance diffusion spectrum
CN109633502A (en) * 2018-12-03 2019-04-16 深圳先进技术研究院 Fast magnetic resonance parametric imaging method and device
CN109872376A (en) * 2019-02-20 2019-06-11 四川大学华西医院 A kind of method, apparatus and readable storage medium storing program for executing for rebuilding dynamic magnetic resonance image

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
马杰;王晓云;张志伟;刘雅莉;: "一种基于全变分正则化低秩稀疏分解的动态MRI重建方法", 光电子・激光, no. 01, 15 January 2016 (2016-01-15) *

Similar Documents

Publication Publication Date Title
Lee et al. Deep residual learning for accelerated MRI using magnitude and phase networks
Lyu et al. Cine cardiac MRI motion artifact reduction using a recurrent neural network
Yao et al. An efficient algorithm for dynamic MRI using low-rank and total variation regularizations
CN108717717B (en) Sparse MRI reconstruction method based on combination of convolutional neural network and iteration method
Liu et al. Highly undersampled magnetic resonance image reconstruction using two-level Bregman method with dictionary updating
Sandino et al. Deep convolutional neural networks for accelerated dynamic magnetic resonance imaging
CN108287324B (en) Reconstruction method and device of magnetic resonance multi-contrast image
WO2022183988A1 (en) Systems and methods for magnetic resonance image reconstruction with denoising
Goud et al. Real-time cardiac MRI using low-rank and sparsity penalties
CN112991483B (en) Non-local low-rank constraint self-calibration parallel magnetic resonance imaging reconstruction method
Li et al. An adaptive directional Haar framelet-based reconstruction algorithm for parallel magnetic resonance imaging
Hu et al. Spatiotemporal flexible sparse reconstruction for rapid dynamic contrast-enhanced MRI
Vellagoundar et al. A robust adaptive sampling method for faster acquisition of MR images
Adluru et al. Reordering for improved constrained reconstruction from undersampled k-space data
Ouchi et al. Reconstruction of compressed-sensing MR imaging using deep residual learning in the image domain
CN111754598A (en) Local space neighborhood parallel magnetic resonance imaging reconstruction method based on transformation learning
Liu et al. Multi-contrast MR reconstruction with enhanced denoising autoencoder prior learning
US20230380714A1 (en) Method and system for low-field mri denoising with a deep complex-valued convolutional neural network
Huang et al. Accelerating cardiac diffusion tensor imaging combining local low-rank and 3D TV constraint
Yaman et al. Improved supervised training of physics-guided deep learning image reconstruction with multi-masking
CN116626570A (en) Multi-contrast MRI sampling and image reconstruction
CN112710975A (en) Magnetic resonance diffusion image reconstruction method based on sparse and local low-rank matrix decomposition
Liu et al. MRI recovery with a self-calibrated denoiser
Malkiel et al. Conditional WGANs with adaptive gradient balancing for sparse MRI reconstruction
CN114723644A (en) Compressed sensing magnetic resonance image reconstruction method and device, storage medium and electronic equipment

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination