Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Encoding spatial information: k-space & summary

Description

This lecture covers the encoding of spatial information in MRI through the scanning of k-space sequentially, explaining the phase encoding, sampling signals, artifacts, effects of incomplete sampling, and spatial encoding with gradients.

In MOOC

Fundamentals of Biomedical Imaging: Magnetic Resonance Imaging (MRI)

Official source

Quiz

Related concepts (28)

Fourier transform

In physics and mathematics, the Fourier transform (FT) is a transform that converts a function into a form that describes the frequencies present in the original function. The output of the transform is a complex-valued function of frequency. The term Fourier transform refers to both this complex-valued function and the mathematical operation. When a distinction needs to be made the Fourier transform is sometimes called the frequency domain representation of the original function.

Fourier series

A Fourier series (ˈfʊrieɪ,_-iər) is an expansion of a periodic function into a sum of trigonometric functions. The Fourier series is an example of a trigonometric series, but not all trigonometric series are Fourier series. By expressing a function as a sum of sines and cosines, many problems involving the function become easier to analyze because trigonometric functions are well understood. For example, Fourier series were first used by Joseph Fourier to find solutions to the heat equation.

Signal

In signal processing, a signal is a function that conveys information about a phenomenon. Any quantity that can vary over space or time can be used as a signal to share messages between observers. The IEEE Transactions on Signal Processing includes audio, video, speech, , sonar, and radar as examples of signals. A signal may also be defined as observable change in a quantity over space or time (a time series), even if it does not carry information.

Fourier analysis

In mathematics, Fourier analysis (ˈfʊrieɪ,_-iər) is the study of the way general functions may be represented or approximated by sums of simpler trigonometric functions. Fourier analysis grew from the study of Fourier series, and is named after Joseph Fourier, who showed that representing a function as a sum of trigonometric functions greatly simplifies the study of heat transfer. The subject of Fourier analysis encompasses a vast spectrum of mathematics.

Fourier inversion theorem

In mathematics, the Fourier inversion theorem says that for many types of functions it is possible to recover a function from its Fourier transform. Intuitively it may be viewed as the statement that if we know all frequency and phase information about a wave then we may reconstruct the original wave precisely. The theorem says that if we have a function satisfying certain conditions, and we use the convention for the Fourier transform that then In other words, the theorem says that This last equation is called the Fourier integral theorem.

Related lectures (34)

Signal Representations

Covers the properties of signal/data representations using Fourier transformations and matrices.

Signal Representation: Fourier Transforms

Covers the representation of signals using Fourier transforms and the properties of signal vectors.

Sampling and Reconstruction Theory

Covers the concepts of analog, discrete, and digital signals, sampling times, frequencies, and pulses.

Fourier Transform and Sampling

Covers the Fourier transform of sampled signals, reconstruction, and harmonic response.

Ewald Summation: Long-Range Interaction and Self-Interaction Correction