CN115471580A - Physical intelligent high-definition magnetic resonance diffusion imaging method - Google Patents

Physical intelligent high-definition magnetic resonance diffusion imaging method Download PDF

Info

Publication number
CN115471580A
CN115471580A CN202211040703.8A CN202211040703A CN115471580A CN 115471580 A CN115471580 A CN 115471580A CN 202211040703 A CN202211040703 A CN 202211040703A CN 115471580 A CN115471580 A CN 115471580A
Authority
CN
China
Prior art keywords
data
network
module
magnetic 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
CN202211040703.8A
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.)
Xiamen University
Original Assignee
Xiamen 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 Xiamen University filed Critical Xiamen University
Priority to CN202211040703.8A priority Critical patent/CN115471580A/en
Publication of CN115471580A publication Critical patent/CN115471580A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06TIMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T11/002D [Two Dimensional] image generation
    • G06T11/003Reconstruction from projections, e.g. tomography
    • 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
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06NCOMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00Computing arrangements based on biological models
    • G06N3/02Neural networks
    • G06N3/08Learning methods
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06TIMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T11/002D [Two Dimensional] image generation
    • G06T11/003Reconstruction from projections, e.g. tomography
    • G06T11/008Specific post-processing after tomographic reconstruction, e.g. voxelisation, metal artifact correction
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06TIMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T5/00Image enhancement or restoration
    • G06T5/10Image enhancement or restoration using non-spatial domain filtering
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06TIMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T5/00Image enhancement or restoration
    • G06T5/80Geometric correction
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06TIMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T2207/00Indexing scheme for image analysis or image enhancement
    • G06T2207/20Special algorithmic details
    • G06T2207/20048Transform domain processing
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06TIMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T2207/00Indexing scheme for image analysis or image enhancement
    • G06T2207/20Special algorithmic details
    • G06T2207/20081Training; Learning
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06TIMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T2207/00Indexing scheme for image analysis or image enhancement
    • G06T2207/20Special algorithmic details
    • G06T2207/20084Artificial neural networks [ANN]

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Health & Medical Sciences (AREA)
  • General Physics & Mathematics (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • General Health & Medical Sciences (AREA)
  • Nuclear Medicine, Radiotherapy & Molecular Imaging (AREA)
  • Biomedical Technology (AREA)
  • Biophysics (AREA)
  • Molecular Biology (AREA)
  • Computing Systems (AREA)
  • Radiology & Medical Imaging (AREA)
  • Data Mining & Analysis (AREA)
  • Computational Linguistics (AREA)
  • General Engineering & Computer Science (AREA)
  • Mathematical Physics (AREA)
  • Software Systems (AREA)
  • High Energy & Nuclear Physics (AREA)
  • Artificial Intelligence (AREA)
  • Evolutionary Computation (AREA)
  • Pathology (AREA)
  • Heart & Thoracic Surgery (AREA)
  • Medical Informatics (AREA)
  • Surgery (AREA)
  • Animal Behavior & Ethology (AREA)
  • Public Health (AREA)
  • Veterinary Medicine (AREA)
  • Magnetic Resonance Imaging Apparatus (AREA)

Abstract

A physical intelligent high-definition magnetic resonance diffusion imaging method comprises the following steps: 1) Obtaining the b value of 0mm/s of single excitation or multiple excitations of multiple channels 2 The magnetic resonance image with the phase is estimated to obtain the channel sensitivity; 2) Obtaining a simulated motion phase according to a polynomial phase model of rigid motion; 3) Generation of large amounts of multi-shot diffusion-weighted image data using phased magnetic resonance images, channel sensitivities, and simulated motion phases as training for intelligent reconstruction networksAnd (5) practicing data. 4) The method comprises the steps of constructing an intelligent reconstruction network comprising a plurality of iteration blocks, wherein each iteration block comprises a low-rank module, a sparse module and a data checking module. The last iteration block also contains a denoising module. Training an intelligent reconstruction network by using simulation data; 5) Acquiring multi-excitation diffusion weighted data to be reconstructed; 6) And reconstructing multi-excitation diffusion weighted data by using the trained intelligent reconstruction network to obtain a reconstructed image.

Description

Physical intelligent high-definition magnetic resonance diffusion imaging method
Technical Field
The invention relates to a physical intelligent high-definition magnetic resonance diffusion imaging method, in particular to a method for generating multi-excitation diffusion weighted imaging training data by utilizing polynomial simulation and an intelligent reconstruction network based on sparseness and low rank.
Background
Diffusion weighted imaging (Diffusion weighted imaging) is a way to assess the function and microstructure of human molecules and can detect the Diffusion motion of water molecules in tissues without invasion (V.Baliyan et al., "Diffusion weighted imaging: techniques and applications," World Journal of Radiology,8,785,2016). Multi-shot planar echo imaging techniques have the ability to improve resolution and reduce low distortion in diffusion weighted applications (h.an, x.ma, z.pan, h.guo, e.y.p. Lee, "Qualitative and quantitative compatibility of image quality between shot echo and inter-shot echo dispersion-weighted imaging in the field of specimen analysis," European radiology,30,1876-1884, 2020). However, there is a severe phase error between different shots, resulting in severe motion artifacts (A.W. Anderson, J.C. Gore, "Analysis and correction of motion artifacts in dispersion weighted imaging," Magnetic Resonance in Medicine,32,379-387, 1994).
In recent years, many reconstruction methods based on low-rank iterative models are used to correct motion phases between different excitations, and achieve reconstruction without motion artifacts. The MUSSELS constructs a structured hankel matrix by establishing phase annihilation relations among images of different excitations, and constrains the low rank of the matrix to realize reconstruction (m.mani, m.jacob, d.keley, v. Magnetic, "Multi-shot sensitivity-encoded direction data recovery using structured low-rank Matrix (MUSSELS)," Magnetic Resonance in Medicine,78,494-507, 2017). PLRHM constructs a structured low-rank matrix using smooth Phase priors of Magnetic Resonance images, and achieves reconstruction by constraining partial larger singular value sums of the low-rank matrix (y.huang et al., "Phase-constrained reconstruction for high-resolution multi-shot differentiation weighted image," Journal of Magnetic Resonance,312 106690, 2020. The PAIR uses the structural detail information of the image domain and the low rank information of the Fourier space to realize the reconstruction of multi-excitation diffusion weighting data by alternately and iteratively reconstructing the amplitude and the phase (C.Qian et al., "A-affected phase and magnetic reconstruction for advanced diffusion-weighted imaging," arXiv prediction, arXiv: 2203.14559.2022).
Recently, deep learning methods have shown great potential in multi-shot diffusion weighted Imaging (Aggarwal. H.K., M. Mani, M.Jacob, "MoDL-MUSSELS: model-based deep learning for multi-shot sensitivity-encoded differentiation MRI", IEEE Transactions on Medical Imaging,39,1268-1277, 2019). However, the multi-excitation diffusion weighted images lack high-quality training labels, and the training labels generated by the traditional iterative reconstruction method greatly limit the potential of the intelligent reconstruction methods.
In summary, the current intelligent reconstruction method for multi-excitation diffusion weighted imaging is limited in that high-quality training data is difficult to obtain, and the potential of the intelligent reconstruction method cannot be effectively exerted. The invention provides a polynomial simulation model based on rigid motion for generating multi-excitation diffusion weighted imaging training data and an intelligent reconstruction network based on sparseness and low rank (Q.Yang, Z.Wang, K.Guo, C.Cai, and X.Qu, "Physics-drive synthesis data learning for biological magnetic response: the imaging Physics based synthesis data parallel for intelligent inter-orientation," IEEE Signal processing Magazine, DOI:10.1109/MSP.2022.3183809, 2022).
Disclosure of Invention
The invention aims to provide a physical intelligent high-definition magnetic resonance diffusion imaging method.
The invention comprises the following steps:
1) Obtaining the b value of a single excitation or multiple excitations of multiple channels to be 0mm/s 2 The diffusion weighted magnetic resonance image with the phase is estimated to obtain the channel sensitivity;
2) Obtaining a plurality of groups of motion phases according to the polynomial phase model simulation;
3) Simulating the magnetic resonance image with the phase, the channel sensitivity and the motion phase to obtain diffusion weighted image data which are excited for multiple times and are used as training data of an intelligent reconstruction network;
4) The method comprises the steps of constructing an intelligent reconstruction network comprising a plurality of iteration blocks, wherein each iteration block comprises a low-rank module, a sparse module and a data checking module. The last iteration block also comprises a denoising module; training an intelligent reconstruction network by using simulation training data;
5) Acquiring multi-excitation diffusion weighted data to be reconstructed;
6) And reconstructing multi-excitation diffusion weighted data by using the trained intelligent reconstruction network to obtain a reconstructed image.
In step 1), the acquired diffusion-weighted magnetic resonance image with phase
Figure BDA0003820860290000021
Can be obtained by single-shot sequence, or multiple-shot sequence with b value of 0mm/s 2 N and M are the lengths of the frequency and phase encoding dimensions of the image, respectively, and the channel sensitivity is estimated using the acquired data
Figure BDA0003820860290000022
Wherein the total number of channels is H.
In step 2), the specific method for obtaining multiple groups of motion phases through the polynomial phase model simulation is as follows:
the polynomial motion phase model is:
Figure BDA0003820860290000023
wherein x, y are coordinates of the two-dimensional image, and i is an imaginary symbol;
Figure BDA0003820860290000024
is the phase obtained by simulation, and N and M are the frequency of the image and the length of the phase encoding dimension, respectively; l is the polynomial order, m and L-m are the x and y powers of the phases contained in the current ith order polynomial, respectively; a. The lm Is x m y l-m The coefficients of the terms are such that,
Figure BDA00038208602900000321
is a two-dimensional gaussian distributed noise, where μ and σ are the mean and variance, respectively; using polynomial operationThe dynamic phase model can obtain J motion phases to form a group of simulated phase data of multi-excitation diffusion weight-setting data
Figure BDA0003820860290000031
J is equal to the excitation times of the multi-excitation diffusion weighted data to be reconstructed by the target.
In step 3), the simulation flow formula of the diffusion weighted data excited for multiple times is as follows:
Figure BDA0003820860290000032
wherein the content of the first and second substances,
Figure BDA0003820860290000033
is the diffusion weighted fourier space data obtained by simulation,
Figure BDA0003820860290000034
is the complete diffusion weighted image obtained by simulation, C is the channel sensitivity, and P is the motion phase obtained by simulation; m is a diffusion weighted magnetic resonance image with phase,
Figure BDA0003820860290000035
is an undersampling operator corresponding to a Fourier space sampling template of multi-excitation diffusion weighted data,
Figure BDA0003820860290000036
is a fourier transform. By using the formula (1), a large number of simulated multi-excitation diffusion weights can be obtained as training data of the intelligent reconstruction network. Directly carrying out Fourier transform on the complete diffusion weighted image I to obtain X GT . Finally Y, X GT And C together form a pair of training data.
In the step 4), the intelligent reconstruction network comprises K iterative blocks, each iterative block comprises a low-rank module, a sparse module and a data checking module, and the last iterative block further comprises a denoising module;
the network design of the low-rank module LR is specifically as follows:
Figure BDA0003820860290000037
wherein the content of the first and second substances,
Figure BDA0003820860290000038
is a network intermediate variable, where k denotes the kth iteration block, X k-1 Is the output of the last iteration block, X 0 = Y is a network initialization input,
Figure BDA0003820860290000039
is a low rank module, consisting of L LR The convolution neural network comprises a plurality of two-dimensional convolution kernels, each convolution kernel comprises a plurality of two-dimensional convolution kernels, the convolution kernels are connected through a linear rectification function, and the input of each convolution kernel is the output of the previous convolution kernel.
The network design of the sparse module SP is specifically as follows:
Figure BDA00038208602900000310
wherein, the first and the second end of the pipe are connected with each other,
Figure BDA00038208602900000311
is a variable in the middle of the network,
Figure BDA00038208602900000312
is the output of the last low rank module,
Figure BDA00038208602900000313
and
Figure DEST_PATH_1
respectively, fourier transform and inverse Fourier transform, soft (.;. Theta.;) k ) Is a soft threshold operation, defined as soft (x; theta k )=max{|x|-θ k }. X/| x |, where θ k Is a trainable threshold;
Figure BDA00038208602900000315
from L SP The system comprises a layer convolution neural network, each layer of convolution comprises a plurality of two-dimensional convolution kernels, the convolution layers are connected through a linear rectification function, and the input of each layer is the output of the previous layer;
Figure BDA00038208602900000316
after the output of (2) is subjected to a soft threshold operation
Figure BDA00038208602900000317
The network(s) of the network(s),
Figure BDA00038208602900000318
and
Figure BDA00038208602900000319
has an antisymmetric network structure.
The network design of the data checking module is as follows:
Figure BDA00038208602900000320
wherein the content of the first and second substances,
Figure BDA0003820860290000041
and
Figure 522865DEST_PATH_1
respectively a fourier transform and an inverse fourier transform,
Figure BDA0003820860290000043
is an undersampling operator corresponding to a Fourier space sampling template of multi-excitation diffusion weighted data,
Figure BDA0003820860290000044
is its conjugate operator; d is an identity matrix, λ 1 Is a learnable regularization parameter.
Figure BDA0003820860290000045
Is the output of the sparse module; y is diffusion addition obtained by simulationThe weighted fourier space data. C is channel sensitivity, C * Is a conjugate matrix of the channel sensitivity. X k Is a network intermediate variable; if the current iteration block is not the last iteration block, X k A low rank module to be input to a next iteration block; if the current iteration block is the last iteration block, i.e. the K-th iteration block, X K Will be input to the denoising module.
The denoising module is specifically designed as follows:
Figure BDA0003820860290000046
wherein the content of the first and second substances,
Figure BDA0003820860290000047
and
Figure BDA0003820860290000048
respectively expressing an operator and a conjugate operator for constructing a structured Hankel matrix; SVT r Is a singular value decomposition and threshold operation operator, will
Figure BDA0003820860290000049
After singular value decomposition, the first r singular values are retained.
Figure BDA00038208602900000410
Is the final output.
The loss function for intelligent network training is:
Figure BDA00038208602900000411
wherein T is the total number of training samples, K is the number of network iteration blocks, and X k,t Is the output of the kth iteration block after the t-th sample is input into the network,
Figure BDA00038208602900000412
the training label of the t sample is generated by the simulation method; i | · | live through F Is a frobenius norm; and training and updating learnable convolution kernels and parameters in the network by a deep learning common Adam optimizer to finally obtain a trained network model.
In step 5), the acquired data to be reconstructed is multi-shot echo planar diffusion weighted data read out in segments in the phase encoding dimension.
And in step 6), inputting the acquired multiple-time excitation plane echo diffusion weighting data into a trained intelligent reconstruction network, and reconstructing to obtain an image without motion artifacts.
Compared with the existing deep learning multi-excitation diffusion weighted image reconstruction, the physical intelligent reconstruction scheme provided by the invention has the following outstanding advantages:
1. the invention generates simulation data approaching to the measured data through the rigid motion model, and does not need to train the network by the measured training data, thereby solving the problem that the multi-excitation diffusion weighted image has no high-quality training data.
2. The physical intelligent network designed by the invention comprehensively utilizes two complementary prior information of image domain sparsity and Fourier space low rank.
3. The invention can effectively remove the motion artifacts in the multi-excitation diffusion weighted image and realize rapid high-quality reconstruction.
Drawings
Fig. 1 shows a phase-shifted magnetic resonance image used for simulation and estimated channel sensitivities.
Fig. 2 is a set of simulated motion phases for four shots.
FIG. 3 shows the inputs to the intelligent reconstruction method, i.e. the b-value to be reconstructed is 1000mm/s 2 The diffusion weighted image is excited four times.
FIG. 4 shows the output of the intelligent reconstruction method, i.e. the reconstructed b value is 1000mm/s 2 The diffusion weighted image is excited four times.
Detailed Description
The embodiment of the invention is a specific process of multi-excitation Fourier space signal high-resolution diffusion weighted reconstruction, and details of a physical intelligent high-definition magnetic resonance diffusion imaging method provided by the invention are described in combination with the attached drawings.
The specific implementation process is as follows:
in the first step, a magnetic resonance scanner with the magnetic field intensity of 3.0 Tesla is used for scanning 6 volunteers to acquire a b value with a phase of 0mm/s 2 The diffusion weighted magnetic resonance image m of the four excitations is obtained with the parameters: field of view 220 x 220mm 2 The layer thickness is 5mm, the coil has 32 channels, and the matrix size is cut to 180 x 180. The 6 volunteers obtained 144 magnetic resonance images with phases and 144 channel sensitivities C. The phase-shifted magnetic resonance image and the channel sensitivity are shown in fig. 1.
And secondly, simulating a motion phase. The polynomial phase model is specifically as follows:
Figure BDA0003820860290000051
where x, y are the coordinates of the two-dimensional image and i is an imaginary symbol.
Figure BDA0003820860290000052
Is the phase obtained by simulation, the frequency of the image and the length of the phase encoding dimension are both 180. The polynomial order L is 7,m and L-m are the x and y powers, respectively, of the phases that the current L-th order polynomial contains. x is the number of m y l-m Coefficient of term A lm Is from [0,0.1 l ]Is randomly obtained in the uniform distribution of the magnetic field,
Figure BDA0003820860290000053
is a two-dimensional gaussian distributed noise in which the mean μ and variance σ are 0 and 0.01, respectively. 4 motion phases can be obtained by utilizing a polynomial motion phase model to form simulation phase data of a group of multi-excitation diffusion weight-setting data
Figure BDA0003820860290000054
The co-simulation resulted in 1440 sets of motion phases.
Thirdly, simulating multi-excitation diffusion weighted data, wherein the simulation flow formula is as follows:
Figure BDA0003820860290000055
wherein the content of the first and second substances,
Figure BDA0003820860290000056
is the diffusion weighted fourier space data obtained by simulation,
Figure BDA0003820860290000057
is the complete diffusion weighted image obtained by simulation, C is the channel sensitivity, and P is the motion phase obtained by simulation. m is a diffusion weighted magnetic resonance image with phase,
Figure BDA0003820860290000058
is an undersampling operator corresponding to a Fourier space sampling template of multi-excitation diffusion weighted data,
Figure BDA0003820860290000059
is a fourier transform. By using the formula (1), a large number of simulated multi-shot diffusion weights can be obtained as training data of the intelligent reconstruction network. Directly carrying out Fourier transform on the complete diffusion weighted image I to obtain X GT . Finally Y, X GT And C together form a pair of training data. The amplitude data m and channel sensitivity C for each band phase can be combined with 10 sets of simulated motion phases, thus yielding 1440 sets of training data. Fig. 2 shows one set of simulated motion phases.
And fourthly, building an intelligent reconstruction network, wherein the intelligent reconstruction network comprises 5 iteration blocks, and each iteration block comprises a low-rank module, a sparse module and a data check module. The last iteration block also contains a denoising module.
a) The network design of the low-rank module LR is specifically as follows:
Figure BDA0003820860290000061
wherein the content of the first and second substances,
Figure BDA0003820860290000062
is a network intermediate variable, where k represents the kth iteration block. X k-1 Is the output of the last iteration block, X 0 Where = Y is the network initialization input, figure 3 shows the image domain of the network input, i.e. the unrereconstructed multi-shot diffusion weighted magnetic resonance data.
Figure BDA0003820860290000063
The low-rank module is composed of 6 layers of convolutional neural networks, each layer of convolution comprises 48 two-dimensional convolution kernels, the convolution layers are connected through a linear rectification function, and the input of each layer is the output of the previous layer.
b) The network design of the sparse module SP is specifically as follows:
Figure BDA0003820860290000064
wherein the content of the first and second substances,
Figure BDA0003820860290000065
is a variable in the middle of the network,
Figure BDA0003820860290000066
is the output of the last low-rank module,
Figure BDA0003820860290000067
and
Figure 623333DEST_PATH_1
respectively, fourier transform and inverse Fourier transform, soft (.;. Theta.;) k ) Is a soft threshold operation, defined as soft (x; theta k )=max{|x|-θ k }. X/| x |, where θ k Is a trainable threshold, initialized to 0.01.
Figure BDA0003820860290000069
The convolution function is connected with each convolution layer through a linear rectification function, and each convolution layer is input into the output of the previous layer.
Figure BDA00038208602900000610
After the soft threshold operation, the output of (A) enters
Figure BDA00038208602900000611
The network(s) of the network(s),
Figure BDA00038208602900000612
and
Figure BDA00038208602900000613
has an antisymmetric network structure.
c) The network design of the data checking module is as follows:
Figure BDA00038208602900000614
wherein the content of the first and second substances,
Figure BDA00038208602900000615
and
Figure 302602DEST_PATH_1
respectively a fourier transform and an inverse fourier transform,
Figure BDA00038208602900000617
is an undersampling operator corresponding to a Fourier space sampling template of multi-excitation diffusion weighted data,
Figure BDA00038208602900000618
is its conjugate operator. D is an identity matrix, λ 1 Are learnable regularization parameters.
Figure BDA00038208602900000619
Is the output of the sparse module. Y is diffusion weighted fourier space data obtained from simulation. C is channel sensitivity, C * Is a conjugate matrix of channel sensitivities. X k Is a network intermediate variable. If the current iteration block is not the last iterationBlock, X k The input will be to the low rank module of the next iteration block. If the current iteration block is the last iteration block, i.e. the K-th iteration block, X K Will be input to the denoising module.
d) The denoising module is specifically designed as follows:
Figure BDA0003820860290000071
wherein the content of the first and second substances,
Figure BDA0003820860290000072
and
Figure BDA0003820860290000073
respectively representing an operator and a conjugate operator for constructing the structured Hankel matrix, and the size of a sliding window is [5,5 ]]。SVT r Is a singular value decomposition and threshold operation operator, will
Figure BDA0003820860290000074
After the singular value decomposition, the first 30 singular values are retained.
Figure BDA0003820860290000075
Is the final output.
The loss function for intelligent network training is:
Figure BDA0003820860290000076
wherein the total number of training samples is 1200, the number of verification samples is 240, and the number of network iteration blocks is 5,X k,t Is the output of the kth iteration block after the t-th sample is input into the network,
Figure BDA0003820860290000077
the training label of the t-th sample is generated by the simulation method. I | · | purple wind F Is the frobenius norm. Training learnable convolution kernels and parameters in an update network through a deep learning common Adam optimizer, and finallyAnd obtaining the trained network model.
Fourthly, scanning 1 volunteer by using a magnetic resonance scanner with the magnetic field intensity of 3.0 tesla to acquire four-time excited diffusion weighted magnetic resonance images, wherein the acquisition parameters are as follows: TR/TE =3000/60ms, b value 1000mm/s 2 3 in the diffusion direction, 220 × 220mm in the field of view 2 Layer thickness 5mm, layer number 12, coil 32 passageway, matrix size is 180 x 180 after cutting. And calculating to obtain the channel sensitivity.
And fifthly, inputting the collected four times of excitation diffusion weighting data into a trained intelligent reconstruction network, and reconstructing to obtain an image without motion artifacts. FIG. 4 shows that the reconstructed b value is 1000mm/s 2 The diffusion weighted image is excited four times.

Claims (7)

1. A physical intelligent high-definition magnetic resonance diffusion imaging method is characterized by comprising the following steps:
1) Obtaining the b value of 0mm/s of single excitation or multiple excitations of multiple channels 2 The diffusion weighted magnetic resonance image with the phase is estimated to obtain the channel sensitivity;
2) Simulating to obtain a plurality of groups of motion phases according to a polynomial phase model of rigid motion;
3) Simulating the magnetic resonance image with the phase, the channel sensitivity and the motion phase to obtain diffusion weighted image data which are excited for multiple times and are used as training data of an intelligent reconstruction network;
4) Constructing an intelligent reconstruction network comprising a plurality of iteration blocks, wherein each iteration block comprises a low-rank module, a sparse module and a data check module, and the last iteration block further comprises a denoising module; training an intelligent reconstruction network by using simulation training data;
5) Acquiring multi-excitation diffusion weighted data to be reconstructed;
6) And reconstructing multi-excitation diffusion weighted data by using the trained intelligent reconstruction network to obtain a reconstructed image.
2. The physically intelligent high-definition magnetic resonance diffusion imaging method as claimed in claim 1, wherein in the step 1), the method is characterized in thatAcquired diffusion weighted magnetic resonance image with phase
Figure FDA0003820860280000011
B-value of 0mm/s for the singly-excited or multiply-excited sequence 2 N and M are the lengths of the frequency and phase encoding dimensions of the image, respectively, and the channel sensitivity is estimated using the acquired data
Figure FDA0003820860280000012
Wherein the total number of channels is H.
3. The physical intelligent high-definition magnetic resonance diffusion imaging method as claimed in claim 1, wherein in step 2), the polynomial phase model is simulated to obtain a plurality of groups of motion phases as follows:
the polynomial motion phase model based on rigid body motion is:
Figure FDA0003820860280000013
wherein x, y are coordinates of the two-dimensional image, and i is an imaginary symbol;
Figure FDA0003820860280000014
is the phase obtained by simulation, and N and M are the frequency of the image and the length of the phase encoding dimension, respectively; l is the polynomial order, m and L-m are the x and y powers of the phases contained in the current ith order polynomial, respectively; a. The lm Is x m y l-m The coefficient of the term(s) is,
Figure FDA0003820860280000015
is a two-dimensional gaussian distributed noise, where μ and σ are the mean and variance, respectively; j motion phases can be obtained by utilizing a polynomial motion phase model to form simulation phase data of a group of multi-excitation diffusion weight-setting data
Figure FDA0003820860280000016
J equals the number of shots of the multi-shot diffusion weighted data of the target to be reconstructed.
4. An intelligent reconstruction diffusion weighted magnetic resonance imaging method as claimed in claim 1, wherein in step 3), the simulation flow formula of the multi-excitation diffusion weighted data is:
Figure FDA0003820860280000017
wherein the content of the first and second substances,
Figure FDA0003820860280000021
is diffusion weighted Fourier space data of each channel of each excitation obtained by simulation,
Figure FDA0003820860280000022
is a simulated complete diffusion weighted image, C is the channel sensitivity, P is the simulated motion phase, m is the diffusion weighted magnetic resonance image with phase,
Figure FDA0003820860280000023
is an undersampling operator corresponding to a Fourier space sampling template of multi-excitation diffusion weighted data,
Figure FDA0003820860280000024
the method is characterized in that Fourier transform is adopted, a large number of simulated multi-excitation diffusion weights are obtained by using a formula (1) and are used as training data of an intelligent reconstruction network, and an X is obtained by directly carrying out Fourier transform on a complete diffusion weighted image I GT Finally Y, X GT And C together form a pair of training data.
5. The physically intelligent high-definition magnetic resonance diffusion imaging method as claimed in claim 1, wherein in step 4), the intelligent reconstruction network comprises K iterative blocks, each iterative block comprises a low rank module, a sparse module, a data check module, and the last iterative block further comprises a denoising module;
the network design of the low-rank module LR is specifically as follows:
Figure FDA0003820860280000025
wherein the content of the first and second substances,
Figure FDA0003820860280000026
is a network intermediate variable, where k denotes the kth iteration block, X k-1 Is the output of the last iteration block, X 0 = Y is a network initialization input,
Figure FDA0003820860280000027
is a low rank module, consisting of L LR The system comprises a layer convolution neural network, each layer of convolution comprises a plurality of two-dimensional convolution kernels, the convolution layers are connected through a linear rectification function, and the input of each layer is the output of the previous layer;
the network design of the sparse module SP is specifically as follows:
Figure FDA0003820860280000028
wherein the content of the first and second substances,
Figure FDA0003820860280000029
is a variable in the middle of the network,
Figure FDA00038208602800000210
is the output of the last low rank module,
Figure FDA00038208602800000211
and
Figure 1
respectively Fourier transform and inverse Fourier transform, soft(·;θ k ) Is a soft threshold operation, defined as soft (x; theta k )=max{|x|-θ k } · x/| x |, where θ k Is a trainable threshold;
Figure FDA00038208602800000213
from L SP A layer convolution neural network, each layer of convolution comprises a plurality of two-dimensional convolution kernels, the convolution layers are connected by a linear rectification function, and the input of each layer is the output of the previous layer,
Figure FDA00038208602800000214
after the soft threshold operation, the output of (A) enters
Figure FDA00038208602800000215
The network(s) of the network(s),
Figure FDA00038208602800000216
and
Figure FDA00038208602800000217
having an antisymmetric network structure;
the network design of the data checking module is as follows:
Figure FDA00038208602800000218
wherein the content of the first and second substances,
Figure FDA00038208602800000219
and
Figure 1
respectively a fourier transform and an inverse fourier transform,
Figure FDA00038208602800000221
is an undersampling operator corresponding to a Fourier space sampling template of multi-excitation diffusion weighted data,
Figure FDA00038208602800000222
is its conjugate operator; d is an identity matrix, λ 1 Is a learnable regularization parameter;
Figure FDA00038208602800000223
is the output of the sparse module, Y is the diffusion weighted Fourier space data obtained by simulation, C is the channel sensitivity * Is a conjugate matrix of channel sensitivities, X k Is a network intermediate variable; if the current iteration block is not the last iteration block, X k The low rank module is input to the next iteration block, if the current iteration block is the last iteration block, i.e. the Kth iteration block, X K Inputting the input to a denoising module;
the denoising module is specifically designed as follows:
Figure FDA0003820860280000031
wherein the content of the first and second substances,
Figure FDA0003820860280000032
and
Figure FDA0003820860280000033
respectively representing an operator and a conjugate operator for constructing a structured Hankel matrix, SVT r Is a singular value decomposition and threshold operation operator, will
Figure FDA0003820860280000034
After singular value decomposition, the first r singular values are reserved;
Figure FDA0003820860280000035
is the final output;
the loss function for intelligent network training is:
Figure FDA0003820860280000036
wherein T is the total number of training samples, K is the number of network iteration blocks, X k,t Is the output of the kth iteration block after the t-th sample is input into the network,
Figure FDA0003820860280000037
is the training label of the tth sample, is generated by the simulation method, | | · u F Is a frobenius norm; and training and updating learnable convolution kernels and parameters in the network by a deep learning common Adam optimizer to finally obtain a trained network model.
6. A physically intelligent high definition magnetic resonance diffusion imaging method as claimed in claim 1, characterized in that in step 5), the acquired data to be reconstructed is multi-shot planar echo diffusion weighted data read out in segments in phase encoding dimension.
7. The physical intelligent high-definition magnetic resonance diffusion imaging method according to claim 1, wherein in step 6), the acquired multi-shot echo planar diffusion weighted data are input into a trained intelligent reconstruction network, and an image without motion artifacts is reconstructed.
CN202211040703.8A 2022-08-29 2022-08-29 Physical intelligent high-definition magnetic resonance diffusion imaging method Pending CN115471580A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202211040703.8A CN115471580A (en) 2022-08-29 2022-08-29 Physical intelligent high-definition magnetic resonance diffusion imaging method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202211040703.8A CN115471580A (en) 2022-08-29 2022-08-29 Physical intelligent high-definition magnetic resonance diffusion imaging method

Publications (1)

Publication Number Publication Date
CN115471580A true CN115471580A (en) 2022-12-13

Family

ID=84368901

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202211040703.8A Pending CN115471580A (en) 2022-08-29 2022-08-29 Physical intelligent high-definition magnetic resonance diffusion imaging method

Country Status (1)

Country Link
CN (1) CN115471580A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117011409A (en) * 2023-08-10 2023-11-07 厦门大学 Multi-position physical intelligent high-definition diffusion magnetic resonance data generation method

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117011409A (en) * 2023-08-10 2023-11-07 厦门大学 Multi-position physical intelligent high-definition diffusion magnetic resonance data generation method
CN117011409B (en) * 2023-08-10 2024-05-10 厦门大学 Multi-position physical intelligent high-definition diffusion magnetic resonance data generation method

Similar Documents

Publication Publication Date Title
Liu et al. RARE: Image reconstruction using deep priors learned without groundtruth
CN107610194B (en) Magnetic resonance image super-resolution reconstruction method based on multi-scale fusion CNN
CN110378980B (en) Multichannel magnetic resonance image reconstruction method based on deep learning
Wen et al. Transform learning for magnetic resonance image reconstruction: From model-based learning to building neural networks
Lam et al. Constrained magnetic resonance spectroscopic imaging by learning nonlinear low-dimensional models
CN112150568A (en) Magnetic resonance fingerprint imaging reconstruction method based on Transformer model
CN111870245B (en) Cross-contrast-guided ultra-fast nuclear magnetic resonance imaging deep learning method
CN109410289A (en) A kind of high lack sampling hyperpolarized gas lung MRI method for reconstructing of deep learning
Luo et al. Bayesian MRI reconstruction with joint uncertainty estimation using diffusion models
CN111783631B (en) Sparse representation-based deep learning magnetic resonance spectrum reconstruction method
Fan et al. A segmentation-aware deep fusion network for compressed sensing mri
Benou et al. De-noising of contrast-enhanced MRI sequences by an ensemble of expert deep neural networks
CN112991483B (en) Non-local low-rank constraint self-calibration parallel magnetic resonance imaging reconstruction method
CN114820849A (en) Magnetic resonance CEST image reconstruction method, device and equipment based on deep learning
CN114299185A (en) Magnetic resonance image generation method, magnetic resonance image generation device, computer equipment and storage medium
Manimala et al. Convolutional neural network for sparse reconstruction of MR images interposed with gaussian noise
CN115471580A (en) Physical intelligent high-definition magnetic resonance diffusion imaging method
Gan et al. SS-JIRCS: Self-supervised joint image reconstruction and coil sensitivity calibration in parallel MRI without ground truth
Klug et al. Analyzing the sample complexity of self-supervised image reconstruction methods
CN114820636A (en) Three-dimensional medical image segmentation model and training method and application thereof
CN113487507A (en) Dual-domain recursive network MR reconstruction method based on multi-module feature aggregation
Bian et al. CSDL‐Net: An iterative network based on compressed sensing and deep learning
CN112634385A (en) Rapid magnetic resonance imaging method based on deep Laplace network
CN113034639B (en) Magnetic resonance imaging image reconstruction method based on separable Henkel matrix
CN117011409B (en) Multi-position physical intelligent high-definition diffusion magnetic resonance data generation method

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