CORRECTION OF MISMATCHES IN MAGNETIC RESONANCE MEASUREMENTS

20210341558 · 2021-11-04

    Inventors

    Cpc classification

    International classification

    Abstract

    A computer-implemented method is provided for generating correction information for correcting mismatches in magnetic resonance measurements. Magnetic resonance data is received, wherein a generation of the magnetic resonance data includes several partial measurements by a magnetic resonance device. During each partial measurement, a k-space region is sampled at least partially, wherein the k-space regions of different partial measurements differ at least partially in their extent in the readout direction, and wherein the extent in the readout direction depends on prephasing gradients and readout gradients generated by the magnetic resonance device during the partial measurements. A trained function of a machine learning algorithm is applied to the received magnetic resonance data, wherein correction information for correcting a mismatch of the prephasing gradients and readout gradients is generated and output.

    Claims

    1. A computer-implemented method for generating correction information for correcting mismatches in magnetic resonance measurements, the method comprising: receiving magnetic resonance data, wherein the magnetic resonance data comprises several partial measurements by a magnetic resonance device, wherein during each partial measurement a k-space region is sampled at least partially, wherein the k-space regions of different partial measurements differ at least partially in an extent in a readout direction, and wherein the extent in the readout direction of a respective partial measurement depends on prephasing gradients and readout gradients generated by the magnetic resonance device during the respective partial measurement of the different partial measurements; and applying a trained function of a machine learning algorithm to the magnetic resonance data, wherein correction information for correcting a mismatch of the prephasing gradients and the readout gradients is generated and output.

    2. The method of claim 1, wherein a magnetic resonance output image is generated based on the magnetic resonance data, and wherein a mismatch of the prephasing gradients and the readout gradients is corrected based on the correction information output by the trained function.

    3. The method of claim 2, wherein the magnetic resonance data is processed, wherein the processed magnetic resonance data comprises at least one magnetic resonance image generated based on the magnetic resonance data, and wherein the trained function of the machine learning algorithm is applied to the processed magnetic resonance data.

    4. The method of claim 3, wherein the at least one magnetic resonance image is generated based on magnetic resonance data relating to a subset of the k-space.

    5. The method of claim 4, wherein the at least one magnetic resonance image is further generated based on magnetic resonance data relating to a subset of the partial measurements.

    6. The method of claim 1, wherein the magnetic resonance data is processed, wherein the processed magnetic resonance data comprises at least one magnetic resonance image generated based on the magnetic resonance data, and wherein the trained function of the machine learning algorithm is applied to the processed magnetic resonance data.

    7. The method of claim 6, wherein the at least one magnetic resonance image is generated based on magnetic resonance data relating to a subset of the k-space.

    8. The method of claim 6, wherein the at least one magnetic resonance image is generated based on magnetic resonance data relating to a subset of the partial measurements.

    9. The method of claim 1, wherein the correction information for correcting a mismatch of the prephasing gradients and the readout gradients comprises at least one correction factor, wherein the at least one correction factor describes a correction of a data set of a partial measurement in the k-space, and wherein the correction comprises one or more of a rescaling, a rotation, a phase modulation, or a displacement of the data set of the partial measurement in the k-space.

    10. The method of claim 1, wherein the trained function of the machine learning algorithm is applied to data of the partial measurements in the k-space.

    11. The method of claim 1, wherein the readout gradients have a sinusoidal shape.

    12. The method of claim 1, wherein the k-space regions of the partial measurements fully cover the k-space in a phase encoding direction.

    13. The method of claim 1, wherein the trained function is based on an artificial neural network.

    14. The method of claim 13, wherein the artificial neural network is a convolutional neural network.

    15. A computer-implemented method for providing a trained function for generating correction information for correcting mismatches in magnetic resonance measurements, the method comprising: receiving input training data, wherein the input training data comprises magnetic resonance data generated based on several partial measurements by a magnetic resonance device, wherein each partial measurement a k-space region has been sampled at least partially, wherein the k-space regions of different partial measurements differ at least partially in an extent in a readout direction, and wherein the extent of the readout direction of a respective partial measurement depends on prephasing gradients and readout gradients generated by the magnetic resonance device during the respective partial measurement of the different partial measurements; providing output training data, wherein the output training data comprises correction information for correcting a mismatch of the prephasing gradients and the readout gradients; training the function based on the input training data and the output training data; and providing the trained function.

    16. The method of claim 15, wherein the magnetic resonance data generated based on the partial measurements is transformed by a multiplicity of predefined items of correction information in order to generate a multiplicity of items of transformed magnetic resonance data with associated correction information, wherein the input training data comprises the modified magnetic resonance data, and wherein the output training data comprises the associated correction information.

    17. A magnetic resonance device comprising: a magnetic resonance data acquisition scanner configured to carry out partial measurements, wherein the magnetic resonance data acquisition scanner is configured to sample a k-space region at least partially during each partial measurement, wherein the k-space regions of different partial measurements differ at least partially in an extent in a readout direction, and wherein the extent in the readout direction of a respective partial measurement depends on prephasing gradients and readout gradients generated by the magnetic resonance data acquisition scanner during the respective partial measurement of the different partial measurements; a memory configured to store the magnetic resonance data generated by the magnetic resonance data acquisition scanner; and a computer configured to read out the magnetic resonance data from the memory and apply a trained function of a machine learning algorithm to the magnetic resonance data, wherein correction information for correcting a mismatch of the prephasing gradients and the readout gradients is generated and output.

    Description

    BRIEF DESCRIPTION OF THE DRAWINGS

    [0055] The above-described characteristics, features, and advantages of this disclosure, as well as the manner in which these are realized, will become clearer and more readily understandable in connection with the following description of the exemplary embodiments, which are explained in more detail in conjunction with the drawings, in which:

    [0056] FIG. 1 depicts an example of a schematic representation of a magnetic resonance device.

    [0057] FIG. 2 depicts an example of a sequence diagram of a RESOLVE sequence.

    [0058] FIG. 3 depicts an example of a k-space acquisition scheme of a RESOLVE sequence.

    [0059] FIG. 4 depicts exemplary phantom images, which have been generated with different correction factors.

    [0060] FIG. 5 depicts an example of a flow diagram of a method for generating correction information for correcting mismatches in magnetic resonance measurements.

    [0061] FIG. 6 depicts an example of a diagram to explain a method for generating correction information for correcting mismatches in magnetic resonance measurements.

    [0062] FIG. 7 depicts an exemplary k-space line.

    [0063] FIG. 8 depicts an example of two adjacent k-space lines.

    [0064] FIG. 9 depicts an example of two compressed k-space lines.

    [0065] FIG. 10 depicts an example of two extended k-space lines.

    [0066] FIG. 11 depicts an example of a flow diagram of a method for providing a trained function for correcting mismatches in magnetic resonance measurements.

    [0067] FIG. 12 depicts a schematic block diagram of a computer program product according to an embodiment.

    [0068] FIG. 13 depicts a schematic block diagram of a non-volatile, computer-readable storage medium according to an embodiment.

    DETAILED DESCRIPTION

    [0069] FIG. 1 depicts a magnetic resonance device 1 with a magnetic resonance data acquisition scanner 2. A transmit coil arrangement 3 is part of the magnetic resonance data acquisition scanner 2. The transmit coil arrangement 3 may include a single coil.

    [0070] Furthermore, the magnetic resonance apparatus 1 has a receive coil arrangement 4. The receive coil arrangement 4 is a coil arrangement with individual coils 5, 6, 7 and 8. In order to be able to distinguish more easily between the coils 5, 6, 7, and 8, the transmit coil arrangement 3 is shown dashed.

    [0071] A computer 9 controls the operation of the magnetic resonance device 1. The computer 9 serves as a control device and evaluation device, and may include microprocessors, FPGAs, integrated circuits, or the like. The nuclear magnetic resonance device 1 also has, as part of the computer 9 or independently therefrom, a non-volatile memory 10, in which the computer code for carrying out nuclear magnetic resonance measurements is stored.

    [0072] The receive coil arrangement 4 serves to read out the measured signal, which may be an echo signal. The coils 5, 6, 7, and 8 of the receive coil arrangement 4 read out the measured signal simultaneously. An individual coil may also be used as a detection coil instead of the receive coil arrangement 4.

    [0073] Further components of the nuclear magnetic resonance device 1, such as gradient coils and a patient bed, are not shown for the sake of clarity.

    [0074] FIG. 2 depicts a sequence diagram 11 of a RESOLVE sequence, which is known for example from Porter and Heidemann, “High Resolution Diffusion-Weighted Imaging Using Readout-Segmented Echo-Planar Imaging, Parallel Imaging and a Two-Dimensional Navigator-Based Reacquisition”, MRM, 62:468-475, 2009.

    [0075] A diffusion preparation section includes an excitation pulse 12 and a refocusing pulse 13. Slice selection gradients 14 and 15 are simultaneously provided in order to select a defined slice.

    [0076] An additional slice rephasing gradient 16 may be used to compensate the dephasing portion of the slice selection gradient 14. Furthermore, diffusion encoding gradients 17, 18, and 19 may be used before the refocusing pulse 13 and corresponding gradients 20, 21, and 22 after the refocusing pulse 13.

    [0077] The excitation pulse 12 and the selection gradient 14 and the slice rephasing gradient 16 are part of an excitation phase 23 of the RESOLVE sequence. The following development phase 24 lasts until the end of the diffusion gradients 20, 21, and 22.

    [0078] The readout phase 25 begins thereafter. A dephasing gradient 26 with different gradient moments, through variation of its strength, brings the start of the readout in the readout direction to a desired position in the k-space.

    [0079] A sinusoidal readout gradient 27 has a multiplicity of curves 30, 31, 32, 33, 34, 35, 36, and 37. Each of the curves 30, 31, 32, 33, 34, 35, 36, and 37 encodes a partial line in a readout direction in the k-space.

    [0080] Phase encoding gradients 38 displace the encoding by one act in the phase encoding direction. The phase encoding gradients 38 are also referred to as blips or gradient blips.

    [0081] An initial phase encoding gradient 39, like the dephasing gradient 26, sets the start of the readout in the phase encoding direction to a desired position in the k-space.

    [0082] All echo signals 40 of a region or segment may be acquired in the readout phase 25. All echo signals of an excitation cycle generate an echo train 41. At the end of the readout phase, the encoding is reset to the starting point through the creation of a gradient 42 which has the same gradient moment as the dephasing gradient 26 but the opposite sign.

    [0083] The readout phase 25 is followed by a navigator phase 43. The respective gradients 44, 45, 46, and 47 correspond to the analog gradients of the readout phase 25. The echo signals 48 are generated with a refocusing pulse 49 and a slice selection gradient 50.

    [0084] FIG. 3 depicts a k-space acquisition scheme, which corresponds to the sequence 11. An axis 51 designates the k(x) direction of the k-space 52 and an axis 53 designates the k(y) direction. The k(x) direction is also referred to as the readout direction and the k(y) direction as the phase encoding direction.

    [0085] Following preparation of the signal, (e.g., by diffusion weighting), the gradients 26 and 39 set the encoding to the first starting point 54. This is, as discussed above, a possible starting point for the enlargement or compression of the partial line 55. The partial line 55 is acquired while the curve 30 is being applied, and the partial line 56 is applied simultaneously with the curve 31. The displacement of the phase encoding direction is achieved by one of the phase encoding gradients 38.

    [0086] The additional partial lines 57, 58, 59, 60, 61, and 62 are generated in the same way. The partial lines 55 to 62 or echo signals 40 form an echo train 41.

    [0087] The partial lines 55 to 62 cover a region 63 of the k-space 52 which is segmented in the k(x) direction.

    [0088] The application of the sequence 11 using a dephasing gradient 26 with a different gradient moment enables the acquisition of the echo signals of one of the regions 64, 65, 66, or 67 of the k-space 52.

    [0089] If an echo train 41 has all echo signals of a region 63 to 67 of the k-space 52, a number of excitation cycles is required which corresponds to the number of regions of the k-space 52.

    [0090] If an echo train 41 has only a fraction of the echo signals of a k-space region, the excitation cycle is repeated more frequently. The k-space 52 is then divided into the readout direction and the phase encoding direction.

    [0091] The trajectories 68 and 69 of two adjacent regions, (e.g., regions 63 and 64), have a gap for the sake of clarity. In reality, the echo signals of a k-space line cover the k-space 52 without gaps.

    [0092] The images are reconstructed from the echo signals of all excitation cycles which have the same position as a k-space line in the phase encoding direction.

    [0093] FIG. 4 depicts exemplary phantom images B1 to B9, which have been generated with different correction factors. As may be seen from FIG. 4, ringing artifacts R occur for most of the correction factors. For the optimum correction factor (according to phantom image B2), the ringing artifacts R have substantially disappeared.

    [0094] FIG. 5 depicts a flow diagram of a method for generating correction information for correcting mismatches in magnetic resonance measurements.

    [0095] In method act S11, magnetic resonance data is generated by a magnetic resonance device 1 with the RESOLVE sequence according to FIG. 2 by carrying out several partial measurements. In each partial measurement, one of the regions 63 to 67 is sampled. The regions 63 to 67 all overlap one another slightly on the left or right side. The extent (e.g., location, size, or scale) of the k-space region of each partial measurement depends on the prephasing gradient 26 and the readout gradient 27.

    [0096] In method act S12, a trained function of a machine learning algorithm is applied to the received magnetic resonance data. Correction information for correcting a mismatch of the prephasing gradients 26 and readout gradients 27 is generated and output here. The trained function may be based on an artificial neural network, in particular a convolutional neural network.

    [0097] Furthermore, provision may be made for a magnetic resonance output image to be generated based on the magnetic resonance data, wherein the correction information output by the trained function is used to correct a mismatch of the prephasing gradients 26 and readout gradients 27. Here, the magnetic resonance output image may be generated based on k-space data.

    [0098] Furthermore, provision may be made for the magnetic resonance data to be k-space data, which is evaluated in order to generate a magnetic resonance image. The magnetic resonance image may be used as input data for the trained function. Alternatively, k-space data or certain subsets thereof may also be changed as input data for the trained function.

    [0099] The correction information for correcting the mismatch of the prephasing gradients 26 and readout gradients 27 may include at least one correction factor. This describes a correction of a data set of a partial measurement in the k-space. The correction may be a rescaling, a rotation, a phase modulation, and/or a displacement of the data set of the partial measurement in the k-space. For example, all k-space point coordinates which correspond to the partial lines may be multiplied by the correction factor. If the readout gradient 27 is too strong, a correction factor of less than 1 would be applied to a gradient moment in order to obtain the correct gradient moment if it were prospectively multiplied. If the readout gradient 27 is stronger than it should be, the sampled k-space is accordingly wider than it should be. Then, assuming that the starting point has the right position, a retrospective multiplication of the k-space point coordinates corrects the data in the same manner as the prospective multiplication applied to the gradient moments.

    [0100] The correction factors may be applied in the readout direction using a RESOLVE sequence. Correction factors greater than 1 extend the k-space lines in the readout direction, correction factors less than 1 compress them in the readout direction.

    [0101] The displaced raw data sets may be rastered on k-rasters with Cartesian grids. Furthermore, the correspondingly processed magnetic resonance data of the k-space may be Fourier transformed in order to generate an output image.

    [0102] FIG. 6 depicts a block diagram to explain a method for generating correction information for correcting mismatches in magnetic resonance measurements. Here, magnetic resonance data 101 is provided. The MR data 101 is evaluated, 102, wherein the multiplication by an initially predefined correction factor and a Fourier transformation may be included. The evaluation may also be applied only to one part of the magnetic resonance data 101, such as a single slice, a subset of the acquired regions, or a subset in the k-space.

    [0103] By the evaluation, a magnetic resonance image 103 is generated and provided to a trained function 104. This outputs an optimum correction factor so that an evaluation of the magnetic resonance data with the optimum correction factor is performed, 105. A corresponding magnetic resonance output image 106 is output. During generation of the magnetic resonance output image 106, the magnetic resonance data may be fully evaluated.

    [0104] FIG. 7 depicts one of the partial lines 55 to 62. The sampling density varies, in other words the k-space points 87 have different spacings, so that the k-space points 87 are rastered to a Cartesian grid. The k-space points 87 of a partial line represent one of the measured echo signals 40.

    [0105] FIG. 8 depicts two partial lines 59 and 81 of two adjacent regions 63 and 64 without application of a correction factor. The readout gradient 27 is weaker than assumed, so that there is a gap 88 between the regions 63 and 64. This gap is represented in an exaggerated manner in order to show the effects clearly.

    [0106] FIG. 9 depicts the same partial lines 59 and 81 if a correction factor of less than 1 is applied. Then the gap 88 is greater than previously, which results in stronger ringing artifacts.

    [0107] FIG. 10 depicts the partial lines 59 and 81 if a correction factor of greater than 1 and in particular the optimum correction factor is applied. The gap 88 has then disappeared and the k-space points are perfectly positioned.

    [0108] FIG. 11 depicts a flow diagram of a method for providing a trained function for generating correction information for correcting mismatches in magnetic resonance measurements.

    [0109] In method act S21, input training data is received, which includes magnetic resonance data which has been generated based on several partial measurements by a magnetic resonance device 1. In each partial measurement, a k-space region is sampled, wherein the k-space regions of different partial measurements differ at least partially in their extent in the readout direction. Overall, the entire k-space is to be covered. The extent in the readout direction depends on prephasing gradients and readout gradients, which the magnetic resonance device 1 generates during the partial measurements.

    [0110] In method act S22, output training data is provided, wherein the output training data includes correction information for correcting a mismatch of the prephasing gradients and readout gradients.

    [0111] In method act S23, the function is trained based on the input training data and the output training data.

    [0112] The trained function is provided in method act S24.

    [0113] An exemplary architecture of a convolutional neural network, on which the trained function is based, is shown in the following Table 1.

    TABLE-US-00001 TABLE 1 Slice Output format Number of parameters Conv2d [64, 96, 96] 9408 BatchNorm2d [64, 96, 96] 128 ReLU [64, 96, 96] 0 MaxPool2d [64, 48, 48] 0 Conv2d [64, 48, 48] 36864 BatchNorm2d [64, 48, 48] 128 ReLU [64, 48, 48] 0 Conv2d [64, 48, 48] 36864 BatchNorm2d [64, 48, 48] 128 Conv2d [64, 48, 48] 36864 BatchNorm2d [64, 48, 48] 128 ReLU [64, 48, 48] 0 Conv2d [64, 48, 48] 36864 BatchNorm2d [64, 48, 48] 128 Conv2d [128, 24, 24] 73728 BatchNorm2d [128, 24, 24] 256 ReLU [128, 24, 24] 0 Conv2d [128, 24, 24] 147456 BatchNorm2d [128, 24, 24] 256 Conv2d [128, 24, 24] 8192 BatchNorm2d [128, 24, 24] 256 Conv2d [128, 24, 24] 147456 BatchNorm2d [128, 24, 24] 256 ReLU [128, 24, 24] 0 Conv2d [128, 24, 24] 147456 BatchNorm2d [128, 24, 24] 256 Conv2d [256, 12, 12] 294912 BatchNorm2d [256, 12, 12] 512 ReLU [256, 12, 12] 0 Conv2d [256, 12, 12] 589824 BatchNorm2d [256, 12, 12] 512 Conv2d [256, 12, 12] 32768 BatchNorm2d [256, 12, 12] 512 Conv2d [256, 12, 12] 589824 BatchNorm2d [256, 12, 12] 512 ReLU [256, 12, 12] 0 Conv2d [256, 12, 12] 589824 BatchNorm2d [256, 12, 12] 512 Conv2d [512, 6, 6] 1179648 BatchNorm2d [512, 6, 6] 2359296 ReLU [512, 6, 6] 0 Conv2d [512, 6, 6] 2359296 BatchNorm2d [512, 6, 6] 1024 Conv2d [512, 6, 6] 131072 BatchNorm2d [512, 6, 6] 1024 Conv2d [512, 6, 6] 2359296 BatchNorm2d [512, 6, 6] 1024 ReLU [512, 6, 6] 0 Conv2d [512, 6, 6] 2359296 BatchNorm2d [512, 6, 6] 1024 AdaptiveAvgPool2d [512, 1, 1] 0 AdaptiveMaxPool2d [512, 1, 1] 0 Flatten [1024] 0 BatchNorm1d [1024] 2048 Dropout [1024] 0 Linear [512] 524800 ReLU [512] 0 BatchNorm1d [512] 1024 Dropout [512] 0 Linear [31] 1026

    [0114] The convolutional neural network shown is a ResNet18 architecture for image classification. In the final slice, a linear operation is performed which reduces the number of output variables to the number of possible correction factors. For example, 31 factors may be used in the region from 0.995 to 1.025. In an alternative variant, a regression takes place in the final act instead of a classification. This means that a continuous value in the range of 0.995 and 1.025 is output.

    [0115] Furthermore, provision may be made to train an artificial network such as a ResNet18 network, which outputs whether the input image has artifacts or is free from artifacts. In the final slice of the artificial network, two potential results are thus possible.

    [0116] The magnetic resonance data generated based on partial measurements may be transformed by a multiplicity of predefined items of correction information in order to generate a multiplicity of transformed items of magnetic resonance data with associated correction information. Here, the input training data may include the modified magnetic resonance data, and the output training data may include the associated correction information. In addition, a multiplication of the training data may take place by mirroring, rotation, scaling, compression or trimming. Because magnetic resonance measurements may acquire a multiplicity of parallel slices and may be recorded with a multiplicity of coil elements, a further multiplication of the training data may take place by a data set being divided into single-slice and single-channel images.

    [0117] FIG. 12 depicts a schematic block diagram of a computer program product P with executable program code PC. The executable program code PC is embodied to carry out the method described above when executed on a computer.

    [0118] FIG. 13 depicts a schematic block diagram of a non-volatile, computer-readable storage medium M with executable program code MC, embodied to carry out the method described above when executed on a computer.

    [0119] It is to be understood that the elements and features recited in the appended claims may be combined in different ways to produce new claims that likewise fall within the scope of the present disclosure. Thus, whereas the dependent claims appended below depend from only a single independent or dependent claim, it is to be understood that these dependent claims may, alternatively, be made to depend in the alternative from any preceding or following claim, whether independent or dependent, and that such new combinations are to be understood as forming a part of the present specification.

    [0120] Although the disclosure has been illustrated and described in detail by the exemplary embodiments, the disclosure is not restricted by the examples disclosed and other variations may be derived therefrom by a person skilled in the art without departing from the protective scope of the disclosure.