CN111696165A - Magnetic resonance image generation method and computer equipment - Google Patents
Magnetic resonance image generation method and computer equipment Download PDFInfo
- Publication number
- CN111696165A CN111696165A CN202010437656.5A CN202010437656A CN111696165A CN 111696165 A CN111696165 A CN 111696165A CN 202010437656 A CN202010437656 A CN 202010437656A CN 111696165 A CN111696165 A CN 111696165A
- Authority
- CN
- China
- Prior art keywords
- under
- acquired
- space data
- acquisition
- space
- 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.)
- Granted
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T11/00—2D [Two Dimensional] image generation
- G06T11/003—Reconstruction from projections, e.g. tomography
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01R—MEASURING ELECTRIC VARIABLES; MEASURING MAGNETIC VARIABLES
- G01R33/00—Arrangements or instruments for measuring magnetic variables
- G01R33/20—Arrangements or instruments for measuring magnetic variables involving magnetic resonance
- G01R33/44—Arrangements or instruments for measuring magnetic variables involving magnetic resonance using nuclear magnetic resonance [NMR]
- G01R33/48—NMR imaging systems
- G01R33/4818—MR characterised by data acquisition along a specific k-space trajectory or by the temporal order of k-space coverage, e.g. centric or segmented coverage of k-space
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T2210/00—Indexing scheme for image generation or computer graphics
- G06T2210/41—Medical
Landscapes
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- High Energy & Nuclear Physics (AREA)
- Condensed Matter Physics & Semiconductors (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Magnetic Resonance Imaging Apparatus (AREA)
Abstract
The invention discloses a generation method of a magnetic resonance image and computer equipment, wherein the method comprises the following steps: determining a full acquisition position and a plurality of under-acquisition positions of an object to be processed; determining full-acquisition K-space data of the full-acquisition position; determining a plurality of under-acquired K space data corresponding to the plurality of under-acquired positions respectively, and determining a plurality of target K space data corresponding to the plurality of under-acquired positions respectively based on 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 plurality of target K space data. According to the invention, one fully-acquired K space data and a plurality of under-acquired K space data are acquired, the time spent on the under-acquisition is less than that of the full acquisition, the time for generating the magnetic resonance image is effectively reduced, the target K space data is adopted to generate the magnetic resonance image, the patient can obtain the magnetic resonance image only by holding breath once, and the imaging quality of the magnetic resonance image is improved.
Description
Technical Field
The present invention relates to the field of magnetic resonance, and in particular, to a method and a computer device for generating a magnetic resonance image.
Background
At present, a GRE2D sequence is usually adopted to acquire an abdominal t1 weighted image, in the process of acquiring an abdominal magnetic resonance image, a patient needs to hold breath, the whole acquisition time needs to last for more than 20 seconds, and the patient cannot hold breath for such a long time, so that the patient needs to acquire the abdominal magnetic resonance image twice, namely the patient needs to hold breath twice, but the positions of the diaphragm muscles of the patient holding breath twice may not be consistent, so that the positions of the two acquired images are deviated, and the quality of the generated magnetic resonance image is poor.
Accordingly, the prior art is yet to be improved and developed.
Disclosure of Invention
The invention mainly aims to provide a magnetic resonance image generation method and computer equipment, so as to shorten the image acquisition time and ensure that the generated magnetic resonance image has good quality.
In a first aspect, the present invention provides a method for 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.
As a further improved technical solution, the fully-acquired K-space data includes a first numerical value strip 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.
As a further improved technical solution, the determining the under-acquired K-space data corresponding to the under-acquired position according to a preset under-acquired value includes:
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.
As a further improved technical scheme, for a first under-acquired K space data and a second under-acquired K space data in two under-acquired K space data, the under-acquired values corresponding to the first under-acquired K space data are different from the under-acquired values corresponding to the second under-acquired K space data.
As a further improved technical solution, the first under-acquired K space data corresponds to a first under-acquired identification set, the second under-acquired K space data corresponds to a second under-acquired identification set, and 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, a difference between an initial identification in the first under-acquired identification set and an initial identification in the second under-acquired identification set is greater than 0.
As a further improved technical solution, the first under-acquisition identifier set includes a start identifier and a plurality of candidate identifiers, where a difference between the start identifier and any candidate identifier is not less than 1, and a difference between any two candidate identifiers is not less than 1.
As a further improved technical solution, the determining, based on the fully-acquired K-space data and the under-acquired K-space data, a plurality of target K-space data corresponding to the under-acquired positions respectively includes:
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.
As a further improved technical solution, the generating a magnetic resonance image corresponding to the object to be processed according to the fully-acquired K-space data and the plurality of target K-space data includes:
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.
In a second aspect, the present invention provides a computer device comprising a memory and a processor, the memory storing a computer program, wherein the processor implements the following steps when executing the computer program:
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.
In a third aspect, the present invention provides a computer readable storage medium having a computer program stored thereon, wherein the computer program when executed by a processor implements the steps of:
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.
Compared with the prior art, the embodiment of the invention has the following advantages:
in the embodiment of the invention, a full acquisition position and a plurality of under-acquisition positions of an object to be processed are determined; 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. According to the invention, one fully-acquired K space data and a plurality of under-acquired K space data of the object to be processed are acquired, and one under-acquired K space data is less than one fully-acquired K space data, so that the time spent on under-acquisition is less than that of full acquisition.
Drawings
Fig. 1 is a schematic diagram of a method for generating a magnetic resonance image according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of fully acquired K-space data, first under-acquired K-space data, and second under-acquired 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 Description
In order to make the technical solutions of the present invention better understood, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The inventor finds that, generally, a GRE2D sequence is adopted to acquire an abdominal t1 weighted image, and in the process of acquiring an abdominal magnetic resonance image, a patient needs to hold his breath, the whole acquisition time needs to last for more than 20 seconds, and the patient cannot hold his breath for such a long time, so that the patient needs to acquire the abdominal magnetic resonance image twice, that is, the patient needs to hold his breath twice, but the positions of the diaphragm muscles of the patient holding his breath twice may not be consistent, so that the positions of the two acquired images are deviated, and the quality of the generated magnetic resonance image is not good.
In order to solve the above problem, in the embodiment of the present invention, a full acquisition position and a plurality of under-acquisition positions of an object to be processed are determined; 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. According to the invention, one fully-acquired K space data and a plurality of under-acquired K space data of the object to be processed are acquired, and one under-acquired K space data is less than one fully-acquired K space data, so that the time spent on under-acquisition is less than that of full acquisition.
Various non-limiting embodiments of the present invention are described in detail below with reference to the accompanying drawings.
Referring to fig. 1, a method for generating a magnetic resonance image in an embodiment of the present invention is shown, the method including:
and S1, determining a full acquisition position and a plurality of under-acquisition positions of the object to be processed.
In an embodiment of the present invention, the object to be processed may be an abdomen, i.e. an embodiment of the present invention is to generate a magnetic resonance image of an abdomen. The magnetic resonance imaging is rotating layer scanning, one tomographic image is combined into a multilayer three-dimensional tomographic image, and a plurality of images of an object to be processed are acquired in the acquisition process. Any two images correspond to different faults of different objects to be processed respectively. The full-acquisition position and the plurality of under-acquisition positions of the object to be processed are determined, different positions respectively correspond to different faults of the object to be processed, the full-acquisition position can be set as the position for scanning the image of the first fault, and the images of the rest faults respectively correspond to the plurality of under-acquisition positions.
And S2, carrying out full acquisition on the object to be processed at the full acquisition position so as to determine full acquisition K-space data at the full acquisition position.
In an embodiment of the invention, the K-space of the image of the first slice is fully acquired, the data of the first slice being fully acquired to determine fully acquired K-space data of said fully acquired position.
In the embodiment of the present invention, K-space is also called fourier space and is established during the process of performing frequency encoding, phase encoding and analog-to-digital conversion on the original Magnetic Resonance (MR) analog signals, and K-space data refers to original data which can be directly subjected to fourier transform to reconstruct an MR image. Each MR image has its corresponding K-space data lattice, and each point in K-space contains a complete MR spatial information.
In an embodiment of the present invention, the fully-acquired K-space data includes a first numerical bar fully-acquired K-space line; the acquired magnetic resonance signals fill one line of K-space, and thus the MR signals with spatial information are referred to as K-space lines. The first value may be 256, that is the fully acquired K-space data comprises a first value bar fully acquired K-space line.
S3, under-collecting the object to be processed at the under-collected positions respectively to determine a plurality of under-collected K space data corresponding to the under-collected positions respectively, and determining a plurality of target K space data corresponding to the under-collected positions respectively based on the fully-collected K space data and the under-collected K space data.
In the embodiment of the present invention, when acquiring K-space data of an object to be processed, images of the remaining slices (slices other than the first slice) are acquired by way of under-acquisition except for the image of the first slice. And if the number of the acquired K space lines is less than the first value, acquiring under. Less data is under-acquired relative to fully acquired data, and therefore, less time is spent under-acquiring than fully acquiring.
Specifically, step S3 includes:
s31, 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 comprise second numerical value under-acquired K space lines, and the sum of the second numerical value and the under-acquired value is equal to the first numerical value.
In an embodiment of the present invention, the preset under-acquisition value is used to determine the size of the under-acquired data, the full-acquisition K-space data includes a first numerical value of full-acquisition K-space lines, and the under-acquisition value is the number of the non-acquired K-space lines, for example, for a full-acquisition position and an under-acquisition position, the K-space data corresponding to the full-acquisition position includes 256K-space lines, and the K-space data corresponding to the under-acquisition position includes 224K-space lines, and with respect to the full-acquisition position, the K-space data corresponding to the under-acquisition position lacks 32K-space lines, that is, the under-acquisition value is 32.
In the embodiment of the present invention, the preset under-acquisition value is determined according to a preset sharing factor, the sharing factor is one of values from 0 to 0.5, when the sharing factor is 0, the actual under-acquisition value is a full acquisition (the under-acquisition value is 0), and when the sharing factor is 0.5, the under-acquisition value is 64.
Since the K space is circularly and symmetrically filled, when the first value is 256, K space lines are numbered from-128 to 128, wherein the K space lines numbered-128 and corresponding to 128 are data lines at the edge of the K space, the K space lines numbered-128 and corresponding to 128 are the highest frequency, and the lower the number value, 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 undersampling can be started from the high-frequency part and is symmetrically undersampled, namely, the undersampling is started from the edge part of the K space, and the imaging quality is not influenced. That is, when the K-space line numbered-128 is under-sampled, the K-space line numbered 128 is also under-sampled.
Specifically, step S31 includes:
s311, determining an under-acquisition K space corresponding to the under-acquisition position, wherein the under-acquisition K space comprises a second number of data bits and the under-acquisition number of under-acquisition bits;
s312, 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 do not have the under-acquired K space line.
In the embodiment of the invention, the under-acquired K space comprises under-acquired values and under-acquired positions, and during acquisition, data corresponding to the under-acquired values and the under-acquired positions are not acquired and only data corresponding to the second number of data positions are acquired.
In the embodiment of the present invention, the under-acquired values of each under-acquired K space may be set to be different from each other, and for a first under-acquired K space data and a second under-acquired K space data of the two under-acquired K space data, the under-acquired values corresponding to the first under-acquired K space data are different from the under-acquired values corresponding to the second under-acquired K space data.
In the embodiment of the present invention, if the under-acquired values corresponding to the first under-acquired K-space data and the under-acquired values corresponding to the second under-acquired K-space data are not completely the same, it is determined that the under-acquired values corresponding to the first under-acquired K-space data and the under-acquired values corresponding to the second under-acquired K-space data are different.
For example, when the under-acquisition value is 4, the under-acquisition bits corresponding to the first under-acquired K-space data include 125, -125,123 and-123, and the under-acquisition bits corresponding to the second under-acquired K-space data include 123, -123,121 and-121, and although both the first under-acquired K-space data and the second under-acquired K-space data are under-acquired with data with under-acquisition bits of 123 and-123, the under-acquisition values corresponding to the first under-acquired K-space data and the under-acquisition values corresponding to the second under-acquired K-space data are not completely the same, and the under-acquisition values corresponding to the first under-acquired K-space data and the under-acquisition values corresponding to the second under-acquired K-space data are considered to be different. In other words, the under-acquired bits in any two under-acquired K-space data may not be completely the same, that is, if the under-acquired bits corresponding to the first under-acquired K-space data are 125, -125,123 and-123, the under-acquired bits corresponding to the second under-acquired K-space data may not be 125, -125,123 and-123.
In an embodiment of the present invention, the first under-acquired K-space data corresponds to a first under-acquired identification set, the second under-acquired K-space data corresponds to a second under-acquired identification set, and 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, a difference between a start identifier in the first under-acquired identification set and a start identifier in the second under-acquired identification set is greater than 0.
Specifically, the first under-acquisition identifier set includes a plurality of under-acquisition identifiers, the under-acquisition identifiers are numbers of K-space lines, for example, the first under-acquisition identifier set is (125, -125,123, -123), and the second under-acquisition identifier set is (124, -124,122, -122); the start flag may be a flag with the largest value or a flag with the smallest value in the sets of under-acquired flags, for example, the first set of under-acquired flags may be (125, -125,123, -123), the start flag in the first set of under-acquired flags may be 125, the second set of under-acquired flags may be (124, -124,122, -122), and the start flag in the second set of under-acquired flags may be 124.
For example, referring to fig. 2, p1 is fully acquired K-space data, when the under-acquisition value is 4, p2 is first under-acquired K-space data, p3 is second under-acquired K-space data, the under-acquisition bits corresponding to the first under-acquired K-space data include 125, -125,123 and-123, and the under-acquisition bits corresponding to the second under-acquired K-space data may include 124, -124,122 and-122.
In this embodiment of the present invention, when an under-acquisition position corresponding to the first under-acquired K-space data is adjacent to an under-acquisition position corresponding to the second under-acquired K-space data, a difference between a start identifier in the first under-acquisition identifier and a start identifier in the second under-acquisition identifier is greater than 0, that is, a difference between a start identifier in the first under-acquisition identifier and a start identifier in the second under-acquisition identifier is at least 1, which is used to limit that the under-acquisition values corresponding to the first under-acquired K-space data are different from the under-acquisition values corresponding to the second under-acquired K-space data.
How to determine the under-acquired bits of an under-acquired K-space data is described next. For the first under-acquired K-space data, the corresponding first under-acquired identification set comprises an initial identification and a plurality of candidate identifications, wherein the difference between the initial identification and any candidate identification is not less than 1, and the difference between any two candidate identifications is not less than 1. The initial identifier may be a maximum identifier or a minimum identifier in the under-acquired identifier set, in the first under-acquired identifier set, identifiers other than the initial identifier are candidate identifiers, a difference between the initial identifier and any candidate identifier is not less than 1, and a difference between any two candidate identifiers is not less than 1, that is, under-acquisition is interlaced under-acquisition, that is, when the initial identifier is 125, the candidate identifier is at least 123, and when one candidate identifier is 123, the other candidate identifier is at least 121.
In the embodiment of the present invention, for the under-acquired K-space data corresponding to the second fault, that is, the under-acquired K-space data corresponding to the under-acquired position adjacent to the full-acquisition position, the start position in the under-acquired identification set corresponding to the under-acquired K-space data may be the highest-frequency position. The K-space lines numbered-128 and 128 have the highest frequency, i.e. the highest frequency position is 128 or-128.
Next, a process of determining a plurality of target K-space data corresponding to the plurality of under-acquired positions, respectively, based on the fully-acquired K-space data and the plurality of under-acquired K-space data will be specifically described. Specifically, step S3 includes:
s32, for an 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;
s33, filling the data line to be filled to an under-acquisition position corresponding to the under-acquired K space data to obtain target K space data corresponding to the under-acquired K space data;
in the embodiment of the present invention, the under-acquisition bits corresponding to the under-acquired K-space data may be represented by an under-acquisition identifier set, for example, the under-acquisition identifier set is (123, -123,121, -121), that is, K-space lines denoted by numbers 123, -123,121, and-121 do not acquire data. And acquiring full-acquisition K space lines with the numbers of 123, -123,121 and-121 in the full-acquisition K space data, and respectively filling the full-acquisition K space lines with the numbers of 123, -123,121 and-121 in the full-acquisition K space data into the under-acquisition K space data to obtain the target K space data. For a target K space data, the target K space data comprises a second numerical value strip under-acquired K space line and an under-acquired value strip full-acquired K space line, wherein the under-acquired value strip full-acquired K space line respectively corresponds to each under-acquired position of the under-acquired value.
And S4, 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.
In an embodiment of the invention, the magnetic resonance image comprises 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, one magnetic resonance sub-image is an image corresponding to a slice of the object to be processed.
Specifically, step S4 includes:
s41, generating a full-acquisition magnetic resonance image according to the full-acquisition K-space data;
s42, 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;
s43, determining the magnetic resonance image according to the fully-acquired magnetic resonance sub-image and the plurality of under-acquired magnetic resonance sub-images.
In the embodiment of the invention, a full-acquisition magnetic resonance sub-image corresponding to a full-acquisition position is generated according to full-acquisition K-space data, and an under-acquisition magnetic resonance sub-image corresponding to an under-acquisition position is generated according to target K-space data; the method can be realized by the existing method: and 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. Determining the magnetic resonance image from the fully acquired magnetic resonance sub-image and the plurality of under-acquired magnetic resonance sub-images.
In the embodiment of the invention, a full acquisition position and a plurality of under-acquisition positions of an object to be processed are determined; 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. According to the invention, one fully-acquired K space data and a plurality of under-acquired K space data of the object to be processed are acquired, and one under-acquired K space data is less than one fully-acquired K space data, so that the time spent on under-acquisition is less than that of full acquisition.
In the embodiment of the present invention, based on the above method for generating a magnetic resonance image, the present invention further provides a computer device, which may be a terminal, and the internal structure of which is shown in fig. 3. The computer device includes a processor, a memory, a network interface, a display screen, and an input device connected by a system bus. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device comprises a nonvolatile storage medium and an in-system memory. The non-volatile storage medium stores an operating system and a computer program. The in-system memory provides an environment for the operating system and the computer programs in the non-volatile storage medium to run. The network interface of the computer device is used for communicating with an external terminal through a network connection. The computer program is executed by a processor to implement a method of generating a magnetic resonance image. The display screen of the computer equipment can be a liquid crystal display screen or an electronic ink display screen, and the input device of the computer equipment can be a touch layer covered on the display screen, a key, a track ball or a touch pad arranged on the shell of the computer equipment, an external keyboard, a touch pad or a mouse and the like.
Those skilled in the art will appreciate that the illustration in fig. 3 is merely a block diagram of a portion of the structure associated with the disclosed aspects and is not intended to limit the computing devices to which the disclosed aspects apply, as particular computing devices may include more or less components than those shown, or may combine certain components, or have a different arrangement of components.
The embodiment of the invention provides computer equipment, which comprises a memory and a processor, wherein the memory stores a computer program, and the computer equipment is characterized in that the processor executes the computer program and realizes the following steps:
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.
An embodiment of the present invention further provides a computer-readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements the following steps:
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.
The technical features of the above embodiments can be arbitrarily combined, and for the sake of brevity, all possible combinations of the technical features in the above embodiments are not described, but should be considered as the scope of the present specification as long as there is no contradiction between the combinations of the technical features.
The above-mentioned embodiments only express several embodiments of the present application, and the description thereof is more specific and detailed, but not construed as limiting the scope of the invention. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the concept of the present application, which falls within the scope of protection of the present application. Therefore, the protection scope of the present patent shall be subject to the appended claims.
It is to be understood that the invention is not limited to the examples described above, but that modifications and variations may be effected thereto by those of ordinary skill in the art in light of the foregoing description, and that all such modifications and variations are intended to be within the scope of the invention as defined by the appended claims.
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.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010437656.5A CN111696165B (en) | 2020-05-21 | 2020-05-21 | Magnetic resonance image generation method and computer equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010437656.5A CN111696165B (en) | 2020-05-21 | 2020-05-21 | Magnetic resonance image generation method and computer equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111696165A true CN111696165A (en) | 2020-09-22 |
| CN111696165B CN111696165B (en) | 2023-09-15 |
Family
ID=72477170
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010437656.5A Active CN111696165B (en) | 2020-05-21 | 2020-05-21 | Magnetic resonance image generation method and computer equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111696165B (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050100202A1 (en) * | 2003-11-12 | 2005-05-12 | Feng Huang | Method for generating fast magnetic resonance images |
| DE102009025753A1 (en) * | 2008-05-06 | 2009-11-12 | General Electric Co. | System and method for using the parallel imaging technique with the compressed sensing technique |
| CN106339982A (en) * | 2016-08-24 | 2017-01-18 | 深圳先进技术研究院 | Fast magnetic resonance heart real-time cine imaging method and fast magnetic resonance heart real-time cine imaging system |
| CN106491131A (en) * | 2016-12-30 | 2017-03-15 | 深圳先进技术研究院 | A kind of dynamic imaging methods of magnetic resonance and device |
| CN106597333A (en) * | 2016-12-30 | 2017-04-26 | 上海联影医疗科技有限公司 | Magnetic resonance parallel imaging method and magnetic resonance imaging system |
| WO2017204468A1 (en) * | 2016-05-27 | 2017-11-30 | 한국과학기술원 | Method and apparatus for generating magnetic resonance image |
| CN110664378A (en) * | 2019-10-28 | 2020-01-10 | 中国科学院深圳先进技术研究院 | Magnetic resonance imaging method, device, system and storage medium |
-
2020
- 2020-05-21 CN CN202010437656.5A patent/CN111696165B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050100202A1 (en) * | 2003-11-12 | 2005-05-12 | Feng Huang | Method for generating fast magnetic resonance images |
| DE102009025753A1 (en) * | 2008-05-06 | 2009-11-12 | General Electric Co. | System and method for using the parallel imaging technique with the compressed sensing technique |
| WO2017204468A1 (en) * | 2016-05-27 | 2017-11-30 | 한국과학기술원 | Method and apparatus for generating magnetic resonance image |
| CN106339982A (en) * | 2016-08-24 | 2017-01-18 | 深圳先进技术研究院 | Fast magnetic resonance heart real-time cine imaging method and fast magnetic resonance heart real-time cine imaging system |
| CN106491131A (en) * | 2016-12-30 | 2017-03-15 | 深圳先进技术研究院 | A kind of dynamic imaging methods of magnetic resonance and device |
| CN106597333A (en) * | 2016-12-30 | 2017-04-26 | 上海联影医疗科技有限公司 | Magnetic resonance parallel imaging method and magnetic resonance imaging system |
| CN110664378A (en) * | 2019-10-28 | 2020-01-10 | 中国科学院深圳先进技术研究院 | Magnetic resonance imaging method, device, system and storage medium |
Non-Patent Citations (2)
| Title |
|---|
| 周山雪;谢国喜;: "基于多通道图像相关性的改进GRAPPA算法" * |
| 齐顺;赵海涛;宦怡;石明国;余厚军;葛雅丽;: "K空间在磁共振成像的临床应用" * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111696165B (en) | 2023-09-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103403569B (en) | Use the parallel MRI method that calibration scan, coil sensitivity map and omniselector compensate for rigid motion | |
| US9846217B2 (en) | Through-plane navigator | |
| US10274569B2 (en) | Magnetic resonance imaging system with ghost artifact reduction and method operation thereof | |
| US20160274209A1 (en) | Accelerated MRI Using Radial Strips and Undersampling of K-Space | |
| US10219787B2 (en) | Respiratory mode (“R-Mode”)—acquisition and display of cardiovascular images to show respiratory effects | |
| CN103380384B (en) | Use the magnetic resonance spectrum imaging method and apparatus with automatic phase and B0 correction of staggered water reference scan | |
| US20150310650A1 (en) | Merging magnetic resonance (MR) magnitude and phase images | |
| Zun et al. | Pseudocontinuous arterial spin labeling with prospective motion correction (PCASL‐PROMO) | |
| CN110095742A (en) | A kind of echo planar imaging neural network based and device | |
| CN110827369A (en) | Undersampling model generation method, image reconstruction method, device and storage medium | |
| US8143891B2 (en) | System for image acquisition with fast magnetic resonance gradient echo sequences | |
| US20200069214A1 (en) | Magnetic resonance imaging apparatus | |
| US10976397B2 (en) | MRI apparatus utilizing non-ultrashort TE(UTE) imaging to generate a mask image for performance of mask processing | |
| CN113970716B (en) | Gradient echo sequence fat pressing method and magnetic resonance imaging method and equipment | |
| CN111696165A (en) | Magnetic resonance image generation method and computer equipment | |
| US9234951B2 (en) | Method and device to generate magnetic resonance image data of an examination subject | |
| US10416265B2 (en) | Method and system for generating MR images of a moving object in its environment | |
| US10955507B2 (en) | Magnetic resonance imaging | |
| US9739858B2 (en) | Magnetic resonance imaging apparatus with segmented data acquisition | |
| CN111292388A (en) | Magnetic resonance imaging method, magnetic resonance imaging apparatus, electronic device, and storage medium | |
| CN111273207B (en) | Magnetic resonance imaging method, magnetic resonance imaging apparatus, electronic device, and storage medium | |
| EP4290262A1 (en) | Prospective slice tracking through interleaved perpendicular acquisitions of dynamic 2d cardiovascular mri | |
| CN115546330A (en) | Image reconstruction method and device, computer equipment and storage medium | |
| CN111948590B (en) | Magnetic resonance imaging method and device, electronic equipment and storage medium | |
| CN112578325B (en) | Magnetic resonance imaging method, magnetic resonance imaging apparatus, computer device, and storage medium |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |