Related Experiment Video
Updated: Feb 7, 2026
06:48
A Multimodal Wide-Field Fourier-Transform Raman Microscope
Published on: December 30, 2025
414
[Analysis and Design of Interference Imaging System in Fourier Transform Imaging Spectrometer Based on
Guang Pu Xue Yu Guang Pu Fen Xi = Guang Pu
|July 13, 2018
Summary
A novel static Fourier transform imaging spectrometer (FTIS) uses a multi-micro-mirror, eliminating moving parts for high-throughput spectral imaging. This design captures interferograms and object images simultaneously, advancing spectral analysis capabilities.
Area of Science:
- Optical Engineering
- Spectroscopy
- Imaging Technology
Background:
- Traditional Fourier transform imaging spectrometers (FTIS) often involve movable parts, limiting their static state and throughput.
- Achieving high-throughput and static operation is crucial for advanced spectral imaging applications.
Purpose of the Study:
- To introduce a novel temporal-spatial mixed modulated FTIS based on a multi-micro-mirror design.
- To enable simultaneous acquisition of interferograms and object images without movable parts or slits.
Main Methods:
- Interference system based on a Michelson interferometer with a multi-micro-mirror replacing the plane mirror.
- Fore-optics system for imaging objects onto the multi-micro-mirror, modulating optical path difference (OPD).
- Reimaging system to obtain object images at different interference orders and analysis of signal-to-noise ratio (SNR).
Main Results:
- The multi-micro-mirror FTIS achieves a static state and high throughput.
- Simultaneous acquisition of interferograms and object images is demonstrated.
- Optical path structures (telecentric in image space and double telecentric) were determined and designed to ensure OPD constancy and no extra OPD introduction.
Conclusions:
- The developed multi-micro-mirror FTIS offers a novel strategy for static and high-throughput spectral imaging.
- The design eliminates movable parts and slits, enhancing system performance and simplifying operation.
- This approach provides a significant advancement for applications requiring rapid and detailed spectral information.
More Related Videos
Related Concept Videos
01:10Fast Fourier Transform
957
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)log2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
The computational efficiency of the FFT becomes...
957
01:21Properties of Fourier Transform I
671
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...
In radio broadcasting, multiple audio signals often need to be transmitted simultaneously. The Fourier...
671
01:24Properties of Fourier Transform II
787
The Fourier Transform (FT) is an essential mathematical tool in signal processing, transforming a time-domain signal into its frequency-domain representation. This transformation elucidates the relationship between time and frequency domains through several properties, each revealing unique aspects of signal behavior.
The Frequency Shifting property of Fourier Transforms highlights that a shift in the frequency domain corresponds to a phase shift in the time domain. Mathematically, if x(t) has...
The Frequency Shifting property of Fourier Transforms highlights that a shift in the frequency domain corresponds to a phase shift in the time domain. Mathematically, if x(t) has...
787
01:15Discrete Fourier Transform
915
The Discrete Fourier Transform (DFT) is a fundamental tool in signal processing, extending the discrete-time Fourier transform by evaluating discrete signals at uniformly spaced frequency intervals. This transformation converts a finite sequence of time-domain samples into frequency components, each representing complex sinusoids ordered by frequency. The DFT translates these sequences into the frequency domain, effectively indicating the magnitude and phase of each frequency component present...
915
01:07Basic signals of Fourier Transform
957
The Fourier Transform is a pivotal mathematical tool in signal processing, enabling the transformation of time-domain signals into their frequency-domain representations. Among the numerous elements within this domain, certain functions like the sinc function, delta function, and exponential signals hold significant importance due to their unique properties and implications.
The sinc function, defined as sinc(x) = sin(πx)/(πx), is particularly notable for its symmetry and behavior at...
The sinc function, defined as sinc(x) = sin(πx)/(πx), is particularly notable for its symmetry and behavior at...
957
01:11Continuous -time Fourier Transform
921
The Fourier series is instrumental in representing periodic functions, offering a powerful method to decompose such functions into a sum of sinusoids. This technique, however, necessitates modification when applied to nonperiodic functions. Consider a pulse-train waveform consisting of a series of rectangular pulses. When these pulses have a finite period, they can be accurately represented by a Fourier series. Yet, as the period approaches infinity, resulting in a single, isolated pulse, the...
921