Magnetic resonance imaging methods and apparatus

Abstract: An incomplete set of three dimensinal magnetic resonance data (F(k₁, k₂, k₃) is collected and stored in acquired data memory (60). The incomplete data set is complete with respect to first and second directions and incomplete with respect to a third direction. However, the acquired data set has data along the third direction between ±n central values and half the remaining values. One dimensional inverse Fourier transforms (64, 66) are performed with respect to the first and second directions to create an intermediate data set (68). A phase correction array or plurality of phase correction vectors p( r ) are generated from the intermediate data and stored in a phase correction memory (82). A symmetric data set (100) is created as the complex conjugate of the intermediate data set. The intermediate and symmetric data sets are one dimensionally inverse Fourier transformed (92, 104) with respect to the third direction one vector at a time to produce vectors of first and second complex image arrays (f A , F S ) corrected (96, 108) with the corresponding phase correction vector, and combined (110) into a line of a resultant three dimensional image representation (112).

Description: The present invention relates to magnetic resonance imaging methods and apparatus. It finds particular application in three dimensional or volumetric imaging and will be described with particular reference thereto, although the benefits may be equally applicable to four dimensional imaging. Heretofore, medical diagnostic magnetic resonance imaging has included the sequential pulsing of radio frequency signals and magnetic field gradients throughout an examination region to be imaged. In volumetric or three dimensional imaging, a region of interest of a patient is disposed in a substantially uniform, main magnetic field. An RF excitation pulse is applied to tip at least some of the magnetization aligned with the field into a transverse plane. The RF excitation may be applied independent of a gradient or concurrently with a slice select gradient. A primary phase encode gradient is applied along one direction and a secondary phase encode gradient is applied along another direction which may also be the slice select gradient direction. In each repetition of the pulse sequence, one of the phase encode gradients is stepped at regular intervals from a negative maximum phase encode gradient, through a zero phase encode gradient, to a positive maximum phase encode gradient. For each gradient step of the first phase encode gradient, the other phase encode gradient is similarly stepped at regular intervals from the negative maximum, through zero, to the positive maximum. Commonly, an RF pulse and/or a gradient field is applied to manipulate the magnetization to cause an ensuing magnetic resonance echo. During the echo, a read gradient is applied along a third direction and echo data is sampled. Typically, the set of data points sampled during an echo is termed a view or step. The complete set of views or steps are operated on with a three dimensional Fourier transform to generate a resultant three dimensional image representation. Each datum or element of the three dimensional, (3D), or volume data set can be thought of as a sample of a single point in k-space. In this representation, k corresponds to a 3D spatial frequency. Its projection in the phase encode direction caused by the phase encode gradients is equivalent to its projection in the read direction caused by the read gradient. When the sampling of k-space is done in an isotropic manner, each point in the data set is related to another point by the conjugate symmetry relation: F ( k ) = F*(- k ) In practice, this symmetry relationship is subverted by unpredictable phase variations that result from sequence and magnetic field considerations. Thus, conventionally, a full data set is acquired, 3D Fourier transformed, and the magnitude of the complex result taken to render an image that is phase independent. In traditional three dimensional imaging, the phase encode gradients might each vary in equal increments with 128 steps and 128 data points might be sampled in each view, defining a volume in k-space that is 128 3 complex values. If each magnetic resonance excitation, phase encode, and echo sample sequence is repeated every 100 msec. and two repetitions of each encoding are averaged, a total scan time of almost an hour is required. With human patients, scan times of this duration are often undesirable. Moreover, long scan times limit three dimensional imaging to substantially motion-free areas of the anatomy, such as brain scans. Various ways of reducing the scan time have been proposed. The repeat time cannot be reduced without loss of signal because it takes a finite time to regrow longitudinal magnetization between repetitions of the pulse sequence. Likewise, a reduction in echo time affects the image contrast. Scan time may be reduced by simply taking fewer steps in one of the phase encoding directions. This, however, may result in resolution loss and/or aliasing problems. One way to reduce the acquisition time is to define a thick slice in one of the phase encoding directions, then do the volume within this slice. Since there is effectively no object outside the slice, one can increase the spacing between phase encode views to reduce the number of views taken in the slice direction without affecting resolution. Unfortunately, because of imperfections in the slice definition, images from slices near the edges may not be acceptable. Another method for reducing scan time is to increase the number of data points sampled per scan, such as the technique shown in U.S. Patent No. 4,678,996. Others have reconstructed two dimensional images using only half a set of views, i.e. only the positive views or only the negative views. EP-A-0 306 135 discloses a magnetic resonance imaging method and apparatus in which an incomplete set of magnetic resonance image data is collected and stored in a view memory. The incomplete set of image data includes a central or first set of data values and a side or second set of data values. The central data set is operated on by a roll-off filter and a Fourier transform means to create a normalized phase map. The first and second data sets are Fourier transformed and phase corrected by being multiplied with a complex conjugate of the corresponding phase map data value to produce a first phase corrected image representation. A third data set is generated by determining the complex conjugate of the second or side data set. The third data set is Fourier transformed and multiplied by a corresponding value from the phase map to produce a second phase corrected image representation. The first and second phase corrected image representations are summed and stored in a resultant image memory. EP-A-028 0310 discloses a magnetic resonance imaging method comprising the step of generating a static magnetic field, gradient magnetic fields and a radio-frequency magnetic field; the step of measuring an NMR signal from an object to-be-examined on an arbitrary partial region which is so determined that, in the partial region of a measurement region required for obtaining both a real part and an imaginary part of a reconstructed image at a desired resolution, said partial region itself and a region obtained by moving said partial region in point symmetry with respect to an origin of a measurement space include the whole measurement region when combined; and the step of reconstructing the image by combining the measured signals and phase information on the reconstructed image. Health Care Instrum 1 1986, pages 195-197 P. Margosian discloses a faster imaging method with slightly more than half of the normal data set. Radiology 161 (1986), pages 527-531 discloses M R imaging in which conjugation can be used to synthesize half of the data acquired during a conventional two-dimensional Fourier transform imaging procedure, thus reducing imaging time by nearly half. Book of Abstracts 6th Annual Meeting Society of Magnetic Resonance in Medicine 1987, page 379 discloses the use of a double phase correction/Hermetian Conjugation Procedure in a half-Fourier imaging method. The present invention provides a new and improved technique for reconstructing volumetric images with less than a full set of data and which compensates for the above referenced problems and others. According to a first aspect of the present invention there is provided a method of magnetic resonance imaging comprising the steps of: (a) acquiring a data set which is complete with respect to first and second axes of a three axis coordinate system in k-space and incomplete with respect to the third axis of the system, the data set being more than half complete with respect to the third axis; (b) following step (a), inverse Fourier transforming the acquired data set with respect to the first and second axes to create a partially inverse Fourier transformed intermediate data set; (c) following step (b), determining a symmetric data set which is related to the partially inverse Fourier transformed intermediate data set by complex conjugate symmetry; (d) following step (c), filtering the symmetric data set along said third axis in k-space with a first roll-off filter; (e) following step (d), inverse Fourier transforming the filtered symmetric data set with respect to the third axis; (f) following step (b) and in parallel with steps (c) - (e), filtering the partially inverse Fourier transformed intermediate data set with a second roll-off filter that is the complement of said first roll-off filter along said third axis in k-space; (g) following step (f) and in parallel with steps (c) - (e), inverse Fourier transforming the filtered intermediate data set with respect to the third axis; (h) following step (b) and in parallel with steps (c) - (g), deriving a phase correction array from said intermediate data set using the data in the neighbourhood of zero along said third axis in k space; (i) following steps (e) and (h), phase correcting the inverse Fourier transformed filtered symmetric data set in accordance with a corresponding value of the phase correction array; (j) following steps (g) and (h) and in parallel with step (i), phase correcting the inverse Fourier transformed filtered intermediate data set in accordance with a corresponding value of the phase correction array after complex conjugation of the latter; and (k) following steps (i) and (j), combining the phase corrected inverse Fourier transformed filtered intermediate and symmetric data sets into an image representation, the processing of steps (c) - (k) being one-dimensional by being carried out on each one of a plurality of one-dimensional vectors comprising said partially inverse Fourier transformed intermediate data set, each said one-dimensional vector being along said third axis in k-space. According to a second aspect of the present invention there is provided an apparatus for magnetic resonance imaging comprising means arranged to acquire a data set which is complete with respect to first and second axes of a three axis coordinate system in k-space and incomplete with respect to the third axis of the system, the data set being more than half complete with respect to the third axis, and data processing means arranged to carry out steps (b) - (k) of the preceding paragraph, said data processing means comprising: means arranged to inverse Fourier transform the acquired data set with respect to the first and second axes to create a partially inverse Fourier transformed intermediate data set; means arranged to determine a symmetric data set which is related to the partially inverse Fourier transformed intermediate data set by complex conjugate symmetry; a first roll-off filter arranged to filter the symmetric data set along said third axis in k-space; means arranged to inverse Fourier transform the filtered symmetric data set with respect to the third axis; a second roll-off filter arranged to filter the partially inverse Fourier transformed intermediate data set, said second filter being the complement of said first filter along said third axis in k-space; means arranged to inverse Fourier transform the filtered intermediate data set with respect to the third axis; means arranged to derive a phase correction array from said intermediate data set using the data in the neighbourhood of zero along said third axis in k-space; means arranged to phase correct the inverse Fourier transformed filtered symmetric data set in accordance with a corresponding value of the phase correction array ; means arranged to phase correct the inverse Fourier transformed filtered intermediate data set in accordance with a corresponding value of the phase correction array after complex conjugation of the latter ; and means arranged to combine the phase corrected inverse Fourier transformed filtered intermediate and symmetric data sets into an image representation, the processing of the means arranged to carry out steps (c) - (k) of the preceding paragraph being one-dimensional by being carried out on each one of a plurality of one-dimensional vectors comprising said partially inverse Fourier transformed intermediate data set, each said one-dimensional vector being along said third axis in k-space. One advantage of the present invention is that it reduces data collection time. Another advantage of the present invention resides in an improved signal-to-noise ratio. Another advantage of the present invention is that it avoids aliasing along one of the phase encode directions without a time penalty. A further advantage of the present invention resides in a reduction of artifacts and an improvement in resolution without a time penalty. EP-A-0208483 discloses a method of determining a spatial nuclear magnetization distribution in an object. The method comprises the following steps: applying a static magnetic field along an axis of the object; exciting, with a frequency selective RF pulse, selected nuclear spins in a selected plane of the object in the presence of a plane selection gradient of the static magnetic field, so as to produce an NMR signal; applying simultaneously, first and second mutually orthogonal magnetic field gradients each having one of a predetermined number of selectable magnitudes to phase encode into the NMR signal, information of the spatial distribution of the excited nuclear spins within a volume containing the selected plane; irradiating the object with a 180° RF pulse so as to invert the excited nuclear spins to obtain NMR spin echo signals, the nuclear spin echo signals producing a composite NMR signal for Fourier transformation to yield information of said spatial distribution throughout the selected plane of the object; determining a phase shift at a time when the amount of phase encoding of the first and second gradients is zero; and utilizing the determined phase shift at a time when the amount of phase encoding of the first and second gradients is not zero to correct the phase error and calculate the nuclear magnetization distribution. The method also exploits a point symmetry which exists with respect to the origin of k-space when using spin echo NMR. This exploitation reduces the sampling period by up to one half. A variation is disclosed wherein more efficient data handling is achieved through the use of two separate 1-D Fourier transformations instead of a 2-D transformation. One magnetic resonance imaging method in accordance with the invention and apparatus for carrying out the method will now be described by way of example with reference to the accompanying drawings in which:- Figures 1A and 1B together comprise a diagrammatic illustration of the apparatus; Figure 2 is a timing diagram illustrating an exemplary pulse sequence for implementation by the apparatus of Figures 1A and 1B; and Figures 3, 4 and 5 are a graphic representation to assist in conceptualizing a technique used in the method. With reference to Figures 1A and 1B, a main magnetic field means, including a main magnetic field controller 10 and a plurality of electromagnets or superconducting magnets 12, generates a substantially uniform main magnetic field through an imaging or examination region. In a superconducting magnet, the controller 10 is used only to ramp up to field or down. A gradient field control means 20 selectively controls the application of gradient fields across the main magnetic field by gradient field coils 22. By selectively applying current to appropriate ones of the gradient field coils 22 gradients are selectively applied along three mutually orthogonal axes. Gradient fields in any direction can be produced by superposition of gradients along these axes. The center or zero of the image and data set corresponds to a point in space where no longitudinal field is produced by the gradient field coils. A transmitter 30 selectively applies radio frequency pulses to RF coils 32 to excite nuclear spin of hydrogen in the imaging region to resonance and to manipulate the magnetization. Magnetic resonance signals generated by the resonating dipoles, particularly when the magnetization is refocused into an echo, are received by the RF coils 32. Optionally, a separate pick-up coil may be provided. A radio frequency quadrature receiver 34 quadrature detects and demodulates the received radio frequency signals to a selected bandwidth about a characteristic frequency. Preferably the characteristic frequency is zero. The real and imaginary parts of the quadrature detected magnetic resonance signals are digitized by a pair of analog-to-digital converters 36, 38, the digital signal from each echo commonly being denoted as a view or line of data. With reference to Figures 1A, 1B and 2, a timing and control means 40 controls the timing and application of the gradient and radio frequency profiles to perform three dimensional spin echo, gradient echo, inversion recovery, hybrid imaging, and other imaging sequences, as are well known in the art. For example, the sequence control means 40 may cause the transmitter 30 to apply a 90° RF pulse 42 concurrently with gradient field control 20 causing a first gradient profile 44 along a first or slice select direction. Thereafter, a first or primary phase encoding gradient 46 is applied on a second or phase encode direction and a second or secondary phase encoding gradient 48 is applied across one of the remaining direction, preferably the first or slice select direction. The phase encode gradients may each assume any one of a plurality of steps. Another gradient profile 50 is applied along a third or read gradient. A 180° RF refocusing pulse is applied to induce a spin ehco 54. Another profile 52 is applied along the third or read gradient direction concurrently with the echo 54. Optionally, a gradient in the slice select direction may be applied concurrently with the refocusing pulse to define a slab. The imaging sequence is repeated with the primary phase encode gradient stepping through each of its gradient steps while the secondary phase encoding gradient remains fixed in one of its steps. After the primary gradient has stepped through all or a selected position of its step, the secondary gradient is stepped to its next step. This sequence is repeated a plurality of times with the primary phase encoding gradient assuming each of its selected steps as the secondary gradient assumes each of its steps. In the embodiment of FIGURE 3, the imaging sequence is repeated with the primary phase encode gradient 46 assuming the steps from its positive maximum gradient through its zero or central phase encode gradient to a gradient step n steps to the negative. For example, the positive maximum phase encode gradient may be 128 steps from the zero or central phase encode gradient and n may be 16. Eliminating the time to collect the primary gradient steps from -17 through -128, cuts the data collection time nearly in half. Alternately, as shown in FIGURE 4, the secondary phase encode gradient 48 along the slice select axis may be limited to one half plus n steps. As illustrated in FIGURE 5, the data along the time or read axis may be cut in half by sampling half plus n of the data points of the induced echo. That is, the echo may be sampled from n points before its midpoint toward the trailing end. This allows the echo time TE to be shortened such that the echo midpoint is about n points from the leading edge of the read gradient. As yet another alternative, a phase encode gradient may also be applied along the read gradient axis to create a four dimensional image. More specifically, three dimensions of spatial information and one dimension of frequency, such as chemical shift, information can be recovered. The real and imaginary parts of the digital values of the partial or fractional data sets as described above in conjunction with FIGURES 3, 4, and 5 or combinations thereof, are stored in a data memory 60. A centering means 62 centers the data. For spin echo or gradient echo imaging, the magnitude of the acquired data has a maximum at the center of the data set, i.e. the datum value acquired with the zero or minimum phase encoding along all phase encoding directions and at the characteristic or center frequency. The data within the data memory 60 is shifted such that the largest data value is moved to the center of the data acquisition memory. Of course, other centering options may also be implemented. A first, one dimensional Fourier transform means 64 performs a one dimensional, inverse Fourier transform along one of the directions that has the same number of data points to either side of zero. One of the two complete data directions, e.g. k 3 , is selected. A second one dimensional inverse Fourier transform means 66 performs an inverse one dimensional Fourier transform along the other complete data direction, i.e. k 2 . The Fourier transformed data is stored in an intermediate data memory 68. A phase map reconstruction means 70 reconstructs a phase correction array or map from the data in the neighbourhood of zero, i.e. the data along the partial data direction k 1 between ± n, in the illustrated example. To complete the data in the partial data direction k 1 , data values to either side of the original, centered data are set to zero. A roll-off filter means 72, such as a Hanning filter H(k 1 ) rolls off the data values along the partial data direction. The filter generates a filtered data set S(k 1 , r 2 , r 3 ) for storage in a filtered data latch or memory means 74 in which the selected data in the neighborhood of zero has a smooth transition to zero. That is: The first two transforms 64 and 66 were done using all of the data in the two complete data directions and only the data around the center in the incomplete direction. Various other roll-off filters may be utilized to provide the smooth transition between the collected data and the surrounding zeros to eliminate any discontinuities which might cause ringing or artifacts. A one dimensional inverse Fourier transform means 76 performs a one dimensional, inverse Fourier transform with respect to the incomplete data direction k 1 . Although a three dimensional phase map can be generated, a large amount of storage would be required. A 256 x 256 x 256 three dimensional phase map of the preferred embodiment would have 16.8 million complex data points. Assume that the data in memory 60 has the dimensions R 1 x R 2 x R 3 or has been zero padded out to these dimensions. Thus, R 1 , R 2 , R 3 indicate the number of data samples in the r 1 , r 2 , r 3 directions respectively. The first Fourier transform means 64 picks up R 3 of these samples from the data memory 60, a total of R 1 x R 2 times. If the Fourier transform is done on each vector of R 3 complex points then they can be written to the memory locations they originated from in the data memory 60. The same is true for Fourier transform means 66 except it picks up R 2 points at a time to process them. If R 1 , R 2 , R 3 are 128, 256, and 512 then means 64 does 32768 transforms of lengths 512. Also the second Fourier transform means 66 does 65536 transforms of length 256. These data can be written into the memory locations they were read from. Thus, memory means 68 can be the same as memory means 60. Getting from memory means 68 to image memory means 112 is another problem. However, it is still a one dimensional problem as is Fourier transform means 64 and 66. This time we pick up the data points in the k 1 direction then using these points to steps 70 → 82, 90 → 96, 100 → 108 with the appropriate combination scheme to get to step 112. Finally, these R 1 or 128 points are written into image memory 112 which in principle could be the same data memory as 60 and 68, although in practice is usually an image file. Remember that we went through the processing steps between 68 and 112 a total of R 2 x R 3 times or 131072 times, once for each group of R 1 or 128 points that is written to image memory 112. The trick here is to have the three pipelines, proceed in parallel for each group of points picked up in the k 1 direction. This saves 16.8 complex megawords of memory that would otherwise be needed for the phase map. To reduce the required memory, the inverse Fourier transform means 76 generates a plurality of one dimensional phase correction vectors which are stored in a phase correction memory means 78. In a 256 x 256 x 256 embodiment, the Fourier transform means 76 performs about sixty five thousand (256 x 256) transforms each of length 256. Each 1 x 256 phase map direction is described by the equation: s(r) = F -1 { S(k 1 , r 2 , r 3 ) } A phase map correction determining means 80 determines an appropriate correction for each point s( r ). The correction array p( r ) are each stored in a phase correction memory means 82. In the preferred embodiment, the phase correction p( r ) is the Fourier transformed array of unit value, i.e. p( r ) = s r | s r | Although this correction is technically not a phase map, it is the functional equivalent of a phase map. Conventionally, a phase map is the arctangent of the ratio of the real and imaginary parts of the array s( r ), i.e. The arctangent phase map may also be used where p( r ) = e i( r ) . The processed collected data from the intermediate data memory means 68 is filtered with a roll-off filter 90, such as a Hanning filter R(k 1 ), to ramp down toward zero the n data points at the center of the intermediate memory. An inverse Fourier transform means 92 transforms the filtered data with respect to the incomplete data direction, i.e. k 1 , to create a filtered array or first complex image representation f A ( r ) which is stored in a first array memory means 94. The Fourier transform means 92 transforms individual one dimensional arrays of the filtered data. In the illustrated 128 x 256 x 256 example, about sixty-five thousand (128 x 256) arrays which are each 256 elements in length are serially transformed. That is: f A ( r ) = F -1 {F(k 1 , r 2 , r 3 ) · R(k 1 )} A first phase correction means 96 phase corrects each vector of the first complex image representation f A in accordance with the phase information of the corresponding correction vector from the phase memory means 82. More specifically, a phase correction complex conjugate means 98 calculates the complex conjugate of each value of the phase memory 82. For example, the complex conjugate of a unit vector e i( r ) is e- i( r ) . The phase correction means 96 multiplies each vector of the complex image representation f A ( r ) by the complex conjugate of the value p*( r ) of the vector from the phase memory means 82. The resultant phase corrected first complex image representation is then of the form: f A ( r )p*( r ) A symmetric data means 100 generates a symmetric data set which is a complex conjugate of the processed collected data values of memory means 68, In the preferred embodiment, data along the k 1 direction is collected from -n to +128. The symmetric data set is determined from the relation F(-k 1 , r 2 , r 3 ) = F*(k 1 , r 2 , r 3 ) and includes data from 0 to -128. A complementary roll-off filter means 102 ramps the symmetrized data with a filter function 1-R(k 1 ) that is the complement of the first roll-off filter R(k 1 ). A Fourier transform means 104 performs an inverse, one dimensional Fourier transform on the filtered third data set to create a second complex image representation or symmetric array f s ( r ) for storage in a second image representation memory means 106. Again, the Fourier transform means in the preferred embodiment performs each of about sixty-five thousand (256 x 256) transforms. That is: f s ( r ) = f -1 {F*(k 1 , r 2 , r 3 ) · (1-R(k 1 )} A second phase correction means 108 corrects each data value of the vectors of the second image representation or array f s in accordance with the corresponding phase correction vector from the phase memory 82. In the preferred embodiment, the second phase corrected complex image representation is of the form: f s ( r )p( r ) In this manner, the first and second phase correction means 96, 108 perform a phase correction in which the resultant data or image representation is corrected with a phase map or the equivalent of a phase map generated from the same data. Utilizing the same data to correct the phase protects against the introduction of phase errors which might arise if different data were utilized, such as a calibration scan that might be used to collect data for a phase map. An adding means 110 sums the phase corrected first and second complex image representations. More specifically to the preferred embodiment, the adding means sums each phase corrected vector of the filtered array and the symmetrized array and stores the sum as one line of an image in a resultant image memory means 112. The resultant image is, of course, a three dimensional complex image in which each data value is a complex number having a real part and an imaginary part. That is: f( r ) = f A p*( r )+f s ( r )p( r ) A display means 114 is operatively connected with the resultant image memory means 112. The display means may display the real component, the imaginary component, or combinations thereof. Moreover, selected slices, planes, projections of tortuous slices or paths, and the like may be displayed. The slices may be planes orthogonal to the slice select, read, and phase encode directions or may be at selected angles relative to one or more of these directions, may be multisegmental with several angular jogs, curved surfaces, or the like. The planes may follow a selected contour which jogs and curves, such as a slice or path which skirts a selected organ, or a slice or path that follows the interface between two tissues. Other data storage means, image enhancement circuitry, and the like may be interconnected with the resultant image memory means 112. The phase corrected conjugate symmetry technique can be adapted to improve imaging speed, signal-to-noise ratio, and reduce aliasing. Regarding speed reduction, large matrices of data of necessity have a relatively long data acquisition time. For example, to acquire data for a 128 x 128 x 128 volume conventionally with a repeat time of 50 msec and two repetitions per view, requires over 27 minutes. To increase the resolution in each direction to 256 intervals would increase the acquisition time by a factor of eight. Because the present phase corrected conjugate symmetry technique requires the acquisition of only a little over half the data, the data acquisition time can be reduced almost in half. Analogously, the signal-to-noise ratio can be improved by increasing the sequence repeat time (TR). In the above example, the signal repeat time can be increased from 50 msec to about 100 msec without increasing the total scan time. That is, the time between excitations is increased by about 50 msec. The magnitude of the collected signal is proportional to: 1 - exp(-TR/T1) where T1 for brain tissue is about 700 msec. For a sequence repeat time of 50 msec, the signal amplitude is proportional to 0.07; whereas for a repeat time of 100 msec, the amplitude is proportional to 0.133. Thus, doubling the sequence repeat time improves the signal strength by 90% and the signal-to-noise ratio by 1.9/1.412 or 34%. The present technique provides for increased sequence flexibility such as the ability to use asymmetric sampling and extended sampling to achieve images with shorter echo delay times (TE). Because only slightly over half of a resultant echo need be monitored, the echo can be shifted closer to the beginning of the sequence. This shortens the length of each sequence, improving imaging speed. Alternately, the signal-to-noise ratio can be improved by sampling the half echo for a longer period of time with a reduced gradient 50 and RF band pass filter. This method may be used with isotropic or anisotropic matrices to reduce aliasing without increasing acquisition time. In the prior art, it was necessary to over-sample in the frequency encoding direction to avoid aliasing from a sample that extended beyond the imaged field of view. In the phase encode direction, over-sampling increased acquisition time by the over-sampling factor. Accordingly, the phase encoding axis was normally chosen such that the object did not extend beyond the field of view. For example, in sagittal imaging, the long axis z was chosen as the read axis and the y axis for phase encoding. However, in volume imaging in which there is two phase encoding directions, it is not always possible to select two axes in which the object does not extend beyond the field of view. Aliasing can be prevented along one of the two phase encoded axes by utilizing the present invention to double the effective number of views, i.e. by over-sampling. Actually acquiring data for just over half of the doubled number of views and symmetrizing the remaining views reduces aliasing without a time penalty. The technique can also be used to improve slice resolution. In a slab imaging technique, an anisotropic data set is collected with a reduced number of data points in the "slice" direction. This creates a three-dimensional set of data in which the slice or slab direction is smaller than the other dimensions. The width of the smaller or slab dimension is defined by selective excitation. The slab is divided into a set of thinner slices by secondary phase encoding in the slice direction. The number of slices to which the slab is subdivided is proportional to the number of phase encoding steps. Conjugate symmetrization can be used either to increase the slice resolution within the slab or the number of acquired slices without an acquisition time penalty. Exciting a wider slab with more slices in the same total scan time extends the patient coverage to avoid artifacts that occur near the edges of the slab due to imperfect selective excitation. Alternatively, the resolution of a prior art 16 slice slab can be doubled to 32 slices with no significant time penalty by collecting actual data for just over half the slices and generating the remaining data by symmetrization.

Claims: A method of magnetic resonance imaging comprising the steps of: (a) acquiring a data set (60) which is complete with respect to first and second axes of a three axis coordinate system in k-space and incomplete with respect to the third axis of the system, the data set (60) being more than half complete with respect to the third axis; (b) following step (a), inverse Fourier transforming (64, 66) the acquired data set with respect to the first and second axes to create a partially inverse Fourier transformed intermediate data set (68); (c) following step (b), determining a symmetric data set (100) which is related to the partially inverse Fourier transformed intermediate data set (68) by complex conjugate symmetry; (d) following step (c), filtering the symmetric data set (100) along said third axis in k-space with a first roll-off filter (102); (e) following step (d), inverse Fourier transforming (104) the filtered symmetric data set with respect to the third axis; (f) following step (b) and in parallel with steps (c) - (e), filtering the partially inverse Fourier transformed intermediate data set (68) with a second roll-off filter (90) that is the complement of said first roll-off filter (102) along said third axis in k-space; (g) following step (f) and in parallel with steps (c) - (e), inverse Fourier transforming (92) the filtered intermediate data set with respect to the third axis; (h) following step (b) and in parallel with steps (c) - (g), deriving a phase correction array (82) from said intermediate data set (68) using the data in the neighbourhood of zero along said third axis in k-space; (i) following steps (e) and (h), phase correcting (108) the inverse Fourier transformed filtered symmetric data set (106) in accordance with a corresponding value of the phase correction array (82); (j) following steps (g) and (h) and in parallel with step (i), phase correcting (96) the inverse Fourier transformed filtered intermediate data set (94) in accordance with a corresponding value of the phase correction array (82) after complex conjugation of the latter; and (k) following steps (i) and (j), combining (110) the phase corrected inverse Fourier transformed filtered intermediate and symmetric data sets into an image representation (112), the processing of steps (c) - (k) being one-dimensional by being carried out on each one of a plurality of one-dimensional vectors comprising said partially inverse Fourier transformed intermediate data set (68), each said one-dimensional vector being along said third axis in k-space. An apparatus for magnetic resonance imaging comprising means (10, 12, 20, 22, 30, 32, 34, 36, 38, 40) arranged to acquire a data set (60) which is complete with respect to first and second axes of a three axis coordinate system in k-space and incomplete with respect to the third axis of the system, the data set (60) being more than half complete with respect to the third axis, and data processing means arranged to carry out steps (b) - (k) of Claim 1, said data processing means comprising: means (64, 66) arranged to inverse Fourier transform the acquired data set (60) with respect to the first and second axes to create a partially inverse Fourier transformed intermediate data set (68); means (100) arranged to determine a symmetric data set (100) which is related to the partially inverse Fourier transformed intermediate data set (68) by complex conjugate symmetry; a first roll-off filter (102) arranged to filter the symmetric data set (100) along said third axis in k-space; means (104) arranged to inverse Fourier transform the filtered symmetric data set with respect to the third axis; a second roll-off filter (90) arranged to filter the partially inverse Fourier transformed intermediate data set (68), said second filter (90) being the complement of said first filter (102) along said third axis in k-space; means (92) arranged to inverse Fourier transform the filtered intermediate data set with respect to the third axis; means (72, 74, 76, 78, 80) arranged to derive a phase correction array (82) from said intermediate data set (68) using the data in the neighbourhood of zero along said third axis in k-space; means (108) arranged to phase correct the inverse Fourier transformed filtered symmetric data set (106) in accordance with a corresponding value of the phase correction array (82); means (96) arranged to phase correct the inverse Fourier transformed filtered intermediate data set (94) in accordance with a corresponding value of the phase correction array (82) after complex conjugation of the latter ; and means (110) arranged to combine the phase corrected inverse Fourier transformed filtered intermediate and symmetric data sets into an image representation (112), the processing of said means (100), first roll-off filter (102), means (104), second roll-off filter (90), means (92), means (72, 74, 76, 78, 80), means (108), means (96) and means (110) being one-dimensional by being carried out on each one of a plurality of one-dimensional vectors comprising said partially inverse Fourier transformed intermediate data set (68), each said one-dimensional vector being along said third axis in k-space.

Inventors: BEARDEN FRANCIS H, DEMEESTER GORDON D, HOLLAND G NEIL, BEARDEN, FRANCIS H., DEMEESTER, GORDON D., HOLLAND, G. NEIL
Applicants: PICKER INT INC, PICKER INTERNATIONAL, INC.
Application year: 1989
Main classification: G01N24
IPC codes: G01R33, A61B5