CN111696165A - Magnetic resonance image generation method and computer equipment - Google Patents

Abstract

The invention discloses a method and computer equipment for generating a magnetic resonance image. The method includes: determining a full acquisition position and a number of under-acquisition positions of an object to be processed; determining full acquisition K-space data of the full acquisition position; determining a number of A number of under-collected k-space data corresponding to the under-collected positions respectively, and a number of target k-space data corresponding to several under-collected positions are determined based on the fully collected K-space data and some under-collected k-space data; according to the fully collected K-space data and several targets The k-space data generates a magnetic resonance image corresponding to the object to be processed. In the present invention, one fully-collected K-space data and several under-collected K-space data are collected, and the under-collection takes less time than full-collection, effectively reducing the time for generating a magnetic resonance image, and the target K-space data is used to generate a magnetic resonance image, The patient can obtain the magnetic resonance image with only one breath-hold, which improves the imaging quality of the magnetic resonance image.

Description

A method and computer equipment for generating magnetic resonance images

technical field

The present invention relates to the field of magnetic resonance, in particular to a method and computer equipment for generating a magnetic resonance image.

Background technique

At present, the GRE2D sequence is usually used to collect the abdominal t1-weighted image. During the acquisition of the abdominal magnetic resonance image, the patient needs to hold his breath. The entire acquisition time lasts for more than 20 seconds. The patient cannot hold his breath for such a long time, so it needs to be divided into two times. Acquisition, that is, the patient needs to hold the breath in two steps, but the position of the breath diaphragm muscle of the patient in two breath-holds may be inconsistent, which leads to deviations in the positions of the two acquired images, and the generated magnetic resonance images are of poor quality.

Therefore, the existing technology still needs to be improved and developed.

SUMMARY OF THE INVENTION

The main purpose of the present invention is to provide a method and computer equipment for generating a magnetic resonance image, so as to shorten the time of image acquisition, and the generated magnetic resonance image is of good quality.

In a first aspect, the present invention provides a method for generating a magnetic resonance image, the method comprising:

Determine the full collection position and several undercollection positions of the object to be processed;

Perform full acquisition on the object to be processed at the full acquisition position to determine full acquisition K-space data at the full acquisition position;

The objects to be processed are under-collected at the under-collection positions respectively to determine under-collection k-space data corresponding to the under-collection positions, and based on the fully collected k-space data and the under-collection k-space data Collecting K-space data to determine several target K-space data corresponding to the several under-collected positions respectively;

A magnetic resonance image corresponding to the object to be processed is generated according to the fully acquired K-space data and the several target K-space data.

As a further improved technical solution, the fully-collected K-space data includes a first value bar fully-collected K-space line; the under-collection is performed on the object to be processed at the several under-collected positions, respectively, to determine the number of Several under-collected K-space data corresponding to the under-collected positions, including:

For an under-collected position, the under-collected k-space data corresponding to the under-collected position is determined according to a preset under-collected value, wherein the under-collected k-space data includes a second value bar under-collected k-space line, and the first The sum of the two values and the undercollected value is equal to the first value.

As a further improved technical solution, determining the under-collected K-space data corresponding to the under-collected position according to the preset under-collected value includes:

determining that the under-collected position corresponds to the under-collected K-space, wherein the under-collected K-space includes a second value of data bits and the under-collected value of under-collected bits;

The under-collected k-space line of the second value bar is determined according to the second value and the data bits, so as to obtain under-collected k-space data, wherein the under-collected value and the under-collected bits have no under-collected k-space line.

As a further improved technical solution, for the first under-collected k-space data and the second under-collected k-space data among the two under-collected k-space data, the under-collected values corresponding to the first under-collected k-space data are The under-collected values and the under-collected bits corresponding to the second under-collected K-space data are different.

As a further improved technical solution, the first under-collected K-space data corresponds to a first under-collected bit identification set, and the second under-collected K-space data corresponds to a second under-collected position identification set. When the under-collection position corresponding to the k-space data is adjacent to the under-collection position corresponding to the second under-collected k-space data, the start identifier in the first under-collection identifier set and the start identifier in the second under-collection identifier set The difference between the start flags is greater than 0.

As a further improved technical solution, the first under-mined identifier set includes an initial identifier and several candidate identifiers, wherein the difference between the initial identifier and any candidate identifier is not less than 1, and the difference between any two candidate identifiers is not less than 1. The difference is not less than 1.

As a further improved technical solution, determining several target k-space data corresponding to the several under-collected positions based on the fully-collected k-space data and the several under-collected k-space data, including:

For a piece of under-collected K-space data, obtain the under-collected bit corresponding to the under-collected K-space data, and determine the data line to be filled according to the under-collected position corresponding to the under-collected K-space data and the fully collected K-space data ;

Filling the to-be-filled data line on the under-collected bit corresponding to the under-collected K-space data to obtain target K-space data corresponding to the under-collected K-space data.

As a further improved technical solution, generating the magnetic resonance image corresponding to the object to be processed according to the fully acquired K-space data and the several target K-space data includes:

generating a full-acquisition magnetic resonance sub-image according to the full-acquisition K-space data;

for a target k-space data, generating an under-acquisition magnetic resonance sub-image corresponding to the target k-space data according to the target k-space data;

The magnetic resonance image is determined from the full-acquired magnetic resonance sub-image and a number of under-acquired magnetic resonance sub-images.

In a second aspect, the present invention provides a computer device, comprising a memory and a processor, wherein the memory stores a computer program, wherein the processor implements the following steps when executing the computer program:

Determine the full collection position and several undercollection positions of the object to be processed;

Perform full acquisition on the object to be processed at the full acquisition position to determine full acquisition K-space data at the full acquisition position;

The objects to be processed are under-collected at the under-collection positions respectively to determine under-collection k-space data corresponding to the under-collection positions, and based on the fully collected k-space data and the under-collection k-space data Collecting K-space data to determine several target K-space data corresponding to the several under-collected positions respectively;

A magnetic resonance image corresponding to the object to be processed is generated according to the fully acquired K-space data and the several target K-space data.

In a third aspect, the present invention provides a computer-readable storage medium on which a computer program is stored, wherein the computer program implements the following steps when executed by a processor:

Determine the full collection position and several undercollection positions of the object to be processed;

Perform full acquisition on the object to be processed at the full acquisition position to determine full acquisition K-space data at the full acquisition position;

The objects to be processed are under-collected at the under-collection positions respectively to determine under-collection k-space data corresponding to the under-collection positions, and based on the fully collected k-space data and the under-collection k-space data Collecting K-space data to determine several target K-space data corresponding to the several under-collected positions respectively;

A magnetic resonance image corresponding to the object to be processed is generated according to the fully acquired K-space data and the several target K-space data.

Compared with the prior art, the embodiment of the present invention has the following advantages:

In the embodiment of the present invention, the full collection position and several under-collection positions of the object to be processed are determined; the full collection of the to-be-processed object is performed at the full collection position to determine the full collection K-space data of the full collection position; The objects to be processed are under-collected at the under-collection positions respectively to determine under-collection k-space data corresponding to the under-collection positions, and based on the fully collected k-space data and the under-collection k-space data Collecting K-space data to determine several target K-space data corresponding to the several under-collected positions respectively; generating a magnetic resonance image corresponding to the object to be processed according to the fully-collected K-space data and the several target K-space data. In the present invention, one fully-collected k-space data and several under-collected k-space data of the object to be processed are collected, and one under-collected k-space data is less than one fully-collected k-space data, so the time spent in under-collection is less than that in full collection , because the time for collecting the data of the object to be processed is reduced, the time for generating the magnetic resonance image is effectively reduced, and the fully collected K-space data is used to fill the uncollected data in the under-collected K-space data, and then the magnetic resonance image is generated, which will not affect the imaging. The patient can obtain a magnetic resonance image with only one breath-hold, which improves the imaging quality of the magnetic resonance image.

Description of drawings

1 is a schematic diagram of a method for generating a magnetic resonance image in an embodiment of the present invention;

2 is a schematic diagram of fully-collected k-space data, first under-collected k-space data, and second under-collected k-space data in an embodiment of the present invention;

FIG. 3 is an internal structural diagram of a computer device in an embodiment of the present invention.

Detailed ways

In order to make those skilled in the art better understand the solutions of the present invention, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only These are some embodiments of the present invention, but not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative efforts shall fall within the protection scope of the present invention.

The inventor found through research that the GRE2D sequence is usually used to collect abdominal t1-weighted images. During the process of collecting abdominal magnetic resonance images, the patient needs to hold his breath. The entire acquisition time lasts for more than 20 seconds, and the patient cannot hold his breath for such a long time. Two acquisitions are required, that is, the patient needs to hold the breath twice, but the position of the breath diaphragm of the patient may be inconsistent, resulting in deviations in the positions of the two acquired images and poor quality of the generated magnetic resonance images.

In order to solve the above problem, in the embodiment of the present invention, the full collection position and several under-collection positions of the object to be processed are determined; Full collection of K-space data; under-collection of the object to be processed at the under-collected positions to determine a plurality of under-collected K-space data corresponding to the under-collected positions, and based on the fully collected K-space The data and the several under-collected K-space data determine several target K-space data corresponding to the several under-collected positions respectively; Magnetic resonance images. In the present invention, one fully-collected k-space data and several under-collected k-space data of the object to be processed are collected, and one under-collected k-space data is less than one fully-collected k-space data, so the time spent in under-collection is less than that in full collection , because the time for collecting the data of the object to be processed is reduced, the time for generating the magnetic resonance image is effectively reduced, and the fully collected K-space data is used to fill the uncollected data in the under-collected K-space data, and then the magnetic resonance image is generated, which will not affect the imaging. The patient can obtain a magnetic resonance image with only one breath-hold, which improves the imaging quality of the magnetic resonance image.

Various non-limiting embodiments of the present invention will be described in detail below with reference to the accompanying drawings.

Referring to FIG. 1, a method for generating a magnetic resonance image according to an embodiment of the present invention is shown, and the method includes:

S1. Determine the full collection position and several undercollection positions of the object to be processed.

In the embodiment of the present invention, the object to be processed may be the abdomen, that is, the embodiment of the present invention is to generate a magnetic resonance image of the abdomen. Magnetic resonance imaging is a rotary tomographic scan, in which tomographic images are combined into multi-layer three-dimensional tomographic images. During the acquisition process, multiple images of the object to be processed will be acquired. Any two images correspond to different slices of different objects to be processed. Determine the full acquisition position and several under-acquisition positions of the object to be processed. Different positions correspond to different slices of the object to be processed. The full acquisition position can be set as the position where the image of the first slice is scanned, and the images of the other slices correspond to several slices. Under-collection location.

S2. Perform full collection of the object to be processed at the full collection position to determine full collection K-space data at the full collection position.

In this embodiment of the present invention, the K-space of the image of the first tomography is completely acquired, and the data of the first tomography is fully acquired to determine the fully acquired K-space data of the fully acquired position.

In this embodiment of the present invention, K-space, also called Fourier space, is established in the process of performing frequency encoding, phase encoding and analog-to-digital conversion on the original magnetic resonance (MR) analog signal, while K-space data is Refers to the original data that can be directly reconstructed by Fourier transform to reconstruct the MR image. Each MR image has its corresponding K-space data lattice, and each point in the K-space contains a complete MR spatial information.

In the embodiment of the present invention, the fully-collected K-space data includes a first-value line in the fully-collected K-space; the collected magnetic resonance signal is filled with a line in the K-space, therefore, the MR signal with spatial information is called is the K-space line. The first value may be 256, that is to say, the fully-collected k-space data includes the first value bar and the fully-collected k-space line.

S3. Under-collect the object to be processed at the under-collection positions, respectively, to determine a number of under-collected K-space data corresponding to the under-collection positions, and based on the fully collected K-space data and the Several under-collected k-space data determine several target k-space data corresponding to the several under-collected positions respectively.

In the embodiment of the present invention, when collecting the K-space data of the object to be processed, except for the image of the first tomography, the images of the other tomography (slices other than the first tomography) are acquired by means of under-acquisition. If the number of K-space lines collected is less than the first value, it is under-collection. There is less under-collected data relative to fully-collected data, so under-collection takes less time than full-collection.

Specifically, step S3 includes:

S31. For an under-collected position, determine under-collected k-space data corresponding to the under-collected position according to a preset under-collected value, wherein the under-collected k-space data includes a second value bar under-collected k-space line, so The sum of the second value and the undercollected value is equal to the first value.

In this embodiment of the present invention, the preset under-collected value is used to determine the size of the under-collected data, the fully collected K-space data includes the first value bar and the fully collected K-space line, and the under-collected value is the uncollected value The number of k-space lines, for example, for a full-collection position and an under-collection position, the k-space data corresponding to the full-collection position includes 256 k-space lines, and the k-space data corresponding to the under-collection position includes 224 k-space lines, Compared with the full collection position, the K-space data corresponding to the under-collection position lacks 32 k-space lines, that is, the under-collection value is 32.

In this embodiment of the present invention, the preset under-collection value is determined according to a preset sharing factor, and the sharing factor is a value between 0 and 0.5. When the sharing factor is 0, it is actually full collection (the under-collection value is a value between 0 and 0.5). 0), when the sharing factor is 0.5, the underacquisition value is 64.

Since the k-space is filled cyclically symmetrically, when the first value is 256, the k-space lines are numbered from -128 to 128, wherein the k-space lines numbered -128 and 128 correspond to the data of the k-space edge Lines, the K-space lines numbered -128 and numbered 128 have the highest frequency, and the smaller the number, the lower the frequency. Because the data of the low-frequency part of the K space determines the contrast of the image, and the data of the high-frequency part determines the resolution of the image, the under-sampling can start from the high-frequency part and symmetrically under-sampling, that is, the under-sampling starts from the edge of the K-space, and the under-sampling starts from the high-frequency part. will affect the image quality. That is to say, when the k-space line corresponding to the number -128 is under-mined, the k-space line corresponding to the number 128 is also under-mined.

Specifically, step S31 includes:

S311, determining that the under-collected position corresponds to the under-collected K space, wherein the under-collected K-space includes a second value of data bits and the under-collected value of under-collected bits;

S312. Determine the under-collected k-space line of the second value bar according to the second value and the data bits, so as to obtain under-collected k-space data, wherein the under-collected value and under-collected bits have no under-collected k-space line.

In this embodiment of the present invention, the under-collected K space includes under-collected values and under-collected bits. During collection, the data corresponding to the under-collected values and under-collected bits are not collected, and only the data corresponding to the second value and the data bits are collected. .

In this embodiment of the present invention, the under-collected value of each under-collected K-space can be set to 1 under-collected bits. For the first under-collected K-space data and the second under-collected K-space data among the two under-collected K-space data, The under-collected values and under-collected bits corresponding to the first under-collected K-space data are different from the under-collected values and under-collected bits corresponding to the second under-collected K-space data.

In the embodiment of the present invention, if the under-collected values and under-collected bits corresponding to the first under-collected K-space data and the under-collected values and under-collected bits corresponding to the second under-collected K-space data are not identical, it is considered that The under-collected values and under-collected bits corresponding to the first under-collected K-space data are different from the under-collected values and under-collected bits corresponding to the second under-collected K-space data.

For example, when the under-collection value is 4, the under-collected bits corresponding to the first under-collected k-space data include 125, -125, 123, and -123, and the under-collected bits corresponding to the second under-collected k-space data include 123, -123, 121 and -121, although the first under-collected k-space data and the second under-collected k-space data both under-collected data with under-collected bits 123 and -123, the under-collection corresponding to the first under-collected k-space data If the under-collected value and the under-collected bits corresponding to the second under-collected K-space data are not identical, it is considered that the under-collected value and under-collected bits corresponding to the first under-collected K-space data are considered to be under-collected. The under-collected values and under-collected bits corresponding to the second under-collected K-space data are different. To put it another way, the under-collected bits in any two under-collected k-space data cannot be exactly the same, that is, if the under-collected bits corresponding to the first under-collected k-space data are 125, -125, 123, and -123 , the under-collected bits corresponding to the second under-collected K-space data cannot be 125, -125, 123, and -123.

In this embodiment of the present invention, the first under-collected K-space data corresponds to a first under-collected bit identification set, and the second under-collected K-space data corresponds to a second under-collected position identification set. When the under-collection position corresponding to the k-space data is adjacent to the under-collection position corresponding to the second under-collected k-space data, the start identifier in the first under-collection identifier set and the start identifier in the second under-collection identifier set The difference between the start flags is greater than 0.

Specifically, the first under-collected identifier set includes a plurality of under-collected identifiers, and the under-collected identifiers are numbers of k-space lines. For example, the first under-collected identifier set is (125, -125, 123, -123), the first The second undercollected identifier set is (124,-124,122,-122); the start identifier may be the identifier with the largest value or the smallest value in the undercollected identifier set, for example, the first undercollected identifier set is (125,- 125, 123, -123), the starting identifier in the first under-collected identifier set may be 125, the second under-collected identifier set is (124, -124, 122, -122), and the starting identifier in the second under-collected identifier set may be 124 .

For example, referring to FIG. 2, p1 is the fully collected K-space data, when the under-collection value is 4, p2 is the first under-collected K-space data, p3 is the second under-collected K-space data, and the first under-collected K-space data corresponds to The under-collected bits of 1 include 125, -125, 123, and -123, and the under-collected bits corresponding to the second under-collected K-space data may include 124, -124, 122, and -122.

In this embodiment of the present invention, when the under-collected position corresponding to the first under-collected K-space data is adjacent to the under-collected position corresponding to the second under-collected K-space data, the first under-collected position identifiers are concentrated The difference between the start identifier in the first undercollection identifier set and the start identifier in the second undercollection identifier set is greater than 0, that is, the difference between the start identifier in the first undercollection identifier set and the start identifier in the second undercollection identifier set is greater than 0. The difference is at least 1, which is used to define that the under-collected value and under-collected bits corresponding to the first under-collected K-space data are different from the under-collected value and under-collected bits corresponding to the second under-collected K-space data.

Next, we describe how to determine the undercollected bits of an undercollected k-space data. For the first under-collected k-space data, the corresponding first under-collected identifier set includes a start identifier and several candidate identifiers, wherein the difference between the start identifier and any candidate identifier is not less than 1, and the difference between any two candidate identifiers is not less than 1. The difference is not less than 1. The starting identifier may be the identifier with the largest value or the identifier with the smallest value in the under-collected identifier set, and in the first under-collected identifier set, identifiers other than the starting identifier are candidate identifiers, and the starting identifier is the same as any one. The difference between the candidate identifiers is not less than 1, and the difference between any two candidate identifiers is not less than 1, that is, under-selection is interlaced under-selection, that is, when the starting identifier is 125, the candidate identifier is at least 123, when a candidate identifier is at least 123. When the identifier is 123, the other candidate identifier is at least 121.

In the embodiment of the present invention, for the under-collected K-space data corresponding to the second fault, that is, the under-collected K-space data corresponding to the under-collected position adjacent to the full collection position, the under-collected identifications corresponding to the under-collected K-space data are concentrated The starting position can be the highest frequency position. The K-space lines numbered -128 and 128 correspond to the highest frequency, that is, the highest frequency position is 128 or -128.

Next, the process of determining several target k-space data corresponding to the several under-collected positions respectively based on the fully-collected k-space data and the several under-collected k-space data is specifically introduced. Specifically, step S3 includes:

S32. For a piece of under-collected K-space data, obtain the under-collected bits corresponding to the under-collected K-space data, and determine to be filled according to the under-collected bits corresponding to the under-collected K-space data and the fully collected K-space data data line;

S33, filling the data line to be filled on the under-collected position corresponding to the under-collected k-space data to obtain target k-space data corresponding to the under-collected k-space data;

In this embodiment of the present invention, the under-collected bits corresponding to the under-collected K-space data may be represented by the under-collected identification set. For example, the under-collected identification set is (123, -123, 121, -121), which means the numbers are 123, -123 , 121, and -121 k-space lines were not collected. Obtain the fully acquired K-space lines numbered 123, -123, 121 and -121 in the fully acquired K-space data, and separate the fully acquired K-space lines numbered 123, -123, 121 and -121 Fill into the under-collected k-space data to obtain the target k-space data. For a target k-space data, the target k-space data includes a second value bar under-collected k-space line, and an under-collected value bar full-collected k-space line, wherein the under-collected value bar full-collected k-space line corresponds to the under-collected value bar respectively. The value is each undercollected bit.

S4. Generate a magnetic resonance image corresponding to the object to be processed according to the fully acquired K-space data and the several target K-space data.

In the embodiment of the present invention, the magnetic resonance image includes a plurality of magnetic resonance sub-images, and one magnetic resonance sub-image is an image corresponding to a full acquisition position or an under-acquisition position, that is, a magnetic resonance sub-image is an image of the object to be processed. An image corresponding to a tomography.

Specifically, step S4 includes:

S41, generating a fully acquired magnetic resonance sub-image according to the fully acquired K-space data;

S42. For a target K-space data, generate an under-acquisition magnetic resonance sub-image corresponding to the target K-space data according to the target K-space data;

S43. Determine the magnetic resonance image according to the fully acquired magnetic resonance sub-image and several under-acquired magnetic resonance sub-images.

In the embodiment of the present invention, a fully-collected magnetic resonance sub-image corresponding to a full-collection position is generated according to the fully-collected K-space data, and an under-collected magnetic resonance sub-image corresponding to an under-collection position is generated according to the target K-space data; this can be achieved by existing methods. : generating a full-acquisition magnetic resonance sub-image corresponding to the full-acquisition position according to the full-acquisition K-space data, and generating an under-acquisition magnetic resonance sub-image corresponding to the under-acquisition position according to the target K-space data. The magnetic resonance image is determined from the full-acquired magnetic resonance sub-image and a number of under-acquired magnetic resonance sub-images.

In the embodiment of the present invention, the full collection position and several under-collection positions of the object to be processed are determined; the full collection of the to-be-processed object is performed at the full collection position to determine the full collection K-space data of the full collection position; The objects to be processed are under-collected at the under-collection positions respectively to determine under-collection k-space data corresponding to the under-collection positions, and based on the fully collected k-space data and the under-collection k-space data Collecting K-space data to determine several target K-space data corresponding to the several under-collected positions respectively; generating a magnetic resonance image corresponding to the object to be processed according to the fully-collected K-space data and the several target K-space data. In the present invention, one fully-collected k-space data and several under-collected k-space data of the object to be processed are collected, and one under-collected k-space data is less than one fully-collected k-space data, so the time spent in under-collection is less than that in full collection , because the time for collecting the data of the object to be processed is reduced, the time for generating the magnetic resonance image is effectively reduced, and the fully collected K-space data is used to fill the uncollected data in the under-collected K-space data, and then the magnetic resonance image is generated, which will not affect the imaging. The patient can obtain a magnetic resonance image with only one breath-hold, which improves the imaging quality of the magnetic resonance image.

In an embodiment of the present invention, based on the foregoing method for generating a magnetic resonance image, the present invention also provides a computer device correspondingly, the device may be a terminal, and the internal structure is shown in FIG. 3 . The computer equipment includes a processor, memory, a network interface, a display screen, and an input device connected by a system bus. Among them, the processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an in-system memory. The nonvolatile storage medium stores an operating system and a computer program. The in-system memory provides an environment for the execution of the operating system and computer programs in the non-volatile storage medium. The network interface of the computer device is used to communicate with an external terminal through a network connection. The computer program, when executed by the processor, implements a method of generating a magnetic resonance image. The display screen of the computer equipment may be a liquid crystal display screen or an electronic ink display screen, and the input device of the computer equipment may be a touch layer covered on the display screen, or a button, a trackball or a touchpad set on the shell of the computer equipment , or an external keyboard, trackpad, or mouse.

Those skilled in the art can understand that the block diagram shown in FIG. 3 is only a partial structure related to the solution of the present application, and does not constitute a limitation on the computer equipment to which the solution of the present application is applied. shown in more or less components, or in combination with certain components, or with different arrangements of components.

An embodiment of the present invention provides a computer device, including a memory and a processor, wherein the memory stores a computer program, wherein the processor implements the following steps when executing the computer program:

Determine the full collection position and several undercollection positions of the object to be processed;

Perform full acquisition on the object to be processed at the full acquisition position to determine full acquisition K-space data at the full acquisition position;

The objects to be processed are under-collected at the under-collection positions respectively to determine under-collection k-space data corresponding to the under-collection positions, and based on the fully collected k-space data and the under-collection k-space data Collecting K-space data to determine several target K-space data corresponding to the several under-collected positions respectively;

A magnetic resonance image corresponding to the object to be processed is generated according to the fully acquired K-space data and the several target K-space data.

An embodiment of the present invention also provides a computer-readable storage medium on which a computer program is stored, and is characterized in that, when the computer program is executed by a processor, the following steps are implemented:

Determine the full collection position and several undercollection positions of the object to be processed;

Perform full acquisition on the object to be processed at the full acquisition position to determine full acquisition K-space data at the full acquisition position;

The objects to be processed are under-collected at the under-collection positions respectively to determine under-collection k-space data corresponding to the under-collection positions, and based on the fully collected k-space data and the under-collection k-space data Collecting K-space data to determine several target K-space data corresponding to the several under-collected positions respectively;

A magnetic resonance image corresponding to the object to be processed is generated according to the fully acquired K-space data and the several target K-space data.

The technical features of the above embodiments can be combined arbitrarily. For the sake of brevity, all possible combinations of the technical features in the above embodiments are not described. However, as long as there is no contradiction in the combination of these technical features, all It is considered to be the range described in this specification.

The above-mentioned embodiments only represent several embodiments of the present application, and the descriptions thereof are relatively specific and detailed, but should not be construed as a limitation on the scope of the invention patent. It should be noted that, for those skilled in the art, without departing from the concept of the present application, several modifications and improvements can be made, which all belong to the protection scope of the present application. Therefore, the scope of protection of the patent of the present application shall be subject to the appended claims.

It should be understood that the application of the present invention is not limited to the above examples. For those of ordinary skill in the art, improvements or transformations can be made according to the above descriptions, and all these improvements and transformations should belong to the protection scope of the appended claims of the present invention.

Claims (10)

1. A method of generating a magnetic resonance image, the method comprising:

determining a full acquisition position and a plurality of under-acquisition positions of an object to be processed;

fully acquiring the object to be processed at the full acquisition position to determine full acquisition K space data of the full acquisition position;

respectively performing under-acquisition on the object to be processed at the plurality of under-acquisition positions to determine a plurality of under-acquired K space data corresponding to the plurality of under-acquisition positions, and determining a plurality of target K space data corresponding to the plurality of under-acquisition positions on the basis of the fully-acquired K space data and the plurality of under-acquired K space data;

and generating a magnetic resonance image corresponding to the object to be processed according to the fully-acquired K space data and the target K space data.

2. The method of claim 1, wherein the fully acquired K-space data comprises a first numerical bar fully acquired K-space line; the under-collecting of the object to be processed at the under-collecting positions is performed respectively to determine a plurality of under-collected K-space data corresponding to the under-collecting positions respectively, including:

for an under-acquired position, determining under-acquired K space data corresponding to the under-acquired position according to a preset under-acquired value, wherein the under-acquired K space data comprises a second numerical value under-acquired K space line, and the sum of the second numerical value and the under-acquired value is equal to the first numerical value.

3. The method according to claim 2, wherein the determining the under-acquired K-space data corresponding to the under-acquired position according to the preset under-acquired value comprises:

determining an under-acquisition K space corresponding to the under-acquisition position, wherein the under-acquisition K space comprises a second numerical value data bit and the under-acquisition value under-acquisition bits;

and determining a second numerical value under-acquired K space line according to the second numerical value data bits to obtain under-acquired K space data, wherein the under-acquired value under-acquired bits have no under-acquired K space line.

4. The method of claim 3, wherein for a first undersampled K-space data and a second undersampled K-space data of the two undersampled K-space data, the undersampled values for the first undersampled K-space data and the undersampled values for the second undersampled K-space data are different.

5. The method of claim 4, wherein the first under-acquired K-space data corresponds to a first under-acquired identification set, wherein the second under-acquired K-space data corresponds to a second under-acquired identification set, and wherein a difference between a starting identification in the first under-acquired identification set and a starting identification in the second under-acquired identification set is greater than 0 when an under-acquired position corresponding to the first under-acquired K-space data is adjacent to an under-acquired position corresponding to the second under-acquired K-space data.

6. The method of claim 5, wherein the first set of under-sampled identifiers comprises a start identifier and a plurality of candidate identifiers, wherein the start identifier and any candidate identifier have a difference of not less than 1, and wherein the difference between any two candidate identifiers has a difference of not less than 1.

7. The method of claim 4, wherein determining a plurality of target K-space data corresponding to the plurality of under-acquired locations based on the fully-acquired K-space data and the plurality of under-acquired K-space data comprises:

for one piece of under-acquired K space data, acquiring an under-acquisition position corresponding to the under-acquired K space data, and determining a data line to be filled according to the under-acquisition position corresponding to the under-acquired K space data and the fully-acquired K space data;

and filling the data line to be filled to the under-acquisition position corresponding to the under-acquired K space data to obtain the target K space data corresponding to the under-acquired K space data.

8. The method according to claim 7, wherein the generating a magnetic resonance image corresponding to the object to be processed from the fully-acquired K-space data and the target K-space data comprises:

generating a fully-acquired magnetic resonance image according to the fully-acquired K-space data;

for one target K space data, generating an under-acquired magnetic resonance sub-image corresponding to the target K space data according to the target K space data;

determining the magnetic resonance image from the fully acquired magnetic resonance sub-image and the plurality of under-acquired magnetic resonance sub-images.

9. A computer device comprising a memory and a processor, the memory storing a computer program, wherein the processor implements the steps of the method of any one of claims 1 to 8 when executing the computer program.

10. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of the method of any one of claims 1 to 8.

Images