Fast quantitative 3D ultrashort echo time MRI of cortical bone using extended cones sampling

Lidi Wan1,2, Wei Zhao1, Yajun Ma1

  • 1Department of Radiology, University of California, San Diego, California.

Summary

Quantitative 3D ultrashort echo time (UTE) MRI biomarkers for cortical bone can be accurately measured with longer sampling windows. This accelerates scan times by 76% with minimal quantification errors.

Related Concept Videos

Echo01:06

Echo

The human ear cannot distinguish between two sources of sound if they happen to reach within a specific time interval, typically 0.1 seconds apart. More than this, and they are perceived as separate sources.
Imagine the sound is reflected back to the ears. Assuming that the source is very close to the human, the difference between hearing the two sounds—the emitted sound and the reflected sound—may be more than the minimum time for perceiving distinct sounds. If this is the case,...
952
Bone Marrow Sampling and Transplants01:22

Bone Marrow Sampling and Transplants

Bone marrow transplant is a potential cure for several diseases, including cancer and specific genetic disorders. Notably, this procedure is applicable for patients suffering from aplastic anemia, certain types of leukemia, severe combined immunodeficiency disease (SCID), Hodgkin's disease, non-Hodgkin's lymphoma, multiple myeloma, thalassemia, sickle-cell disease, and certain cancers.
The transplant begins with high doses of chemotherapy and radiation treatment, which aim to destroy...
1.1K
Sampling Continuous Time Signal01:11

Sampling Continuous Time Signal

In signal processing, a continuous-time signal can be sampled using an impulse-train sampling technique, followed by the zero-order hold method. Impulse-train sampling involves the use of a periodic impulse train, which consists of a series of delta functions spaced at regular intervals determined by the sampling period. When a continuous-time signal is multiplied by this impulse train, it generates impulses with amplitudes corresponding to the signal's values at the sampling points.
In the...
740
Fast Fourier Transform01:10

Fast Fourier Transform

The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
934
Gravitational Potential Energy for Extended Objects01:07

Gravitational Potential Energy for Extended Objects

Consider a system comprising several point masses. The coordinates of the center of mass for this system can be expressed as the summation of the product of each mass and its position vector divided by the total mass:
2.0K
Gene Evolution - Fast or Slow?02:05

Gene Evolution - Fast or Slow?

The genomes of eukaryotes are punctuated by long stretches of sequence which do not code for proteins or RNAs. Although some of these regions do contain crucial regulatory sequences, the vast majority of this DNA serves no known function. Typically, these regions of the genome are the ones in which the fastest change, in evolutionary terms, is observed, because there is typically little to no selection pressure acting on these regions to preserve their sequences.
In contrast, regions which code...
8.2K