CN103995244B - Magnetic resonance imaging method - Google Patents
Magnetic resonance imaging method Download PDFInfo
- Publication number
- CN103995244B CN103995244B CN201410175413.3A CN201410175413A CN103995244B CN 103995244 B CN103995244 B CN 103995244B CN 201410175413 A CN201410175413 A CN 201410175413A CN 103995244 B CN103995244 B CN 103995244B
- Authority
- CN
- China
- Prior art keywords
- data
- space
- image
- imaging method
- magnetic resonance
- 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.)
- Active
Links
Landscapes
- Magnetic Resonance Imaging Apparatus (AREA)
Abstract
The invention provides a magnetic resonance imaging method. According to the method, an image is acquired based on iterative calculation of an image domain and a K spatial domain. The method according to the invention comprises the following steps: S1, regularly under-sampling a K space along a specified encoding direction; and S2, carrying out iterative calculation based on an image domain and a K spatial domain to obtain unacquired K space data so as to obtain a magnetic resonance image. The magnetic resonance imaging method of the invention can be realized both through multiple channels and through a single channel. Only part of under-sampling data is acquired. Fast magnetic resonance imaging is realized through iterative calculation performed between the image domain and the K spatial domain. The image acquisition time is greatly shortened, and high imaging quality can be obtained. The magnetic resonance imaging method of the invention can be used for shortening the scanning time or improving the signal-to-noise ratio under the condition of same scanning time.
Description
Technical field
The present invention relates to mr imaging technique, more particularly, to a kind of fast based on image area and K spatial domain iteration
Fast MR imaging method.
Background technology
Sweep speed is the bottleneck of magnetic resonance imaging development.The image taking speed for how effectively improving magnetic resonance is always to grind
The key project in originating party face.Directly gradient coil performance or main field strength are improved, it is necessary to hardware device cost higher, and
By all many limitations such as physics, engineering, physiology, safety.Therefore, the approach such as scanning or algorithm for reconstructing are improved increasingly to receive
To the attention of domestic and foreign scholars.
In recent years, developing more active fast imaging method mainly includes compressed sensing, parallel imaging and SPEED
(Skipped Phase Encoding and Edge Deghosting) method etc..
The sampling thheorem that compressed sensing imaging technique breaches Shannon-Nyquist necessarily be greater than 2 times on sample frequency
The limitation of signal bandwidth, the focus as Recent study.Although compressed sensing can realize fast imaging in theory,
Also many practical problems have to be solved, for example, lack antinoise Its Sparse Decomposition algorithm, the limitation of image clinical practice of stabilization
And the consideration of reconstruction time etc..
Parallel imaging technique using coil spatial sensitivities information, by multiple receiving coils simultaneously carry out independent sample and
Coding, has saved gradient encoded number needed for space orientation, accelerates image taking speed.Parallel imaging technique main at present has
SMASH, GRAPPA and SENSE etc..Parallel imaging relies heavily on the appropriate distribution and accurate estimation of coil sensitivities,
The snr loss being difficult to avoid that is faced, and cannot realize that single pass scanning accelerates.
SPEED algorithms utilize the sparse characteristic of signal, by gathering some groups of phase-coded datas of regular jump, profit
Go out image with linear equation pointwise analytic reconstruction.Traditional SPEED methods can realize the quick scanning of magnetic resonance with single channel.So
And, traditional SPEED methods need to gather three groups of lack sampling data respectively along phase code (PE) direction, this three groups of lack sampling numbers
According to identical PE intervals and different PE side-play amount d, aliased image is realized by solving minimum mean-square error problem
Separate.Due to the analytical Calculation of collection and the pointwise of multi-group data, still have much room for improvement in terms of acceleration efficiency and image quality.
Accordingly, it would be desirable to a kind of more efficient practical rapid magnetic-resonance scan imaging method.
The content of the invention
In order to solve the above problems, the present invention provides a kind of magnetic resonance imaging side based on image area and K spatial domain iteration
Method, i.e., holographic efficiently imaging method HEIGHT (Highly Efficient Imaging with Global Harmonic
Transformations)。
MR imaging method of the invention is comprised the following steps：S1:K spaces are carried out along prescribed coding direction
Regular lack sampling；And S2：The K space data not gathered is obtained by iterating to calculate based on image area and K spatial domains, to obtain
MRI is obtained, wherein, lack sampling step S1 is comprised the following steps：S10：Along prescribed coding direction per the jump collection of N rows
One group of lack sampling K space data S (1) of a line, remainder data is filled with 0；S11：Completely gather low in the central area in K spaces
Frequency information, to obtain centre data S (C)；And S12：Generation N-1 group K space datas S (2), S (3) ... S (N), respectively with identical
Hop interval N, different code offset amount 1,2 ... N-1, copy collection K space S (C) correspondence position low-frequency data, other
Non- collecting part is all with 0 filling；And iterative calculation step S2 is comprised the following steps：S20：K space data S (1) edges are referred to
Delimit the organizational structure a yard direction high-pass filtering, and by obtaining edge enhanced images I (1) after Fourier transform (Fourier Transform)；
S21：By the n-th group in N-1 group K space datas S (2)-S (N) along the high-pass filtering of prescribed coding direction, and by after Fourier transform
Obtain aliased image I (n)；S22：The amplitude of aliased image I (n) is replaced with the width of current amplitude and edge enhanced images I (1)
The average of angle value；S23：The anti-Fourier transform of amplitude by aliased image I (n) for obtaining is new K space data S (n) '；S24：
The centre data of K space Ss (n) ' is updated using centre data S (C), and 0 is filled out at the corresponding hop intervals of K space Ss (n)；
S25：Repeat step S21-S24, untill all of N-1 groups data all reach convergence state；And S26：Merge all of N groups
K space data, and the inverse operation of high-pass filtering is carried out to the K space data after merging, then obtain final by Fourier transform
MRI.
Further, prescribed coding direction is phase-encoding direction or 3D sequence layers coding direction.
Alternatively, prescribed coding direction includes that phase code and 3D sequence layers are encoded, so as to realize phase-encoding direction and
The upward common acceleration of 3D sequence layer coding staffs.
K space Ss (1) low-frequency information of lack sampling step S20 is directly jumped and copies the corresponding data of S (C), without repeating to adopt
Collection.
Central area is the region in the L line ranges of K space center, and L is integer.
When 256 points of initial data is gathered, central area is the region in the 8-64 line ranges of K space center.
Accelerated factor is obtained by below equation：F=1/N+L/M-L/M/N, wherein, f is accelerated factor, and N is adopted for jump
The jump width of collection, L is K space center region complete sample line number, and M is original coding bearing data length.
The MR imaging method of the invention can not only be realized with multichannel, it is also possible to single channel come real
Show, only collecting part lack sampling data, quick magnetic resonance is realized by being iterated calculating between image area and K spatial domains
Imaging, so as to shorten sweep time so that the acquisition time of image is greatly shortened, or is changed in the case of same sweep time
Kind signal to noise ratio, and image quality higher can be obtained.
Brief description of the drawings
Above and other aspect of the invention and feature will be clearly appeared from from the explanation below in conjunction with accompanying drawing to embodiment, its
In：
Figure 1A and Figure 1B displays are along coding direction with two groups of figures of lack sampling data reconstruction of the jump collections of N=4 at equal intervals
Picture, wherein this two groups of lack sampling data have different code offset amounts；
Fig. 1 C and Fig. 1 D show the edge enhancing for carrying out being obtained after high-pass filtering to the image shown in Figure 1A and Figure 1B respectively
Image；
Fig. 2 E-2H are the result figure for being scanned to shank and being rebuild by HEIGHT methods of the invention, wherein Fig. 2 E
It is the image obtained by Fourier transform reconstruction for showing artifact, Fig. 2 F are the images in the middle of complete K spaces, and Fig. 2 G are that phase is compiled
The image rebuild during code hop interval N=4, and Fig. 2 H are that hop interval is increased to the image rebuild during N=8；And
Fig. 3 is the result that 0.3T low fields permanent magnet system gathers single pass view data by HEIGHT methods of the invention
Figure, wherein Fig. 3 I and Fig. 3 L are the images of complete K space reconstructions, and Fig. 3 J and Fig. 3 M are rebuild by the method according to the invention
Image.
Specific embodiment
Describe illustrative, non-limiting example of the invention in detail with reference to the accompanying drawings, it is common to magnetic of the invention
The imaging method that shakes is further described.
MR imaging method of the invention is the FastMRI skill based on image area and K spatial domain iteration
Art, the method regularly gathers lack sampling data, and the lack sampling data that will be collected to K spaces by figure along coding direction
The K space data that iterative calculation between image field and K spatial domains is not gathered is to obtain final image.
Reference picture 1A-1D exemplarily illustrates the image that jump collection is obtained.Figure 1A and Figure 1B are respectively by two groups of lack samplings
Data reconstruction, this two groups of data are jumped with N=4 at equal intervals in coding direction and gathered, but with different code offsets
Amount d.From Figure 1A as can be seen that because code offset amount is different, the contrast of Figure 1A and Figure 1B is significantly different, and this is in Figure 1B
Because the ghost overlapped in figure has different phases.Now, if imposing high-pass filtering to the image shown in Figure 1A and Figure 1B,
Two edge images shown in Fig. 1 C and Fig. 1 D are then generated respectively.Because edge image is sparse, therefore efficiently reduce
The aliasing of signal in image, so that visible the two edge images have similitude very high.It is this to be jumped along coding direction
At intervals of N, side-play amount d different images has N number of.The sparse edge image of N number of image has almost equal width
Degree.The intrinsic natural quality of this image causes that MR imaging method of the invention only needs to gather one group of lack sampling data,
Just extrapolated other the N-1 group data of iterative calculation between image area and K spatial domains can be based on, so as to realize quick magnetic resonance
Scanning imagery.
Next, will be explained in MR imaging method of the invention.MR imaging method of the invention is first
One group of lack sampling K space data first is gathered per N rows along prescribed coding direction, changing between image area and K spatial domains is then based on
In generation, calculates the N-1 group K space datas for obtaining and not gathering, so as to obtain final image.
Specifically, MR imaging method of the invention is comprised the following steps：S1:Along prescribed coding direction to K
Space carries out regular lack sampling；And S2：The K spaces not gathered are obtained by iterating to calculate based on image area and K spatial domains
Data, to obtain MRI.
MR imaging method of the invention has three kinds of accelerated modes：Only accelerate in the phase encode direction；Only
Accelerate upwards in 3D layers of coding staff；Or accelerate upwards in phase code and 3D layers of coding staff simultaneously.That is, said
" prescribed coding direction " can for phase-encoding direction or 3D sequence layers coding direction.Alternatively, prescribed coding direction
Phase-encoding direction and 3D sequence layers coding direction can simultaneously be included, so as to realize phase-encoding direction and 3D sequence layers coding
Common acceleration on direction.
S1 is further comprising the steps for lack sampling step：S10：Along prescribed coding direction per N rows jump collection a line
Lack sampling K space data S (1), remainder data with 0 filling；S11：Low-frequency information is completely gathered in the central area in K spaces,
To obtain centre data S (C)；And S12：Generation N-1 group K space datas S (2), S (3) ... S (N) is jumped with identical respectively
Interval N, different code offset amount 1,2 ... N-1, the low-frequency data of copy collection K space S (C) correspondence position, other are not gathered
Part is all with 0 filling.The central area in K spaces is the region in the L line ranges of K space center, and wherein L is integer.Example
Such as, when 256 points of initial data is gathered, the central area is the region in the 8-64 line ranges of K space center.
In step S10 and step S11, portion centers data are to overlap, and K space Ss (1) low-frequency information directly copy by jump
The corresponding data of shellfish S (C), therefore without repeated acquisition.Additionally, accelerated factor can be obtained by below equation：F=1/N+L/
M-L/M/N, wherein f are accelerated factor, and N is the jump width of jump collection, and L is K space center region complete sample line number, M
It is original coding bearing data length.
S2 is further comprising the steps for iterative calculation step：S20：K space data S (1) is high along prescribed coding direction
Pass filter, and by obtaining edge enhanced images I (1) after Fourier transform；S21：By in N-1 group K space datas S (2)-S (N)
N-th group along the high-pass filtering of prescribed coding direction, and by after Fourier transform obtain aliased image I (n)；S22：By aliased image I
N the amplitude of () replaces with the average of the range value of current amplitude and edge enhanced images I (1)；S23：The aliased image I that will be obtained
N the anti-Fourier transform of amplitude of () is new K space data S (n) '；S24：Update K's space Ss (n) ' using centre data S (C)
Centre data, and fill out 0 at the corresponding hop intervals of K space Ss (n)；S25：Repeat step S21-S24, until all of N-1 groups
Untill data all reach convergence state；And S26：Merge all of N groups K space data, and the K space data after merging is carried out
The inverse operation of high-pass filtering, then obtains final MRI by Fourier transform.
MR imaging method of the invention is exemplarily illustrated next, with reference to Fig. 2 and Fig. 3.
Fig. 2 E-2H are that shank is scanned and rebuild with 256 × 256 resolution ratio by HEIGHT methods of the invention
Result figure, the centre data that wherein K space Ss (C) are gathered is 64 rows.Fig. 2 E are directly to rebuild to obtain by simple Fourier transform
Image, artifact can be clearly seen that.As a comparison, Fig. 2 F are the images in the middle of complete K spaces.Fig. 2 G are that phase code is jumped
The image rebuild during the N=4 of jump interval, now accelerated factor is f=1/4+64/256-64/256/4=0.4375, i.e. corresponding
Sweep time can be reduced to 0.4375 times of former sweep time.Fig. 2 H are that hop interval is increased to the image rebuild during N=8,
Now accelerated factor is f=1/8+64/256-64/256/8=0.34375, and corresponding sweep time is only former sweep time
0.34375 times.Although sweep speed accelerates nearly 3 times, macroscopic artifact is not produced.
Fig. 3 is the method validation example in low field 0.3T systems, with the single pass picture number of 256 × 256 resolution acquisitions
According to.Fig. 3 I and Fig. 3 L are the images of complete K space reconstructions, and wherein 3I is 3 FSE T2W images of NEX, and sweep time is 4 point 6
Second, 3L is 2 SE T1W images of NEX, sweep time be 2 points 24 seconds.Fig. 3 J and Fig. 3 M are rebuild using the method for the present invention
Image, the row of center behavior 64 that K space Ss (C) are gathered.Fig. 3 J consumption sweep time for 1 point 47 seconds, Fig. 3 M consumption sweep
The time of retouching be 1 point 3 seconds, sweep speed is increased substantially, and the loss of obvious artifact or resolution ratio is can't see in figure.
As can be seen here, MR imaging method of the invention can realize that single channel scanning accelerates, using less
Data acquisition amount can also obtain high-quality image.When the image relatively low to signal to noise ratio accelerates, the method remains to show good
Good stability.
MR imaging method of the invention is also applicable on multi-channel coil, so can quickly improve magnetic
The image taking speed of resonance.The method of the present invention can not only be scanned quickly, and in process of reconstruction, due to closely constraint
Condition, is not in the long-time iterative process of existing MR imaging method, and convergence is generally just can reach within 10 times,
There is very fast reconstruction speed.
Although being illustrated to exemplary embodiments of the invention, but it is clear that it will be understood by those skilled in the art that
Can be changed in the case of without departing substantially from spirit and principles of the present invention, its scope is in claims and its equivalent
It is defined.
Claims (7)
1. a kind of MR imaging method, comprises the following steps：
S1:Regular lack sampling is carried out to K spaces along prescribed coding direction；With
S2：The K space data not gathered is obtained by iterating to calculate based on image area and K spatial domains, to obtain MRI,
Wherein, the lack sampling step S1 is comprised the following steps：
S10：One group of lack sampling K space data S (1) along the prescribed coding direction per N rows jump collection a line, its remainder
Filled according to 0；
S11：Low-frequency information is completely gathered in the central area in K spaces, to obtain centre data S (C)；With
S12：Generation N-1 group K space datas S (2), S (3) ... S (N), respectively with identical hop interval N, different codings is inclined
Shifting amount 1,2 ... N-1, the low-frequency data of copy collection K space S (C) correspondence position, other non-collecting parts are all with 0 filling；With
And the iterative calculation step S2 is comprised the following steps：
S20：By the K space data S (1) along prescribed coding direction high-pass filtering, and by obtaining side after Fourier transform
Edge strengthens image I (1)；
S21：By the n-th group in the N-1 groups K space data S (2)-S (N) along prescribed coding direction high-pass filtering, and pass through
Aliased image I (n) is obtained after crossing Fourier transform；
S22：The amplitude of aliased image I (n) is replaced with the range value of current amplitude and the edge enhanced images I (1)
Average；
S23：The anti-Fourier transform of amplitude by aliased image I (n) for obtaining is new K space data S (n) '；
S24：The centre data of K space Ss (n) ' is updated using the centre data S (C), and in the corresponding jumps of K space Ss (n)
Interval fills out 0；
S25：Repeat step S21-S24, untill all of N-1 groups data all reach convergence state；With
S26：Merge all of N groups K space data, and the inverse operation of high-pass filtering is carried out to the K space data after merging, then
Final MRI is obtained by Fourier transform.
2. MR imaging method according to claim 1, wherein, the prescribed coding direction be phase-encoding direction or
Person 3D sequence layers encode direction.
3. MR imaging method according to claim 1, wherein, the prescribed coding direction includes phase-encoding direction
Encode direction with 3D sequence layers, so as to realize the phase-encoding direction and upward common of the 3D sequence layers coding staff plus
Speed.
4. MR imaging method according to claim 1, wherein, K space Ss (1) low frequency of the lack sampling step S10
Information is directly jumped and copies the corresponding data of S (C), without repeated acquisition.
5. MR imaging method according to claim 1, wherein, the central area is the L row models in K space center
Interior region is enclosed, wherein L is integer.
6. MR imaging method according to claim 5, wherein, when 256 points of initial data is gathered, the center
Region is the region in the 8-64 line ranges of K space center.
7. MR imaging method according to claim 1, wherein, accelerated factor is obtained by below equation：
F=1/N+L/M-L/M/N,
Wherein, f is accelerated factor, and N is the jump width of jump collection, and L is K space center region complete sample line number, and M is original
Begin coding direction data length.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410175413.3A CN103995244B (en) | 2014-04-29 | 2014-04-29 | Magnetic resonance imaging method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410175413.3A CN103995244B (en) | 2014-04-29 | 2014-04-29 | Magnetic resonance imaging method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103995244A CN103995244A (en) | 2014-08-20 |
| CN103995244B true CN103995244B (en) | 2017-05-24 |
Family
ID=51309460
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410175413.3A Active CN103995244B (en) | 2014-04-29 | 2014-04-29 | Magnetic resonance imaging method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103995244B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108333545B (en) * | 2018-01-25 | 2020-03-10 | 浙江大学 | Magnetic resonance image reconstruction method based on high-pass filtering |
| WO2019222897A1 (en) * | 2018-05-21 | 2019-11-28 | Shanghai United Imaging Healthcare Co., Ltd. | System and method for multi-contrast magnetic resonance imaging |
| CN109738840B (en) * | 2018-12-29 | 2022-06-14 | 佛山瑞加图医疗科技有限公司 | Magnetic resonance imaging system and method |
| CN113533408A (en) * | 2021-07-21 | 2021-10-22 | 杭州电子科技大学 | Variable density data sampling method for improving quality of parallel magnetic resonance reconstruction image |
| WO2024082094A1 (en) * | 2022-10-17 | 2024-04-25 | 中国科学院深圳先进技术研究院 | Intelligent magnetic resonance holographic imaging method and system |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2008134892A1 (en) * | 2007-05-03 | 2008-11-13 | National Research Council Of Canada | Method for radio-frequency nuclear magnetic resonance imaging |
| CN101975936A (en) * | 2010-09-03 | 2011-02-16 | 杭州电子科技大学 | Rapid magnetic resonance imaging (MRI) method based on CS ( compressed sensing ) technique |
| CN102232830A (en) * | 2010-04-30 | 2011-11-09 | 西门子(深圳)磁共振有限公司 | Method for water-fat separation through magnetic resonance imaging |
| CN102389309A (en) * | 2011-07-08 | 2012-03-28 | 首都医科大学 | Compressed sensing theory-based reconstruction method of magnetic resonance image |
| CN102540116A (en) * | 2011-12-08 | 2012-07-04 | 中国科学院深圳先进技术研究院 | Magnetic resonance imaging method and system |
| CN102928796A (en) * | 2012-09-28 | 2013-02-13 | 清华大学 | Fast-diffused magnetic resonance imaging and restoring method |
| CN103323805A (en) * | 2013-05-29 | 2013-09-25 | 杭州电子科技大学 | Method for SPEED rapid magnetic resonance imaging based on wavelet domain sparse representation |
| CN103728581A (en) * | 2013-12-20 | 2014-04-16 | 杭州电子科技大学 | SPEED fast magnetic resonance imaging method based on discrete cosine transform |
-
2014
- 2014-04-29 CN CN201410175413.3A patent/CN103995244B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2008134892A1 (en) * | 2007-05-03 | 2008-11-13 | National Research Council Of Canada | Method for radio-frequency nuclear magnetic resonance imaging |
| CN102232830A (en) * | 2010-04-30 | 2011-11-09 | 西门子(深圳)磁共振有限公司 | Method for water-fat separation through magnetic resonance imaging |
| CN101975936A (en) * | 2010-09-03 | 2011-02-16 | 杭州电子科技大学 | Rapid magnetic resonance imaging (MRI) method based on CS ( compressed sensing ) technique |
| CN102389309A (en) * | 2011-07-08 | 2012-03-28 | 首都医科大学 | Compressed sensing theory-based reconstruction method of magnetic resonance image |
| CN102540116A (en) * | 2011-12-08 | 2012-07-04 | 中国科学院深圳先进技术研究院 | Magnetic resonance imaging method and system |
| CN102928796A (en) * | 2012-09-28 | 2013-02-13 | 清华大学 | Fast-diffused magnetic resonance imaging and restoring method |
| CN103323805A (en) * | 2013-05-29 | 2013-09-25 | 杭州电子科技大学 | Method for SPEED rapid magnetic resonance imaging based on wavelet domain sparse representation |
| CN103728581A (en) * | 2013-12-20 | 2014-04-16 | 杭州电子科技大学 | SPEED fast magnetic resonance imaging method based on discrete cosine transform |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103995244A (en) | 2014-08-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Lazarus et al. | SPARKLING: variable‐density k‐space filling curves for accelerated T2*‐weighted MRI | |
| CN106597333B (en) | A kind of magnetic resonance parallel imaging method and magnetic resonance imaging system | |
| CN103995244B (en) | Magnetic resonance imaging method | |
| CN104068859B (en) | For determining method and the magnetic resonance equipment of multiple magnetic resonance image (MRI) | |
| JP6636461B2 (en) | MR imaging using multi-echo k-space acquisition | |
| JP6513398B2 (en) | MR image reconstruction using prior information constrained regularization | |
| Pipe et al. | Turboprop: improved PROPELLER imaging | |
| CN104965184B (en) | Spiral sampling and method for reconstructing based on space-time code single sweep magnetic resonance imaging | |
| CN104939828B (en) | MR imaging method | |
| CN107750338A (en) | The MR gathered using star lamination is imaged | |
| CN103777162B (en) | Magnetic resonance imaging K spatial movements artifact corrects parallel acquisition method for reconstructing | |
| CN104833931A (en) | Method and device for controlling magnetic resonance imaging system | |
| CN103389481B (en) | Magnetic resonance frequency Phase Double coded sample method and image rebuilding method thereof | |
| CN102540116A (en) | Magnetic resonance imaging method and system | |
| CN107205686B (en) | Method for removing ghost artifacts in magnetic resonance imaging and magnetic resonance device therefor | |
| CN105473067A (en) | System and method for reducing acoustic noise level in MR imaging | |
| CN103860176A (en) | MR Parallel Imaging System Reducing Imaging Time | |
| CN109814058A (en) | CAIPIRINHA wave SPACE | |
| US9454709B2 (en) | Method for rapid-multicontrast brain imaging | |
| JP2020523075A (en) | MR imaging using variable contrast stack-of-star acquisition | |
| CN103809141A (en) | Method for magnetic resonance imaging | |
| CN107367703A (en) | Magnetic resonance scanning method, system, device and storage medium | |
| CN102590773A (en) | Magnetic resonance imaging method and system | |
| Robison et al. | Three‐dimensional ultrashort echo‐time imaging using a FLORET trajectory | |
| CN105678822A (en) | Three-regular magnetic resonance image reconstruction method based on Split Bregman iteration |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |