Hadamard single-pixel imaging versus Fourier single-pixel imaging

Optics Express
|October 19, 2017
PubMed
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.

Related Concept Videos

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...
1.0K
Properties of Fourier Transform II01:24

Properties of Fourier Transform II

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...
814
Super-resolution Fluorescence Microscopy01:37

Super-resolution Fluorescence Microscopy

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 Transform01:11

Continuous -time Fourier Transform

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 transform01:15

Parseval's Theorem for Fourier transform

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...
2.3K