FAST EXPANSION INTO HARMONICS ON THE DISK: A STEERABLE BASIS WITH FAST RADIAL CONVOLUTIONS

Nicholas F Marshall1, Oscar Mickelin2, Amit Singer3

  • 1Department of Mathematics, Oregon State University, Corvallis, OR 97330 USA.

SIAM Journal on Scientific Computing : a Publication of the Society for Industrial and Applied Mathematics
|August 15, 2024
PubMed
Summary

We developed a Fast Disk Harmonics Transform (FDHT) for image analysis on disks. This method efficiently expands images in the Fourier-Bessel basis, enabling faster computations and image rotations.

Related Concept Videos

Curvilinear Motion: Rectangular Components01:23

Curvilinear Motion: Rectangular Components

Curvilinear motion characterizes the movement of a particle or object along a curved path, notably evident when envisioning a car navigating a winding road. If the car starts at point A, its position vector is established within a fixed frame of reference, where the ratio of the position vector to its magnitude signifies the unit vector pointing in the position vector's direction.
As the car advances, its position evolves over time. Quantifying the car's velocity involves computing the...
434
Convergence of Fourier Series01:21

Convergence of Fourier Series

The Fourier series is a powerful mathematical tool for representing periodic signals as an infinite sum of complex exponentials. In practice, this infinite series is truncated to a finite number of terms, yielding a partial sum. This truncation makes the approximation of the signal feasible but introduces certain challenges, particularly near discontinuities, known as the Gibbs phenomenon.
The Gibbs phenomenon refers to the persistent oscillations and overshoots that occur near discontinuities...
134
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...
290
Linear Approximation in Frequency Domain01:26

Linear Approximation in Frequency Domain

Linear systems are characterized by two main properties: superposition and homogeneity. Superposition allows the response to multiple inputs to be the sum of the responses to each individual input. Homogeneity ensures that scaling an input by a scalar results in the response being scaled by the same scalar.
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear....
88
Harmonic Mean01:09

Harmonic Mean

The arithmetic mean is usually skewed towards the larger values in the data set. Therefore, to avoid this inherent bias towards smaller values, the harmonic mean is used.
Take the example of the speed of a car, which is the measure of the rate of distance traveled. If the vehicle traverses the same distance back-and-forth, its average speed equals the total distance traveled divided by the total time taken. However, if the car moves with varying speeds, then the arithmetic mean is more skewed...
3.1K
Curvilinear Motion: Polar Coordinates01:27

Curvilinear Motion: Polar Coordinates

In polar coordinates, the motion of a particle follows a curvilinear path. The radial coordinate symbolized as 'r,' extends outward from a fixed origin to the particle, while the angular coordinate, 'θ,' measured in radians, represents the counterclockwise angle between a fixed reference line and the radial line connecting the origin to the particle.
The particle's location is described using a unit vector along the radial direction. Deriving the particle's position...
354