Wave field restoration using three-dimensional Fourier filtering method

T Kawasaki1, Y Takai, T Ikuta

  • 1Department of Material and Life Science, Graduate School of Engineering, Osaka University, Suita City, Japan. kawasaki@ap.eng.osaka-u.ac.jp

Ultramicroscopy
|January 17, 2002
PubMed

Related Concept Videos

Properties of Fourier Transform I01:21

Properties of Fourier Transform I

The application of Fourier Transform properties in radio broadcasting is multifaceted, enabling significant advancements in the way signals are transmitted and received. Key areas where these properties are utilized include simultaneous multi-channel transmission, audio clip speed adjustments, live broadcast delays for different time zones, audio frequency adjustments, and signal demodulation.
In radio broadcasting, multiple audio signals often need to be transmitted simultaneously. The Fourier...
Reconstruction of Signal using Interpolation01:10

Reconstruction of Signal using Interpolation

Signal processing techniques are essential for accurately converting continuous signals to digital formats and vice versa. When a continuous signal is sampled with a period T, the resulting sampled signal exhibits replicas of the original spectrum in the frequency domain, spaced at intervals equal to the sampling frequency. To handle this sampled signal, a zero-order hold method can be applied, which creates a piecewise constant signal by retaining each sample's value until the next sampling...
Propagation of Waves01:07

Propagation of Waves

When a wave propagates from one medium to another, part of it may get reflected in the first medium, and part of it may get transmitted to the second medium. In such a case, the interface of the two mediums can be considered as a boundary that is neither fixed nor free.
Consider a scenario where a wave propagates from a string of low linear mass density to a string of high linear mass density. In such a case, the reflected wave is out of phase with respect to the incident wave, however the...
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...
Uniform Depth Channel Flow: Problem Solving01:18

Uniform Depth Channel Flow: Problem Solving

To calculate the flow rate for a trapezoidal channel, first, identify the bottom width, side slope, and flow depth of the channel. The cross-sectional area (A) corresponding to the depth of flow (y), channel bottom width (B), and side slope (θ) is determined by:Next, calculate the wetted perimeter, which includes the bottom width and the sloped side lengths in contact with the water. Using the values of the cross-sectional area and the wetted perimeter, determine the hydraulic radius by...
Vector Forms of Green’s Theorem01:26

Vector Forms of Green’s Theorem

The study of fluid motion often involves understanding how local rotational behavior relates to global circulation. In the context of a pond with pollutants, direct measurement of water movement along an irregular shoreline can be impractical. Green’s Theorem in vector form provides an alternative by relating the circulation around a closed boundary to properties of the flow within the enclosed region.Measurements of water velocity at different points define a continuous vector field that...