Sign In to Follow Application
View All Documents & Correspondence

Method For Constructing Image From Mri Data

Abstract: The invention relates to a method of constructing an image of a sample from MRI data and an MRI data server comprising a processor and a memory including a program to perform the method wherein the method comprises: i) selectively acquiring one or more sets of MRI data generated from driving signals created under a specific set of operation parameters; ii) deriving a matrix representative of the selective acquisition of the one or more sets of MRI data; iii) processing the selectively acquired MRI data with the matrix to obtain output data; and iv) synthesising the output data to construct the image of the sample. This method is applicable for any aliased k space acquisition that overlaps blocks of k space data for enhancing the performance of an accelerated MRI scan. FIG.5

Get Free WhatsApp Updates!
Notices, Deadlines & Correspondence

Patent Information

Application #
Filing Date
02 August 2017
Publication Number
32/2017
Publication Type
INA
Invention Field
PHYSICS
Status
Email
Parent Application
Patent Number
Legal Status
Grant Date
2021-09-30
Renewal Date

Applicants

VOXELGRIDS INNOVATIONS PRIVATE LIMITED
c/o Foundation for Innovation and Social Entrepreneurship "Social Alpha" No. 3, 14th Main, HSR Layout Sector 5 Bengaluru 560102 Karnataka, India.

Inventors

1. ARUNACHALAM, Arjun
8A, Boon Tiong Road #14-83 Boon Tiong Arcadia Singapore 164008, Singapore

Specification

FIELD OF INVENTION This invention relates to the field of Magnetic Resonance Imaging (MRI). In particular, the disclosed invention relates to techniques for optimizing data acquisition and restoration of acquired k-space data samples. BACKGROUND When a substance such as human tissue is subjected to a uniform magnetic field (polarizing field B0), the individual magnetic moments of the excited nuclei in the tissue attempt to align with this polarizing field, but precess about it in random order at their characteristic Larmor frequency. If the substance, or tissue, is subjected to a magnetic field (excitation field BO that is in the x-y plane and that is near the Larmor frequency, the net aligned moment, Mz, may be rotated, or "tipped", into the x-y plane to produce a net transverse magnetic moment M,. A signal is emitted by the excited nuclei or "spins", after the excitation signal B, is terminated, and this signal may be sampled and processed to form an image. When utilizing these "MR (magnetic resonance)" signals to produce images, magnetic field gradients (G„, Gy and Gz) are employed. Typically, the region to be imaged is scanned by a sequence of measurement cycles, in which these gradients vary according to the particular localization method being used. The resulting set of received MR signals are digitized and processed to reconstruct the image. The measurement cycle used to acquire each MR signal is performed under the direction of a pulse sequence produced by a pulse sequencer. Clinically available MRI systems store a library of such pulse sequences that can be prescribed to meet the needs of many different clinical applications. Research MRI systems include a library of clinically proven pulse sequences and they also enable the development of new pulse sequences. The MR signals acquired with an MRI system are signal samples of the subject of the examination in Fourier space, or what is often referred to in the art as "k-space". Each MR measurement cycle (referred to as TR in MRI literature), or pulse sequence, typically samples a portion of k-space along a sampling trajectory characteristic of that pulse sequence. Most pulse sequences sample k-space in a roster scan-like pattern sometimes referred to as a "spin-warp", a "Fourier", a "rectilinear" or a "Cartesian" scan. The spin-warp scan technique is discussed in [1]. The method, referred to as spin-warp imaging, employs a variable amplitude phase encoding magnetic field gradient pulse prior to the acquisition of MR spin-echo signals to phase encode spatial information in the direction of this gradient. In a two-dimensional implementation (2DFT), for example, spatial information is encoded in one direction by applying a phase encoding gradient (Gy) along that direction, and then a spin-echo signal is acquired in the presence of a readout magnetic field gradient (Gx) in a direction orthogonal to the phase encoding direction. The readout gradient present during the spin-echo acquisition encodes spatial information in the orthogonal direction. In a typical 2DFT pulse sequence, the magnitude of the phase encoding gradient pulse Gv is incremented (AGy) in the sequence of measurement cycles, or "views" that are acquired during the scan to produce a set of k-space MR data from which an entire image can be reconstructed. The fundamental limitation imposed by magnetic field gradients on MRI data acquisition rates is that only a sequential acquisition of k-space samples along a particular sampling trajectory is possible. To circumvent this limitation, several approaches have been proposed and all under-sample k-space data. For instance in dynamic MRI [2]-[5], assumptions are made regarding the imaged object and/or temporal signal of interest to exploit data redundancy through k-space under-sampfing. In compressed sensing (CS) [6]-[8], under-sampled data are projected onto a transform domain where its representation is sparse thus capturing signal information in a few samples. Parallel imaging (PMR!) [9]-[11] uses multiple receivers simultaneously to acquire under-sampled k-space, which is then restored to its full state by using receiver sensitivity profiles. Figure 1 shows an illustration 100 of an under-sampling technique applied on the k-space of an MRI image {k-space 1) formed by an array of sequential lines of data. Data that lies along four randomly chosen lines L1 to L4 in k-space 1 is shown as 104, 106, 108 and 110, respectively. In the under-sampling technique, only a portion of data (e.g. 104 and 108 that lie along lines L1 and L3) is acquired as 104' and 108' during the sampling process 102 to obtain an under-sampled k-space 1. During reconstruction, the original image is restored using the under-sampled k-space 1. By under-sampling k-space, the volume of data acquired is sought to be minimized to reduce data acquisition time and thus accelerate a scan. However, the acceleration achievable with a technique is a function of its intrinsic properties. In CS, the limit is dictated by signal compressibility in the transform domain. In PMRI, the acceleration remains between 4 and 6 for two-dimensional (2D) Cartesian scans [12] that use coil arrays with as many as 128 channels [13]. Therefore, these methods have been combined in [14], [15] and also used with non-Cartesian sampling trajectories [16], [17], to increase acceleration. One limitation common to all k-space under-sampling techniques is that signal to noise ratio (SNR) loss is unavoidable. Despite the advances, the challenges in increasing acceleration by minimizing acquisition SNR loss are nontrivial. This remains an area of interest [18] because of applications such as the evaluation of cardiac function that can always benefit from greater acceleration but are unable to do so because of SNR loss that can cause an unacceptable degradation in image quality. Recently, a new method [19] for simultaneously acquiring distinct k-space data samples was introduced. During acquisition, the method uses a combination of RF pulses and gradients to overlap distinct k-space samples. Therefore, the data from the resultant acquisition consists of overlapped k-space samples and is referred to as "aliased k-space". In this method [19], the "aliased k-space" acquisition technique is designed exclusively for dynamic MRI applications wherein the overlapped k-space samples are also "tagged" in time during the acquisition. This tagging process enables an unfolding of the overlapped k-space samples during reconstruction. Figure 2 shows an example 200 of an overlapping technique applied on an MRI data (k-space 1} formed by an array of sequential lines of data. Data that lie along four randomly chosen lines L1 to l_4 in k-space 1 is shown as 204, 206, 208 and 210, respectively. In the overlapping technique illustrated in Figure 2, one or more such lines of data are acquired in an aggregated manner. For example, all data along the lines L1 and L2 is simultaneously captured, while all data along the lines L3 and L4 is simultaneously captured. In this case of the four chosen lines L1 to L4, the data aggregation may result in the formation of two groups: one comprising data 204 and 206 that lies along adjacent lines of data L1 and L2, the other comprising data 204 and 206 that lies along adjacent lines of data L3 and L4. The resulting data (Overlapped k-space1) from the overlapping technique would then have a first line of data (204+206)' that comprises data lying across L1 and L2; and a second line of data (208+210)' that comprises data lying across L3 and L4. During reconstruction, the original image is obtained by unfolding this Overlapped k-space1. Subsequently, an improvement on this technique was introduced [20] in which it was demonstrated that the unfolding of the overlapped k-space samples can also be achieved by using receiver sensitivity profiles. As a result, the technique introduced in reference [19] is no longer restricted to dynamic MRI technique and becomes applicable for all MRI scans. A unique property of "aliased k-space" acquisitions is that depending on the manner in which the k-space samples are overlapped, it is possible to actually preserve, if not enhance, SNR (signal to noise ratio) during data acquisition while simultaneously accelerating the scan. A full description of the "aliased k-space" data acquisition, the restoration using receiver sensitivity profiles, and the related SNR properties has been described in detail in [20]. It is also relevant to note that while certain types of multi-slice PMRI acceleration techniques [21]-[22] can also be interpreted to be the overlap of k-space samples, this is an outcome of a process that overlaps different imaging slices onto each other. In these approaches, the overlapping of data samples only occurs along a spatial dimension (x, y or z). in contrast, in the "aliased k-space" acquisition approach described in [19]-[20], the overlapping samples originally lie along a phase-encoding axis within the k-space of a single slice or a single volume. Therefore, the acquisition approach in [19]-[20] brings about the ability to directly overlap k-space samples that lie along phase encoding axes in k-space, thus differentiating it from the approach described in [21]-[22], Hence, it is now possible to perform "aliased k-space" acquisitions of a single slice or a single volume, as the case may be. Figure 3 shows an example of a combination of RF pulse 302 and gradient pulse 304, 306 and 308, designed for an "aliased k-space" acquisition that overlaps three blocks of k-space data. In Figure 3, waveform 302 represents the three RF pulses, waveform 304 represents the phase encoding gradient blips (Gpe). "A" refers to amplitude of slice select gradient pulses (GS|) 306. Waveform 308 represents readout gradient (Gr). In waveform 302, Qu 92 and 93 refer to flip angles of the three RF pulses in 302. The resultant signal in an "aliased k-space" 2D acquisition using this combination ot RF pulse 302 and gradient pulse 304, 306 and 308 is given by the following: In Equation [1], k1=v(Gpe1 + Gpe2 +Gpe3)ytp, k2=v(Gp82 +Gpe3)ytp, k3=Y(Gpe3)ytp, tp is the duration of the phase encoding (PE) gradient blips, 0{x,y) is a 2D axial slice, v is gyromagnetic ratio, ai, a2, and a3 are the amplitudes of the signal components that the RF pulses 302 in Figure 3 generate. After discretization of spatial locations and receiver sensitivities, the acquisition process represented by Equation [1] can be re¬written in matrix form as follows: In Equation [2], rp denotes the pth voxel location, k* is the m"1 sample at the nth location in aliased k-space, Ci is the spatial sensitivity profile of the llh MRI receiver and a„, are the amplitudes of the signal components that are aliased to obtain the "aliased k-space". Accordingly, an "afiased k-space" acquisition is given by: In Equation [3], E is the encoding matrix, v is the desired image vector and d is the acquired aliased k-space data from all receivers. This encoding matrix Ecan employ either the image domain or the k-space equivalent of the receiver sensitivity profiles. Additional details on these signal acquisitions and the subsequent data restoration stages have been provided in [20]. Of all the data overlapping patterns that are applicable in an "Aliased k-space" acquisition, Figure 4 shows an overview of a process 400 using the "block aliasing" approach described in [20]. In Figure 4, k-space data 404 of the original image 402 is divided into 3 equal blocks A 406, B 408 and C 410, which are weighted with the amplitudes a*, a2 and a3 respectively and added to obtain the overlapped k-space data block 412. As discussed above, this "block aliasing" approach described in [20] possesses the property of preserving/enhancing SNR while simultaneously accelerating an MRI scan. However, the primary challenge in restoring data that has been acquired through the "block aliasing" process 400 is that the encoding matrix E as defined above is poorly conditioned. This brings the following shortcomings: 1) Output image quality is extremely sensitive to errors in the estimates of the receiver spatial sensitivity profiles; and 2) The data restoration process needs a large number of receiver coils to be employed and the output image quality is dependent on receiver geometry. In addition to these shortcomings, post reconstruction noise amplification is also high due to the poor condition of E. Therefore, an improvement on the condition of E for the block aliasing acquisition pattern is highly desirable in order to enhance the accuracy of and the quality of the output image from the data restoration process, The present invention seeks to address the above shortcomings of "block aliasing" when restoring images acquired during MRI scans. SUMMARY According to one aspect of the invention, there is provided a method of constructing an image of a sample from MR! data, the method comprising: i) selectively acquiring one or more sets of MRI data generated from driving signals created under a specific set of operation parameters; ii) deriving a matrix representative of the selective acquisition of the one or more sets of MRI data; iii) processing the selectively acquired MRI data with the matrix to obtain output data; and iv) synthesising the output data to construct the image of the sample. According to another aspect of the invention, there is provided an MRI data processing server for constructing an image of a sample from MR! data, the data processing server comprising: at least one processor; and at least one memory including computer program code; the at least one memory and the computer program code configured to, with the at least one processor, cause the server at least to: i) selectively acquire one or more sets of MRI data generated from driving signals created under a specific set of operation parameters; ii) derive a matrix representative of the selective acquisition of the one or more sets of MRI data; iii) process the selectively acquired MRI data with the matrix to obtain output data; and iv) synthesise the output data to construct the image of the sample. BRIEF DESCRIPTION OF THE DRAWINGS Example embodiments of the invention will be better understood and readily apparent to one of ordinary skill in the art from the following written description, by way of example only, and in conjunction with the drawings. The drawings are not necessarily to scale, emphasis instead generally being placed upon illustrating the principles of the invention, in which: Figure 1 shows an example of a conventional under-sampling technique. Figure 2 shows an example of a conventional overlapping technique. Figure 3 shows an example of a combination of RF pulses and gradients used in an "Aliased k-space" acquisition and restoration technique. Figure 4 shows an example of an overview of a "block aliasing" approach to acquire an aliased k-space dataset. Figure 5 shows steps of a method, in accordance with one implementation of the present invention, to acquire and construct a diagnostic image of a sample from MRI data acquired. Figure 6 shows an overview of a process in which the method shown in Figure 5 is used. Figure 7 illustrates an under-sampling technique applied on an overlapped MRI dataset (such as the overlapped k-space 1 of Figure 2). Figure 8 shows a MRI system in which the method of Figures 5, 6 and 7 can be implemented. Figure 9 shows components of a transmitter that produces a prescribed RF excitation field, the transmitter being part of the MRI system of Figure 8. DETAILED DESCRIPTION In the following description, various embodiments are described with reference to the drawings, where like reference characters generally refer to the same parts throughout the different views. Figure 5 shows steps of a method 500, in accordance with one implementation of the present invention, to construct an image from sample MRI data. The method 500 optimizes output, for example from restored overlapped k-space samples, by the conditioning of a matrix E used to construct the image. The matrix Eis derived from parameters of driving signals used to acquire MRI data from a sample. Since £ is a matrix representation of the data acquisition process, modifications introduced in the "aliased k-space" data acquisition stage would be reflected in E through an alteration in the entries of E. In response to these modifications, the subsequent data restoration employs this modified matrix E that reflects the alterations made to the data acquisition stage. These alterations in turn improve the condition of this modified matrix E, which results in optimization of the output image quality. In the present embodiment, RF pulses and gradient pulses can be used as driving signals that are used to excite a sample and obtain MR! data. A combination of RF pulses and gradients, such as those shown in Figure 3, can be utilized, whereby the operation parameters used to produce these RF puises and gradients can be controlled. The following provides examples of the operation parameters that can be controlled for the combination of RF pulses and gradients shown in Figure 3: 1. Flip angles of the RF pulses 302, interchangeably referred to as RF pulse flip angles; 2. Phases of the RF pulses 302, interchangeably referred to as RF pulse phases; 3. Envelope design of the RF pulses 302, interchangeably referred to as RF pulse envelope; and 4. Amplitudes of the gradient pulses 304, interchangeably referred to as gradient amplitudes in effect area of these pulses 304. In the present invention, the controlling comprises keeping one or more of the flip angle (Qu 92 and 93) of the RF pulses 302, the phase of the RF pulses 302 and the gradient amplitude of the gradient pulses 304 constant, and varying the remainder of the flip angle (0,, 62 and 93) of the RF pulses 302, the phase of the RF pulse 302 and the gradient amplitudes of the gradient pulses 304. The controlling may alternatively comprise varying all of the flip angle {9,, 92 and 93) of the RF pulses 302, the phase of the RF pulses 302 and the gradient amplitudes of the gradient pulses 304. In both types of controlling, varying of the one or more of the flip angle (S,, 92 and 93) of the RF pulses 302, the phase of the RF pulses 302 and the gradient amplitudes of the gradient pulses 304 is done either randomly or non-randomly. Of these operation parameters, the RF pulse envelope is typically designed by taking into consideration the profile of the imaging plane/volume that has to be excited in a MRI scan. As such, flip angles (9i, 92 and 93), phases of the RF pulses 302 and gradient amplitudes of the gradient pulses 304 work as the design/operation parameters that may be varied for optimization of the matrix E that will reflect these variations. In step 502 of the method 500, one or more sets of MRI data, which may be in "block aliased" k-space format, is selectively acquired. This k-space data is generated by driving signals, such as the RF pulses 302 and the gradient pulses 304, in a MRI system. The driving signals are created under a specific set of the operation parameters, and are tunable by altering the specific set of operation parameters. The specific set of operation parameters, as indicated above, comprise one or more of flip angles (91f 82 and 93) of the RF pulses 302, phases of the RF pulses 302, envelope design of the RF pulses 302 and amplitudes of the gradient pulses 304. In an implementation of the present invention, the specific set of operation parameters can be altered by varying the flip angles (6i, 92 and 93) and/or RF pulse phases and/or gradient amplitudesof the gradient pulses 304, in either a random fashion as defined by a suitable probability distribution function or in a non-random manner, from one measurement cycle to the next. In an implementation of the present invention, the one or more sets of "block aliased" k-space data can be selectively acquired from a random selection employing an overlapping technique as illustrated in Figure 2, or employing both an overlapping and under-sampling technique as shown in Figures 6 and 7. The selective acquisition of the one or more sets of k-space data is further described as follows. In step 504, as the specific set of operation parameters of the driving signals used in the selective acquisition is known, a matrix E representing the selective acquisition of the one or more sets of MRI data is derived. In an embodiment of the present application, as the operation parameters of the driving signals can be tuned or altered in the process of MRI scanning, the derived matrix E also changes in response to the alteration of the specific set of operation parameters. A plurality of MRI receivers may be employed during the process of k-space data acquisition, in an implementation of the present invention, the hardware parameters, particularly spatial sensitivity profiles, of the plurality of MRI receivers are also factored in when deriving the matrix E. Steps 506 and 508 relate to data reconstruction of the "block aliased" k-space data. In step 506, the matrix Eis used to process the acquired "block aliased" k-space data to obtain output data, i.e. output k-space data. This processing may involve having the acquired MRI data undergo a series of calculations and rules that are determined by the matrix E. Overlapped k-space data in the acquired "block aliased" k-space data are accordingly separated and restored in the output k-space data. In step 508, the output k-space data is synthesised to construct the image of the sampie. In one implementation, the synthesis involves performing a fourier transformation on the restored output k-space data to obtain the output image. In the present invention, each of the one or more sets of MRI data, i.e. "block aliased" k-space data may be generated under a different specific set of operation parameters, so that a different matrix E' is derived to process the respective MRI data. Figure 6 shows an overview of a process 600 in which the method 500 shown in Figure 5 is used. In Figure 6. the k-space data 604 of the original image 602 of the sample is divided into 3 equal blocks A 606, B 608 and C 610 and overlapped but lines of data within these blocks are overlapped randomly. For example, in Figure 6 the locations of the data lines L1, L2 and L3 are randomly chosen and then overlapped 612 after being weighted with the respective amplitudes ai, a2 and a3. Each of the driving signals comprises RF pulses 302, to which the specific set of operation parameters controls any one or more of its flip angle and phase; and gradient pulses 304, to which the specific set of operation parameters controls the gradient amplitudes. The same process is repeated until all data from these blocks A 606, B 608 and C 610 have been overlapped. The image 618 from the aliased k-space 614 is the initial uncorrected image that is restored when the data samples within the aliased k-space are unfolded. As described in step 508, a Fourier transformation is performed on the unfolded data samples to obtain the final image, This approach shown in Figures 6 and 7 is applicable for any "aliased k-space" acquisition that overlaps blocks of k-space data. It is irrelevant whether the overlapping blocks lie within a Cartesian sampling trajectory or a non-Cartesian one. Furthermore, there is no restriction on the number of samples that lie within these overlapping blocks. One can also have multiple such overlapping blocks during an accelerated scan. The data reconstruction process for unfolding aliased k-space in step 506is typically an iterative process that in an ideal embodiment employs the linear Conjugate gradient (CG) method [23]. This does not preclude the use of non-linear iterative reconstruction techniques or a direct inversion of £. In one embodiment, the quadratic TV upper bound [24] is used as a regularization function in the linear CG method along with E and the acquired data to obtain the final output. In this embodiment, the linear equation solved by the CG method that employs this TV upper bound is the following: {E"E + D"WD )V= E"d [4] In Equation [4], D denotes a matrix that performs both vertical and horizontal first order differences along the image vector v. The matrix W is a diagonal matrix containing elements that are defined by the vertical and horizontal first order differences [24]. In an alternative embodiment, the reguiarization function is not employed by simply setting the matrix W to 0 in Equation [4]. Depending on the pulse sequence, either the flip angles of the RF pulses or the phases of the RF pulses or the amplitudes of the gradient pulses can be varied. In an ideal embodiment, only the amplitudes of the gradients should be varied while the flip angles and the phase should remain constant. When this option is not acceptable, alternative embodiments where the flip angles and/or phases are varied are employed. The approach is entirely determined by the pulse sequence that is chosen. For example, flip angles and phases cannot be varied with Gradient Echo [23] sequences and so gradient amplitudes should be varied. But varying flip angles and/or phases can be a more suitable option when blocks of data lying along non-Cartesian sampling trajectories are overlapped. Varying the gradient amplitudes in this case can become complicated due to the inherent difficulties in these trajectories and therefore need not be the preferred embodiment. Referring to Figure 4, a random variation in the gradient amplitudes will modify this "block aliasing" pattern to the one iilustrated in Figure 6. In Figure 6, an example of three data lines L1, L2 and L3 have been shown, one each within the blocks 606 A, 608 B and 610 C. The locations of these overlapping data lines LI, L2 and L3 or phase encodes is random because the gradient amplitudes are being set randomly in this embodiment. Similarly, the other phase encodes, chosen from random locations from within each of the three blocks, are also overlapped. Therefore, while "block aliasing" is still performed, the location of the overlapping data lines from within these blocks is randomized by varying the gradient amplitudes. This randomization of data locations is also reflected in E, thus inherently improving its condition. Similarly, in user defined non-random variations in the gradient amplitudes; the locations of these data lines will vary in accordance with the user defined amplitudes. The guideline used to design user defined variations in the case of gradient amplitudes is to ensure that the distance between the overlapping data sample locations in k-space remains small. This enhances the condition of E. Random or non-random user-determined variations in the flip angles and/or phases do not alter the locations of the overlapping data fines in Figure 4, but they impact the amplitudes, for example, a1t a2 and a3, that these overlapping lines are weighted with. These amplitudes will now vary in either a random or non-random manner as the case may be, from one measurement cycle to the next. Non-random variations in the case of flip angles and phases are designed by ensuring that their values are chosen in a manner that optimizes the trade-off amongst factors such as steady state magnetization, signal coherence and the condition of E. The impact of the flip angles and phases on these parameters has been described in all standard MRI texts. Randomization of these parameters is again reflected in E, thus improving its condition. While Figures 4 and 6 are examples of "block aliasing" in a Cartesian sampling trajectory, the same principles hold for non-Cartesian sampling trajectories as well. In addition to overlapping k-space samples, it is also possible and in many cases desirable to enhance the achievable scan acceleration by further under-sampling the "block aliased" k-space data in a manner identical to what is done in PMRI. Figure 7 shows an illustration of an overlapping and under-sampling technique applied on an MRI dataset (original k-space). In the overlapping and under-sampling technique, only a portion of data (e.g. a first line that contains data that lies along lines Hand L3 and a second line that contains data that lies along lines L4 and L6 of the original k-space is acquired during the sampling process to obtain an Overlapped And Under-sampled k-space 1. Data that lies along lines L2 and L5 are not acquired. During reconstruction, the original image is restored using the overlapped and under-sampled k-space. While Figure 7 shows that the dataset in Overlapped k-space 1 is the result of combining data lying along alternate lines (for example L1+L3; L4+L6) of the original image, the completion of an overlapped and under-sampled acquisition of k-space data as described above may randomly select data samples, as described above with respect to Figure 6. However, random variations in the flip angles and/or phases and/or gradient amplitudes preclude the use of conventional PMRI to synthesize these unacquired samples. Therefore, in embodiments where the relevant parameters are randomly varied and under-sampling is also employed during "block aliasing", the matrix E is further modified to reflect this process by simply not including the unacquired k-space locations in Equation [2j. Other than this change to the matrix E, the rest of the iterative data restoration process remains the same. Therefore, the present invention is capable of delivering higher acceleration factors by combining "block aliasing" with data under-sampling. As long as the matrix E remains over-determined, the under-sampfed, "block aliased" k-space dataset can be fully restored using the same iterative process. Therefore in this embodiment, the following additional changes will occur in the method as shown in Figures 5 and 6 of the present invention: a. The completion of an overlapped acquisition of k-space data includes the additional step of under-sampling the "block aliased" data; and b. Step 506 includes an additional step of modifying the matrix E to also reflect the use of under-sampling during data acquisition by not including in E the un-acquired k- space locations. If the variation in the flip angles and/or phases and/or gradient amplitudes is non-random, then the use of conventional PMRI to restore the unacquired samples in "block aliased" k-space data will become possible. In the present invention, the iterative reconstruction process can include an intermediate stage where PMRI is first employed to synthesise the unacquired samples in "block aliased" k-space. Subsequent to the PMRI process, the rest of the iterative data restoration of step 506 will proceed without any modification to E. Another embodiment where the use of PMRI with the disclosed invention is preferred is in the case of 3-dimensional k-space acquisitions where overlapping of samples is performed along one phase encoding (e.g ky) axis while under-sampling is implemented along the kz phase encoding axis. In this case, the overlapping of samples can be random or non-random since PMRI is applied along only kz while unfolding of the overlapped samples is performed along the kv axis. Therefore, in cases where additional scan acceleration is desired, an ideal embodiment of the invention will also include the use of under-sampling. The present invention can be practiced on an MRI system of the sort described in detail in Figure 8.The system includes a workstation 10 having a display 12 and a keyboard 14. The workstation 10 includes a processor 16 that is a commercially available programmable machine running a commercially available operating system. The workstation 10 provides the operator interface that enables scan prescriptions to be entered into the MRI system. The workstation 10 is coupled to four servers including a pulse sequence server 18, a data acquisition server 20, a data processing server 22, and a data store server 23, The workstation 10 and each server 18, 20, 22 i and 23 are connected to communicate with each other. The pulse sequence server 18 functions in response to instructions downloaded from the workstation 10 to operate a gradient system 24 and an RF system 26. Gradient waveforms necessary to perform the prescribed scan are produced and applied to I the gradient system 24 that excites gradient coils in an assembly 28 to produce the magnetic field gradients Gx, Gy and Gz used for position encoding MR signals. The gradient coil assembly 28 forms part of a magnet assembly 30 that includes a polarizing magnet 32 and a whole-body RF coil 34. The B, excitation pulses are applied to the RF coil 34 by the RF system 26 to perform the prescribed magnetic i resonance pulse sequence. Responsive MR signals detected by the RF coil 34 or a separate local coil (not shown in Figure 6) are received by the RF system 26, amplified, demodulated, filtered, and digitized under direction of commands produced by the pulse sequence server 18. The RF system 26 includes an RF transmitter for producing a wide variety of RF pulses used in MR pulse sequences. The RF I transmitter is responsive to the scan prescription and direction from the pulse sequence server 18 to produce RF pulses of the desired frequency, phase and pulse amplitude waveform. The RF excitation pulses may be applied to the whole body RF coil 34 or to one or more local receiver coils or receiver coil arrays (not shown in Figure 8).The RF system 26 also includes one or more RF receiver channels. Each > RF receiver channel includes an RF amplifier that amplifies the MR signal received by the coil to which it is connected and a detector that detects and digitizes the I and Q quadrature components of the received MR signal. The magnitude of the received MR signal may thus be determined at any sampled point by the square root of the sum of the squares of the I and Q components: and the phase of the received MR signal may also be determined:

Documents

Application Documents

# Name Date
1 201747027552-RELEVANT DOCUMENTS [03-10-2023(online)].pdf 2023-10-03
1 201747027552-STATEMENT OF UNDERTAKING (FORM 3) [02-08-2017(online)].pdf 2017-08-02
2 201747027552-FER.pdf 2021-10-17
2 201747027552-DRAWINGS [02-08-2017(online)].pdf 2017-08-02
3 201747027552-IntimationOfGrant30-09-2021.pdf 2021-09-30
3 201747027552-DECLARATION OF INVENTORSHIP (FORM 5) [02-08-2017(online)].pdf 2017-08-02
4 201747027552-PatentCertificate30-09-2021.pdf 2021-09-30
4 201747027552-COMPLETE SPECIFICATION [02-08-2017(online)].pdf 2017-08-02
5 201747027552.pdf 2017-08-03
5 201747027552-CLAIMS [28-09-2021(online)].pdf 2021-09-28
6 abstract 201747027552 .jpg 2017-08-04
6 201747027552-DRAWING [28-09-2021(online)].pdf 2021-09-28
7 201747027552-FORM-26 [02-11-2017(online)].pdf 2017-11-02
7 201747027552-FER_SER_REPLY [28-09-2021(online)].pdf 2021-09-28
8 201747027552-Proof of Right (MANDATORY) [10-11-2017(online)].pdf 2017-11-10
8 201747027552-OTHERS [28-09-2021(online)].pdf 2021-09-28
9 Correpondence by Agent_Power of Attorney_14-11-2017.pdf 2017-11-14
9 201747027552-FORM 3 [27-07-2021(online)].pdf 2021-07-27
10 201747027552-FORM 3 [18-01-2018(online)].pdf 2018-01-18
10 201747027552-FORM 4(ii) [27-07-2021(online)].pdf 2021-07-27
11 201747027552-FORM 18 [12-12-2018(online)].pdf 2018-12-12
11 201747027552-FORM 3 [16-06-2020(online)].pdf 2020-06-16
12 201747027552-FORM 18 [12-12-2018(online)].pdf 2018-12-12
12 201747027552-FORM 3 [16-06-2020(online)].pdf 2020-06-16
13 201747027552-FORM 3 [18-01-2018(online)].pdf 2018-01-18
13 201747027552-FORM 4(ii) [27-07-2021(online)].pdf 2021-07-27
14 201747027552-FORM 3 [27-07-2021(online)].pdf 2021-07-27
14 Correpondence by Agent_Power of Attorney_14-11-2017.pdf 2017-11-14
15 201747027552-OTHERS [28-09-2021(online)].pdf 2021-09-28
15 201747027552-Proof of Right (MANDATORY) [10-11-2017(online)].pdf 2017-11-10
16 201747027552-FER_SER_REPLY [28-09-2021(online)].pdf 2021-09-28
16 201747027552-FORM-26 [02-11-2017(online)].pdf 2017-11-02
17 201747027552-DRAWING [28-09-2021(online)].pdf 2021-09-28
17 abstract 201747027552 .jpg 2017-08-04
18 201747027552-CLAIMS [28-09-2021(online)].pdf 2021-09-28
18 201747027552.pdf 2017-08-03
19 201747027552-PatentCertificate30-09-2021.pdf 2021-09-30
19 201747027552-COMPLETE SPECIFICATION [02-08-2017(online)].pdf 2017-08-02
20 201747027552-IntimationOfGrant30-09-2021.pdf 2021-09-30
20 201747027552-DECLARATION OF INVENTORSHIP (FORM 5) [02-08-2017(online)].pdf 2017-08-02
21 201747027552-FER.pdf 2021-10-17
21 201747027552-DRAWINGS [02-08-2017(online)].pdf 2017-08-02
22 201747027552-STATEMENT OF UNDERTAKING (FORM 3) [02-08-2017(online)].pdf 2017-08-02
22 201747027552-RELEVANT DOCUMENTS [03-10-2023(online)].pdf 2023-10-03

Search Strategy

1 2021-01-2813-53-24E_28-01-2021.pdf

ERegister / Renewals

3rd: 24 Dec 2021

From 10/02/2018 - To 10/02/2019

4th: 24 Dec 2021

From 10/02/2019 - To 10/02/2020

5th: 24 Dec 2021

From 10/02/2020 - To 10/02/2021

6th: 24 Dec 2021

From 10/02/2021 - To 10/02/2022

7th: 24 Dec 2021

From 10/02/2022 - To 10/02/2023

8th: 27 Feb 2023

From 10/02/2023 - To 10/02/2024

9th: 08 Feb 2024

From 10/02/2024 - To 10/02/2025

10th: 10 Feb 2025

From 10/02/2025 - To 10/02/2026