Related Experiment Video

Updated: Nov 14, 2025

Quantitative Optical Microscopy: Measurement of Cellular Biophysical Features with a Standard Optical Microscope
14:09

Quantitative Optical Microscopy: Measurement of Cellular Biophysical Features with a Standard Optical Microscope

Published on: April 7, 2014

15.9K

Improved algorithm for the quasi-discrete Hankel transform

Aleksey Malinka

    Journal of the Optical Society of America. A, Optics, Image Science, and Vision
    |March 10, 2021
    PubMed

    More Related Videos

    Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns13:44

    Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns

    Published on: August 30, 2013

    43.3K
    Digital Inline Holographic Microscopy DIHM of Weakly-scattering Subjects10:16

    Digital Inline Holographic Microscopy DIHM of Weakly-scattering Subjects

    Published on: February 8, 2014

    12.5K

    Related Concept Videos

    Routh-Hurwitz Criterion II01:19

    Routh-Hurwitz Criterion II

    In the application of the Routh-Hurwitz criterion, two specific scenarios can arise that complicate stability analysis.
    The first scenario occurs when a singular zero appears in the first column of the Routh table. This situation creates a division by zero issues. To resolve this, a small positive or negative number, denoted as epsilon (∈), is substituted for the zero. The stability analysis proceeds by assuming a sign for ∈. If ∈ is positive, any sign change in the first...
    606
    Inverse z-Transform by Partial Fraction Expansion01:20

    Inverse z-Transform by Partial Fraction Expansion

    The inverse z-transform is a crucial technique for converting a function from its z-domain representation back to the time domain. One effective method for finding the inverse z-transform is the Partial Fraction Method, which involves decomposing a function into simpler fractions with distinct coefficients. These fractions correspond to known z-transform pairs, facilitating the inverse transformation process.
    To begin the process, the poles of the function are identified and the function is...
    516
    Discrete-time Fourier transform01:26

    Discrete-time Fourier transform

    The Discrete-Time Fourier Transform (DTFT) is an essential mathematical tool for analyzing discrete-time signals, converting them from the time domain to the frequency domain. This transformation allows for examining the frequency components of discrete signals, providing insights into their spectral characteristics. In the DTFT, the continuous integral used in the continuous-time Fourier transform is replaced by a summation to accommodate the discrete nature of the signal.
    One of the notable...
    759
    Difference Equation Solution using z-Transform01:24

    Difference Equation Solution using z-Transform

    The z-transform is a powerful tool for analyzing practical discrete-time systems, often represented by linear difference equations. Solving a higher-order difference equation requires knowledge of the input signal and the initial conditions up to one term less than the order of the equation.
    The z-transform facilitates handling delayed signals by shifting the signal in the z-domain, which corresponds to delaying the signal in the time domain, and advancing signals by similarly shifting in the...
    483
    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...
    516
    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...
    413