Related Experiment Video
Updated: Feb 20, 2026

06:48
A Multimodal Wide-Field Fourier-Transform Raman Microscope
Published on: December 30, 2025
535
Hadamard single-pixel imaging versus Fourier single-pixel imaging
Optics Express
|October 19, 2017
Summary
Fourier single-pixel imaging (FSI) offers greater efficiency, while Hadamard single-pixel imaging (HSI) provides superior noise robustness. This comparison aids researchers in selecting the optimal single-pixel imaging technique for diverse applications.
Area of Science:
- Optics and Photonics
- Computational Imaging
- Signal Processing
Background:
- Single-pixel imaging (SPI) utilizes active illumination for spatial information acquisition, enabling non-visible wavelength and low-light imaging.
- Traditional SPI faced challenges with low reconstruction quality and extended data acquisition times.
- Hadamard single-pixel imaging (HSI) and Fourier single-pixel imaging (FSI) are deterministic model-based techniques that enhance SPI performance.
Purpose of the Study:
- To compare the performance of Hadamard single-pixel imaging (HSI) and Fourier single-pixel imaging (FSI).
- To provide theoretical analysis and experimental validation of HSI and FSI capabilities.
- To guide researchers in selecting appropriate single-pixel imaging techniques based on application requirements.
Main Methods:
- Theoretical analysis of HSI and FSI principles.
- Experimental implementation and data acquisition for both imaging techniques.
- Comparative performance evaluation based on reconstruction quality, efficiency, and noise robustness.
Main Results:
- Fourier single-pixel imaging (FSI) demonstrates higher imaging efficiency compared to HSI.
- Hadamard single-pixel imaging (HSI) exhibits greater robustness against noise.
- Both HSI and FSI significantly improve upon traditional single-pixel imaging limitations.
Conclusions:
- FSI is preferable for applications prioritizing speed and efficiency.
- HSI is recommended for scenarios requiring high noise tolerance.
- The findings offer practical guidance for optimizing single-pixel imaging system design.
Related Concept Videos
Fast Fourier Transform
1.0K
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...
1.0K
Properties of Fourier Transform II
814
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...
814
Super-resolution Fluorescence Microscopy
14.6K
Super-resolution fluorescence microscopy (SRFM) provides a better resolution than conventional fluorescence microscopy by reducing the point spread function (PSF). PSF is the light intensity distribution from a point that causes it to appear blurred. Due to PSF, each fluorescing point appears bigger than its actual size, and it is the PSF interference of nearby fluorophores that causes the blurred image. Various approaches to achieving higher resolution through SRFM have recently been...
14.6K
Continuous -time Fourier Transform
963
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...
963
Parseval's Theorem for Fourier transform
2.3K
Parseval's theorem is a fundamental principle in signal processing that enables the calculation of a signal's energy in either the time domain or the frequency domain. This theorem is pivotal in demonstrating energy conservation between these two domains, ensuring that the computed energy value remains consistent regardless of the domain of analysis.
To understand Parseval's theorem, it is essential to first comprehend how signal energy is typically calculated. When considering a...
To understand Parseval's theorem, it is essential to first comprehend how signal energy is typically calculated. When considering a...
2.3K

