Related Experiment Video

Updated: Jul 7, 2026

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

A fast, high-quality inverse halftoning algorithm for error diffused halftones

T D Kite1, N Damera-Venkata, B L Evans

  • 1The University of Texas, Austin, TX 78712-1084, USA. tomk@ap.com

IEEE Transactions on Image Processing : a Publication of the IEEE Signal Processing Society
|February 12, 2008
PubMed

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...
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 sampling...
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...
Linear Approximation in Frequency Domain01:26

Linear Approximation in Frequency Domain

Linear systems are characterized by two main properties: superposition and homogeneity. Superposition allows the response to multiple inputs to be the sum of the responses to each individual input. Homogeneity ensures that scaling an input by a scalar results in the response being scaled by the same scalar.
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear.
Derivatives of Inverse Trigonometric Functions01:30

Derivatives of Inverse Trigonometric Functions

A ship tracking an approaching aircraft relies on geometric measurements to find out the aircraft’s position relative to the observer. By measuring the slant distance to the aircraft and the angle of elevation, the horizontal and vertical components of the distance can be obtained using trigonometric relationships. This geometric approach provides a basis for analyzing how the observed angle changes as the aircraft moves closer to the ship.To examine the mathematical behavior of the angle of...
Downsampling01:20

Downsampling

When considering a sampled sequence with zero values between sampling instants, one can replace it by taking every N-th value of the sequence. At these integer multiples of N, the original and sampled sequences coincide. This process, known as decimation, involves extracting every N-th sample from a sequence, thereby creating a more efficient sequence.
The Fourier transform of the decimated sequence reveals a combination of scaled and shifted versions of the original spectrum. This...