Related Experiment Video

Updated: Dec 15, 2025

Microfluidic Platform with Multiplexed Electronic Detection for Spatial Tracking of Particles
11:54

Microfluidic Platform with Multiplexed Electronic Detection for Spatial Tracking of Particles

Published on: March 13, 2017

9.7K

Real-Time Interference Artifacts Suppression in Array of ToF Sensors

Jozef Volak1, Jakub Bajzik1, Silvia Janisova1

  • 1Department of Mechatronics and Electronics, University of Žilina, 010 26 Žilina, Slovakia.

Sensors (Basel, Switzerland)
|July 8, 2020
PubMed

Keywords:
3D imagingdepth sensorsinterference suppressionmulti-camera interference

More Related Videos

Time Multiplexing Super Resolving Technique for Imaging from a Moving Platform06:25

Time Multiplexing Super Resolving Technique for Imaging from a Moving Platform

Published on: February 12, 2014

8.7K
Protocol for the Evaluation of MRI Artifacts Caused by Metal Implants to Assess the Suitability of Implants and the Vulnerability of Pulse Sequences08:19

Protocol for the Evaluation of MRI Artifacts Caused by Metal Implants to Assess the Suitability of Implants and the Vulnerability of Pulse Sequences

Published on: May 17, 2018

10.2K

Related Concept Videos

Aliasing01:18

Aliasing

Accurate signal sampling and reconstruction are crucial in various signal-processing applications. A time-domain signal's spectrum can be revealed using its Fourier transform. When this signal is sampled at a specific frequency, it results in multiple scaled replicas of the original spectrum in the frequency domain. The spacing of these replicas is determined by the sampling frequency.
If the sampling frequency is below the Nyquist rate, these replicas overlap, preventing the original...
459
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...
608
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.
51.2K
Atomic Absorption Spectroscopy: Interference01:25

Atomic Absorption Spectroscopy: Interference

Interference leads to systematic error in atomic absorption (AA) measurements by enhancing or diminishing the analytical signal or the background. These interferences can be grouped into three main categories: spectral interference, chemical interference, and physical interference.
Spectral interference occurs when signals from other elements or molecules overlap with the analyte signal, falsely elevating or masking the analyte's absorbance. This interference can be corrected using Zeeman,...
1.8K
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...
713
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...
742