Imaging localized neuronal activity at fast time scales through biomechanics

Samuel Patz1,2, Daniel Fovargue3, Katharina Schregel1,2,4

  • 1Department of Radiology, Brigham and Women's Hospital, Boston, MA, USA.

Science Advances
|April 20, 2019
PubMed
Summary

This study introduces MR elastography for noninvasive in vivo imaging of fast neuronal processes. It reveals brain biomechanical changes at 100-ms timescales, advancing neuroscience research.

Related Concept Videos

pH Scale02:41

pH Scale

Hydronium and hydroxide ions are present both in pure water and in all aqueous solutions, and their concentrations are inversely proportional as determined by the ion product of water (Kw). The concentrations of these ions in a solution are often critical determinants of the solution’s properties and the chemical behaviors of its other solutes. Two different solutions can differ in their hydronium or hydroxide ion concentrations by a million, billion, or even trillion times. A common means of...
79.1K
Local Anesthetics: Chemistry and Structure-Activity Relationship01:30

Local Anesthetics: Chemistry and Structure-Activity Relationship

Local anesthetics (LAs) are drugs that induce a temporary loss of sensation in a limited body area, preventing pain. Cocaine was the first local anesthetic discovered in the late 19th century. Cocaine is a benzoic acid ester obtained from the leaves of coca shrubs and was often used for its psychotropic effects. Cocaine was first isolated in 1860 by Albert Niemann. Sigmund Freud studied the physiological actions of cocaine. Carl Koller later introduced it into clinical practice in 1884 as a...
6.5K
Scaling01:26

Scaling

In designing and analyzing filters, resonant circuits, or circuit analysis at large, working with standard element values like 1 ohm, 1 henry, or 1 farad can be convenient before scaling these values to more realistic figures. This approach is widely utilized by not employing realistic element values in numerous examples and problems; it simplifies mastering circuit analysis through convenient component values. The complexity of calculations is thereby reduced, with the understanding that...
582
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...
931
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.0K
Gene Evolution - Fast or Slow?02:05

Gene Evolution - Fast or Slow?

3.5K