Acoustic noise is produced during magnetic resonance (MR) scans. The acoustic noise may be, for example, loud banging sounds caused by the production of readout gradients. The noise may be uncomfortable for patients, technicians, doctors, and anyone else in the vicinity of the MR apparatus. Indeed, loud banging may be disconcerting or even unnerving for a patient who is already nervous about being “in the bore” to have some condition (e.g., torn knee, cancer) evaluated.
Previous attempts have been made to intersperse MR readout gradients with music. See, for example, R. Loeffler, Proc. Intl. Soc. Mag. Reson. Med, 10 (2002). Conventionally it may have been difficult, if even possible at all, to simulate music due to the fixed sequence blocks and invariant pulse sequences associated with traditional MR acquisitions.
Conventionally, given a digital music file (e.g., MP3), its trajectory could be analyzed and “music” could be generated using a gradient where the gradient was produced by optimizing:
min(∥G−s∥2+λΣG)+GM
where G is a target gradient, s is a music segment, λ is used to balance gradient fidelity, refocusing, and trajectory coverage, and GM is a gradient moment.
Magnetic resonance fingerprinting (MRF) employs a series of varied sequence blocks that simultaneously produce different signal evolutions in different resonant species (e.g., tissues) to which the radio frequency (RF) energy is applied. The term “resonant species”, as used herein, refers to an item (e.g., water, fat, tissue, material) that can be made to resonate using NMR. By way of illustration, when RF energy is applied to a volume that has bone and muscle tissue, then both the bone and muscle tissue will produce an NMR signal. However the “bone signal” and the “muscle signal” will be different and can be distinguished using MRF. The different signals can be collected over a period of time to identify a signal evolution for the volume. Resonant species in the volume can then be characterized by comparing the signal evolution to known evolutions. Characterizing the resonant species may include identifying a material or tissue type, or may include identifying MR parameters associated with the resonant species. The “known” evolutions may be, for example, simulated evolutions or previously acquired evolutions. A large set of known evolutions may be stored in a dictionary. Characterizing the resonant species can include identifying different properties of a resonant species (e.g., T1, T2, diffusion resonant frequency, diffusion co-efficient, spin density, proton density). Additionally, other properties including, but not limited to, tissue types, materials, and super-position of attributes can be identified. These properties may be identified simultaneously using MRF, which is described in U.S. patent application “Nuclear Magnetic Resonance (NMR) Fingerprinting”, application Ser. No. 13/051,044, and in Magnetic Resonance Fingerprinting, Ma et al., Nature 495, 187-192 (14 Mar. 2013), the contents of both of which are incorporated herein by reference.
The accompanying drawings, which are incorporated in and constitute a part of the specification, illustrate various example systems, methods, and other example embodiments of various aspects of the invention. It will be appreciated that the illustrated element boundaries (e.g., boxes, groups of boxes, or other shapes) in the figures represent one example of the boundaries. One of ordinary skill in the art will appreciate that in some examples one element may be designed as multiple elements or that multiple elements may be designed as one element. In some examples, an element shown as an internal component of another element may be implemented as an external component and vice versa. Furthermore, elements may not be drawn to scale.
Music that is coordinated with the production of readout gradients may mitigate acoustic noise issues (e.g., knocking) associated with conventional MR scans to provide an improved experience for the patient. Example apparatus and methods may use the acoustic waveform associated with a particular piece of music to select gradient waveforms for an MRF pulse sequence. Using the gradient waveforms in an MRF approach facilitates quantifying multiple tissue parameters without producing the uncomfortable acoustic noises. The extra degrees of freedom available in MRF allow the design of pulse sequences that will replicate music in the magnet, which may make the patient more comfortable and thus more compliant.
In one embodiment, an electronic music file (e.g., MP3) is directly converted to a readout encoding gradient. The readout encoding gradient is used with varying flip angles and repetition times (TR) in an MRF acquisition to simultaneously quantify MR parameters including T1, T2, off-resonance, and proton density all while producing a less disturbing or even pleasing sound for the patient.
Example MRF apparatus and methods use music-derived waveforms for encoding during readout. Encoded music in, for example, an MP3 format, may be converted to encoding gradients and optimized. In one embodiment, an encoding gradient may account for gradient moment nulling for steady state free precession (SSFP) readouts. The gradient waveforms are then used in MRF in combination with variable flip angles (FAs) and repetition times (TRs) to simultaneously quantify T1, T2, M0, or off-resonance.
The encoded music may first be low-pass filtered to, for example, 2 KHz to remove high frequency oscillations that may be reproducible by a gradient. The low pass filtered music may then be resampled to, for example, 100 Khz. The low pass filtered music may be resampled to match, for example, a gradient output raster time. While filtering and then resampling is described, in one embodiment the encoded music may be resampled then filtered. In other embodiments, the encoded music may be pre-processed in other ways and in other orders.
In one embodiment, when an SSFP-based MRF sequence is employed, an encoding gradient for a TR of the MRF sequence may be designed to start and end at the center of k-space. To account for starting and ending at the center of k-space, zero crossings of the resampled music may be located to facilitate partitioning the music into a plurality of segments.
In one embodiment, odd numbered segments may be used for RF excitation and slice selection gradients (z). These odd numbered segments may have zero amplitude in both phase (Y) and frequency (X) encoding directions. The even numbered segments may then be used for k-space encoding gradients. In one embodiment, the role of the even and odd numbered segments may be reversed. In one embodiment, subsets of music segments may be used for RF excitation and slice selection gradients (z) and other disjoint subsets of music segments may be used for k-space encoding gradients.
In one embodiment, encoding gradients may be solved for using an optimization. The optimization may be designed to satisfy scanner specific constraints with respect to maximum gradient amplitude and maximum slew rate. The optimization may also be designed to yield 0th moment compensation. The optimization may also be designed to generate sampling trajectories to cover N×N (e.g., 128×128) pixels in an Mmm2 (e.g., 300 mm2) field of view (FoV).
The optimization may be performed on, for example, a one dimensional waveform. Although the optimization may initially be performed on a one dimensional waveform, example apparatus and methods may seek to encode more than a single line in k-space. Therefore, in one embodiment, low frequency balanced trapezoidal gradients with a certain percentage (e.g., 10%) of the maximum amplitude of the music encoding gradients may be designed. The music encoding gradients and the low frequency gradients may then be rotated from TR to TR so that images have different spatial encodings without altering the sound of the music.
TRs for MRF acquisitions are inherently random because the length of the encoding gradients depends on the duration of the corresponding music segment. The gradient waveforms therefore produce k-space trajectories that are dependent on the music (e.g., song) from which they are derived. For example,
Example apparatus and methods were tested using in-vivo experiments. In one experiment, a total of five repetitions of the music sequence were made and 4,000 data points were acquired. The trajectories were rotated 111.2 degrees from TR to TR. The data was acquired in just five minutes. Other numbers of repetitions, numbers of data points, and rotations may be employed.
Under-sampled images were reconstructed using non-uniform fast Fourier transforms (NUFFT). Signal evolutions from the reconstructed under-sampled images were used to quantify T1, T2, M0, and off-resonance as described in Ma et al., Nature 495, 187-192 (14 Mar. 2013). White matter (WM), gray matter (GM), and cerebrospinal fluid (CSF) regions of interest were selected from the resultant T1 and T2 maps. The mean values of T1 and T2 obtained from the regions of interest were calculated and compared to known values.
The optimization can be solved and applied to one dimensional (1D) music waveforms. For two dimensional (2D) coverage, music segments or gradients may be rotated by a certain amount (e.g., 0.9 degrees) from TR to TR. Different rotation amounts may be employed in different examples. Also, rotations may be performed on less than a per TR basis. For three dimensional (3D) coverage, music segments or gradients may be rotated by applying 3D rotational angles. Different 3D rotational angles may be employed in different examples.
Example apparatus and methods may seek to have a zero total moment gradient for a TR. Therefore, a rewinding gradient may be added after the optimization of a waveform for a TR to compensate for the residual momentum from a music segment in a TR. In one embodiment, an additional compensating moment is added as a short gradient waveform at the end of the readout gradient according to:
ΣGrtr=−ΣGt.
This gradient may be kept short enough (e.g., 20 μs) to remain below the audible range.
In one embodiment, the gradient waveforms and thus the sound was generated by optimizing:
min(∥G−s∥2+λΣG+β∥K−K0∥2)
where G is a target gradient, s is a music segment, K is the vector of sampling points derived from the music segment s, K0 is the vector of equally distributed points between −Kmax and Kmax, and λ and β balance gradient fidelity, gradient refocusing, and trajectory coverage. K may be derived from s using, for example, K=
Zero total gradients may be desired. Optimizing the gradient may produce nearly zero gradients, but not exactly zero gradients. Therefore, to get even closer to an exactly zero gradient, a gradient moment may be added. In one embodiment, the optimization includes gradient moments:
min(∥G−s∥2+λΣG+β∥K−K0∥2)+Gm
In one embodiment, the gradient moments Gm may be, for example:
ΣGrtr=−ΣGt.
The gradient may be solved for in one dimension, and then rotations or other manipulations may be employed to retrieve additional information. For example, the gradient may be rotated to get 2D or even 3D information.
While rotations of an original gradient are described, other modified trajectories may be employed. For example, switched gradients orthogonal to music waveforms may be employed.
G
x
=G
r cos(m—dφ)sin(m—dθ)
G
y
=G
r sin(m—dφ)sin(m—dθ)
G
z
=G
r cos(m—dθ)
The following includes definitions of selected terms employed herein. The definitions include various examples and/or forms of components that fall within the scope of a term and that may be used for implementation. The examples are not intended to be limiting. Both singular and plural forms of terms may be within the definitions.
References to “one embodiment”, “an embodiment”, “one example”, “an example”, and so on, indicate that the embodiment(s) or example(s) so described may include a particular feature, structure, characteristic, property, element, or limitation, but that not every embodiment or example necessarily includes that particular feature, structure, characteristic, property, element or limitation. Furthermore, repeated use of the phrase “in one embodiment” does not necessarily refer to the same embodiment, though it may.
“Computer-readable storage medium”, as used herein, refers to a non-transitory medium that stores signals, instructions and/or data. A computer-readable medium may take forms, including, but not limited to, non-volatile media, and volatile media. Non-volatile media may include, for example, optical disks, magnetic disks, and so on. Volatile media may include, for example, semiconductor memories, dynamic memory, and so on. Common forms of a computer-readable medium may include, but are not limited to, a floppy disk, a flexible disk, a hard disk, a magnetic tape, other magnetic medium, an ASIC, a CD, other optical medium, a RAM, a ROM, a memory chip or card, a memory stick, and other media from which a computer, a processor or other electronic device can read.
“Logic”, as used herein, includes but is not limited to hardware, firmware, software in execution on a machine, and/or combinations of each to perform a function(s) or an action(s), and/or to cause a function or action from another logic, method, and/or system. Logic may include a software controlled microprocessor, a discrete logic (e.g., ASIC), an analog circuit, a digital circuit, a programmed logic device, a memory device containing instructions, and so on. Logic may include one or more gates, combinations of gates, or other circuit components. Where multiple logical logics are described, it may be possible to incorporate the multiple logical logics into one physical logic. Similarly, where a single logical logic is described, it may be possible to distribute that single logical logic between multiple physical logics.
An “operable connection”, or a connection by which entities are “operably connected”, is one in which signals, physical communications, and/or logical communications may be sent and/or received. An operable connection may include a physical interface, an electrical interface, and/or a data interface. An operable connection may include differing combinations of interfaces and/or connections sufficient to allow operable control. For example, two entities can be operably connected to communicate signals to each other directly or through one or more intermediate entities (e.g., processor, operating system, logic, software). Logical and/or physical communication channels can be used to create an operable connection.
“User”, as used herein, includes but is not limited to one or more persons, software, computers or other devices, or combinations of these.
Some portions of the detailed descriptions that follow are presented in terms of algorithms and symbolic representations of operations on data bits within a memory. These algorithmic descriptions and representations are used by those skilled in the art to convey the substance of their work to others. An algorithm, here and generally, is conceived to be a sequence of operations that produce a result. The operations may include physical manipulations of physical quantities. Usually, though not necessarily, the physical quantities take the form of electrical or magnetic signals capable of being stored, transferred, combined, compared, and otherwise manipulated in a logic, and so on. The physical manipulations create a concrete, tangible, useful, real-world result.
It has proven convenient at times, principally for reasons of common usage, to refer to these signals as bits, values, elements, symbols, characters, terms, numbers, and so on. It should be borne in mind, however, that these and similar terms are to be associated with the appropriate physical quantities and are merely convenient labels applied to these quantities. Unless specifically stated otherwise, it is appreciated that throughout the description, terms including processing, computing, determining, and so on, refer to actions and processes of a computer system, logic, processor, or similar electronic device that manipulates and transforms data represented as physical (electronic) quantities.
Example methods may be better appreciated with reference to flow diagrams. While for purposes of simplicity of explanation, the illustrated methodologies are shown and described as a series of blocks, it is to be appreciated that the methodologies are not limited by the order of the blocks, as some blocks can occur in different orders and/or concurrently with other blocks from that shown and described. Moreover, less than all the illustrated blocks may be required to implement an example methodology. Blocks may be combined or separated into multiple components. Furthermore, additional and/or alternative methodologies can employ additional, not illustrated blocks.
Method 1400 also includes, at 1420, producing, from the piece of encoded music or from the filtered or resampled music, an encoding gradient waveform for use with an MRF procedure. In one embodiment, producing the encoding gradient waveform includes optimizing:
min(∥G−s∥2+λΣG+β∥K−K0∥2)
In another embodiment, producing the encoding gradient waveform includes optimizing:
min(∥G−s∥2+λΣG+β∥K−K0∥2)+Gm
G is the target gradient, s is a portion of the piece of encoded music, K is the vector of sampling points derived from s, and K0 is the vector of equally distributed points between −Kmax and Kmax. Kmax is resolution/2/field of view. λ and β balance gradient fidelity, gradient refocusing, and trajectory coverage. In one embodiment, K is K=
Gm is a gradient moment that produces a zero net gradient. In one embodiment, GM is computed according to: ΣGrtr=−ΣHt, where Gr is a final target gradient, tr is the time index of the target gradient, H is the gradient strength of the moment that produces a zero net gradient, and t is the time at which the gradient is applied. Additional detail about how the encoding gradient waveform is produced in different embodiments is provided in connection with
Method 1400 also includes, at 1430, controlling an MR apparatus to perform the MRF procedure using the encoding gradient waveform. Performing the MRF procedure using the encoding gradient waveform causes the MR apparatus to produce music recognizable as the piece of encoded music. The music may replace the traditional loud knocking noises with pleasant acoustic sounds. Being “recognizable” means that a person who listened to the encoded music through, for example, a stereo or MP3 player and who listened to the acoustic sounds produced in the bore by the MR apparatus would understand that the two pieces of music were the same piece of music. Empirically, the acoustic waveform produced by playing the encoded music using a music player (e.g., stereo, MP3 player) and the acoustic waveform produced by the MR apparatus will match to within a threshold. The threshold may be, for example, to within ten percent. When viewed together on an oscilloscope, a viewer would identify overlap and similarities between the waveforms.
The encoding gradient waveform may be employed in MRF procedures that use different gradients to produce different trajectories. For example, the MRF procedure may use the encoding gradient waveform in a 2D radial trajectory or in a 3D radial trajectory. In one embodiment, the MRF procedure uses the encoding gradient waveform while switching gradients in an orthogonal direction. In another embodiment, the MRF procedure uses the encoding gradient waveform while shifting one of the encoding gradient waveforms in time. In yet another embodiment, the MRF procedure uses the encoding gradient waveform in a dual-filtered procedure.
Recall that MRF facilitates simultaneously quantifying more than one MR parameter. Thus, in one embodiment, the MRF procedure uses the encoding gradient waveform to simultaneously quantify T1, T2, M0, or off-resonance, where T1 is spin-lattice relaxation, T2 is spin-spin relaxation, and M0 is the default or natural alignment to which spins align when placed in the main magnetic field. Given the flexibility provided by MRF, in one embodiment, the MRF procedure uses the encoding gradient waveform with variable flip angles or variable repetition times.
MR apparatus are actual physical machines that have actual physical limitations. Therefore, in one embodiment, optimizing the encoding gradient waveform at 1423 may include controlling the amplitude of the encoding gradient waveform to be less than the maximum gradient amplitude of the MR apparatus, or controlling the slew rate required to produce the encoding gradient waveform to be less than the maximum gradient slew rate of the MR apparatus. Additionally, optimizing the encoding gradient waveform at 1423 may include establishing a sampling trajectory for the encoding gradient waveform that covers at least N×N pixels in an Mmm2 field of view. In one embodiment N may be 128 and M may be 300.
Method 1400 may also include, at 1424, rewinding the gradients. Rewinding the gradients may include, for example, adding an additional compensating moment as a short gradient waveform at the end of the readout gradient according to:
ΣGrtr=−ΣGt.
This gradient may be kept short enough (e.g., 20 μs) to remain below the audible range.
Method 1400 may also include, at 1425, rotating an encoding gradient waveform. To facilitate rotating an encoding gradient waveform, a low frequency balanced trapezoidal gradient having a first percentage (e.g., 10%) of the maximum amplitude of the encoding gradient waveform may be produced. Method 1400 may then rotate the encoding gradient waveform and the low frequency balanced trapezoidal gradient in different TRs of the MRF procedure to produce different spatial encodings to encode more than a single line in k-space. In one embodiment, the music segment associated with the encoding gradient waveform may be rotated to produce two dimensional encoding. In another embodiment, the music segment may be rotated by 0.9 degrees per repetition time in the MRF procedure. In yet another embodiment, a music segment associated with the encoding gradient waveform may be rotated to produce three dimensional encoding.
While
Apparatus 1600 also includes a second logic 1620 that produces an optimized encoding gradient from the encoding gradient. In one embodiment, the second logic 1620 optimizes the encoding gradient with respect to amplitude, slew rate, and trajectory associated with the MR apparatus. For example, the encoding gradient may be optimized to produce a zero net moment while staying within the bounds of the maximum gradient amplitude and slew rate. In one embodiment, the second logic 1620 partitions the encoding gradient into a plurality of portions as a function of zero crossings of the encoded music. The plurality of portions may be separated into, for example, even and odd numbered segments. The second logic 1620 may then employ a first subset of the plurality of portions for RF excitation and may employ a second, disjoint subset of the plurality of portions for k-space encoding gradients.
Apparatus 1600 also includes a third logic 1630 that controls an MR apparatus to apply the MRF pulse sequence. Applying the MRF pulse sequence causes the MR apparatus to produce music related to the piece of encoded music. For example, the music produced by applying the MRF pulse sequence will be recognizable to a listener of both pieces of music.
The apparatus 1800 includes a basic field magnet(s) 1810 and a basic field magnet supply 1820. Ideally, the basic field magnets 1810 would produce a uniform BO field. However, in practice, the BO field may not be uniform, and may vary over an object being analyzed by the MR apparatus 1800. MR apparatus 1800 may include gradient coils 1830 configured to emit gradient magnetic fields like GS, GP and GR. The gradient coils 1830 may be controlled, at least in part, by a gradient coils supply 1840. In some examples, the timing, strength, and orientation of the gradient magnetic fields may be controlled, and thus selectively adapted, during an MR procedure.
MR apparatus 1800 may include a set of RF antennas 1850 that generate RF pulses and that receive resulting NMR signals from an object to which the RF pulses are directed. In some examples, how the pulses are generated and how the resulting MR signals are received may be controlled and thus may be selectively adapted during an MR procedure. Separate RF transmission and reception coils can be employed. The RF antennas 1850 may be controlled, at least in part, by a set of RF transmission units 1860. An RF transmission unit 1860 may provide a signal to an RF antenna 1850.
The gradient coils supply 1840 and the RF transmission units 1860 may be controlled, at least in part, by a control computer 1870. In one example, the control computer 1870 may be programmed to control an NMR device as described herein. Conventionally, the MR signals received from the RF antennas 1850 can be employed to generate an image and thus may be subject to a transformation process like a two dimensional FFT that generates pixilated image data. The transformation can be performed by an image computer 1880 or other similar processing device. The image data may then be shown on a display 1890.
MRF facilitates not having to do conventional reconstruction of an image from MR signals received from the RF antennas 1850. Thus the RF energy applied to an object by apparatus 1800 need not be constrained to produce signals with substantially constant amplitudes or phases. Instead, system 1800 facilitates matching received signals to known signals for which a reconstruction, relaxation parameter, or other information is already available.
While
While example systems, methods, and so on have been illustrated by describing examples, and while the examples have been described in considerable detail, it is not the intention of the applicants to restrict or in any way limit the scope of the appended claims to such detail. It is, of course, not possible to describe every conceivable combination of components or methodologies for purposes of describing the systems, methods, and so on described herein. Therefore, the invention is not limited to the specific details, the representative apparatus, and illustrative examples shown and described. Thus, this application is intended to embrace alterations, modifications, and variations that fall within the scope of the appended claims.
To the extent that the term “includes” or “including” is employed in the detailed description or the claims, it is intended to be inclusive in a manner similar to the term “comprising” as that term is interpreted when employed as a transitional word in a claim.
To the extent that the term “or” is employed in the detailed description or claims (e.g., A or B) it is intended to mean “A or B or both”. When the applicants intend to indicate “only A or B but not both” then the term “only A or B but not both” will be employed. Thus, use of the term “or” herein is the inclusive, and not the exclusive use. See, Bryan A. Garner, A Dictionary of Modern Legal Usage 624 (2d. Ed. 1995).
To the extent that the phrase “one of, A, B, and C” is employed herein, (e.g., a data store configured to store one of, A, B, and C) it is intended to convey the set of possibilities A, B, and C, (e.g., the data store may store only A, only B, or only C). It is not intended to require one of A, one of B, and one of C. When the applicants intend to indicate “at least one of A, at least one of B, and at least one of C”, then the phrasing “at least one of A, at least one of B, and at least one of C” will be employed.
To the extent that the phrase “one or more of, A, B, and C” is employed herein, (e.g., a data store configured to store one or more of, A, B, and C) it is intended to convey the set of possibilities A, B, C, AB, AC, BC, ABC, AA . . . A, BB . . . B, CC . . . C, AA . . . ABB . . . B, AA . . . ACC . . . C, BB . . . BCC . . . C, or AA . . . ABB . . . BCC . . . C (e.g., the data store may store only A, only B, only C, A&B, A&C, B&C, A&B&C, or other combinations thereof including multiple instances of A, B, or C). It is not intended to require one of A, one of B, and one of C. When the applicants intend to indicate “at least one of A, at least one of B, and at least one of C”, then the phrasing “at least one of A, at least one of B, and at least one of C” will be employed.
The invention was developed with federal funding supplied under Federal Grant No 1RO1EB017219 provided by the NIH. The Federal Government has certain rights in the invention.