相关实验视频

Updated: Jun 6, 2025

Digital Inline Holographic Microscopy DIHM of Weakly-scattering Subjects
10:16

Digital Inline Holographic Microscopy DIHM of Weakly-scattering Subjects

Published on: February 8, 2014

12.2K

即时-SFH:使用Perlin噪声的非代的稀疏里埃全息图

David Li1, Susmija Jabbireddy1, Yang Zhang2

  • 1Department of Computer Science, University of Maryland, College Park, MD 20742, USA.

Sensors (Basel, Switzerland)
|November 27, 2024
PubMed
概括

研究人员开发了一种更快的方法来创建用于增强 (AR) 和虚拟现实 (VR) 显示器的稀疏全息图. 这种非代技术显著加快了图像染速度,使实时全息内容成为可能.

关键词:
里埃全息图是福里埃全息图中的一个.珀林噪音是什么意思一个全息图,一个全息图.

更多相关视频

Compact Lens-less Digital Holographic Microscope for MEMS Inspection and Characterization10:28

Compact Lens-less Digital Holographic Microscope for MEMS Inspection and Characterization

Published on: July 5, 2016

10.2K
Quantifying Microorganisms at Low Concentrations Using Digital Holographic Microscopy DHM07:27

Quantifying Microorganisms at Low Concentrations Using Digital Holographic Microscopy DHM

Published on: November 1, 2017

10.3K

相关概念视频

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...
173
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...
270
Discrete Fourier Transform01:15

Discrete Fourier Transform

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...
219
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...
289
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...
877
Upsampling01:22

Upsampling

Managing signal sampling rates is essential in digital signal processing to maintain signal integrity. A decimated signal, characterized by a reduced frequency range due to its lower sampling rate, can be upsampled by inserting zeros between each sample. This upsampling process expands the original spectrum and introduces repeated spectral replicas at intervals dictated by the new Nyquist frequency. To refine this zero-inserted sequence, it is passed through a lowpass filter with a cutoff...
204