Wavelet transform as a processing tool in white-light interferometry

Related Concept Videos

Interference and Diffraction02:18

Interference and Diffraction

Interference is a characteristic phenomenon exhibited by waves. When two electromagnetic waves interact with their peaks and troughs coinciding, a resulting wave with enhanced amplitude is produced. This is known as constructive interference. In this case, the two waves interacting are in phase with each other.
Interference and Superposition of Waves01:07

Interference and Superposition of Waves

When two waves of the same nature occur in the same region simultaneously, they result in interference. Interference of waves implies that the net effect of the waves is the sum of the individual waves' effects. However, it does not imply that the individual waves affect the propagation of other waves.
Interference occurs in mechanical waves, such as sound waves, waves on a string, and surface water waves. Mechanical waves correspond to the physical displacement of particles. Hence,...
Phase Contrast and Differential Interference Contrast Microscopy01:26

Phase Contrast and Differential Interference Contrast Microscopy

Phase-Contrast Microscopes
In-phase-contrast microscopes, interference between light directly passing through a cell and light refracted by cellular components is used to create high-contrast, high-resolution images without staining. It is the oldest and simplest type of microscope that creates an image by altering the wavelengths of light rays passing through the specimen. Altered wavelength paths are created using an annular stop in the condenser. The annular stop produces a hollow cone of...
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...