Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Discrete Fourier Transform01:15

Discrete Fourier Transform

1.2K
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...
1.2K
Discrete-time Fourier transform01:26

Discrete-time Fourier transform

1.4K
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...
1.4K
Discrete-Time Fourier Series01:20

Discrete-Time Fourier Series

897
The Discrete-Time Fourier Series (DTFS) is a fundamental concept in signal processing, serving as the discrete-time counterpart to the continuous-time Fourier series. It allows for the representation and analysis of discrete-time periodic signals in terms of their frequency components. Unlike its continuous counterpart, which utilizes integrals, the calculation of DTFS expansion coefficients involves summations due to the discrete nature of the signal.
For a discrete-time periodic signal x[n]...
897
Sign Test for Matched Pairs01:17

Sign Test for Matched Pairs

486
The sign test for matched pairs offers a robust method for comparing two paired samples, often for the effects of an intervention in one of them. This method is very useful in situations where the underlying distribution of the data is unknown. The test compares two related samples—often pre- and post-treatment measurements on the same subjects—to determine if there are significant differences in their median values.
To conduct the sign test, we first calculate the differences in...
486
Strategies of Self-Presentation II: Self-Verification01:17

Strategies of Self-Presentation II: Self-Verification

268
Self-verification is a fundamental psychological drive wherein individuals seek affirmation of their self-concept from others, striving for consistency between their internal self-view and external perceptions. This drive operates even when the self-concept is negative, influencing interpersonal behavior and feedback preferences in complex and often counterintuitive ways. Unlike the self-enhancement motive, which seeks positive evaluations, self-verification prioritizes coherence and...
268
Fast Fourier Transform01:10

Fast Fourier Transform

1.3K
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.3K

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Efficacy of balloon stent or oral estrogen for adhesion prevention in septate uterus: A randomized clinical trial.

Chinese medical journal·2025
Same author

Regional pollution and diet drive organohalogen contaminant accumulation in mangrove-settled spiders (Nephila pilipes).

Environmental pollution (Barking, Essex : 1987)·2025
Same author

Real-world efficacy and safety of azvudine in hospitalized older patients with COVID-19 during the omicron wave in China: A retrospective cohort study.

Acta pharmaceutica Sinica. B·2025
Same author

Nonadditive transcriptional change analysis identifies regulators for ginsenoside Rg3 to alleviate synergistic cytokine production in TLR2/3 dual-stimulated macrophages.

European journal of pharmacology·2025
Same author

Improving activity of GenB3 and GenB4 in gentamicin dideoxygenation biosynthesis by semi-rational engineering.

Microbial cell factories·2025
Same author

Characteristics of the smallest brucellaphage with strong lytic ability.

Frontiers in veterinary science·2025

Related Experiment Video

Updated: Apr 19, 2026

Proton Transfer and Protein Conformation Dynamics in Photosensitive Proteins by Time-resolved Step-scan Fourier-transform Infrared Spectroscopy
10:03

Proton Transfer and Protein Conformation Dynamics in Photosensitive Proteins by Time-resolved Step-scan Fourier-transform Infrared Spectroscopy

Published on: June 27, 2014

18.6K

Online Signature Verification Based on DCT and Sparse Representation.

Yishu Liu, Zhihua Yang, Lihua Yang

    IEEE Transactions on Cybernetics
    |December 23, 2014
    PubMed
    Summary

    This study introduces a new online signature verification method using discrete cosine transform (DCT) and sparse representation. The technique achieves reliable authentication with superior performance compared to existing methods.

    More Related Videos

    Author Spotlight: Assessment of Visual Acuity in Central Vision Loss Through Motion-Based Peripheral Vision Testing
    06:25

    Author Spotlight: Assessment of Visual Acuity in Central Vision Loss Through Motion-Based Peripheral Vision Testing

    Published on: February 23, 2024

    1.3K

    Related Experiment Videos

    Last Updated: Apr 19, 2026

    Proton Transfer and Protein Conformation Dynamics in Photosensitive Proteins by Time-resolved Step-scan Fourier-transform Infrared Spectroscopy
    10:03

    Proton Transfer and Protein Conformation Dynamics in Photosensitive Proteins by Time-resolved Step-scan Fourier-transform Infrared Spectroscopy

    Published on: June 27, 2014

    18.6K
    Author Spotlight: Assessment of Visual Acuity in Central Vision Loss Through Motion-Based Peripheral Vision Testing
    06:25

    Author Spotlight: Assessment of Visual Acuity in Central Vision Loss Through Motion-Based Peripheral Vision Testing

    Published on: February 23, 2024

    1.3K

    Area of Science:

    • Computer Science
    • Biometrics
    • Pattern Recognition

    Background:

    • Online signature verification is crucial for identity authentication.
    • Existing methods face challenges with time series of varying lengths.

    Purpose of the Study:

    • To propose a novel online signature verification technique.
    • To leverage discrete cosine transform (DCT) and sparse representation for enhanced accuracy.

    Main Methods:

    • A new DCT property is utilized for compact signature representation and energy feature extraction.
    • Sparse representation is applied with a novel task-specific dictionary construction for sparsity feature extraction.
    • Energy and sparsity features are concatenated into a comprehensive feature vector.

    Main Results:

    • The proposed method demonstrates reliable person authentication.
    • Experimental results on SUSIG-Visual and SVC2004 databases show superior verification performance over state-of-the-art techniques.

    Conclusions:

    • The combined DCT and sparse representation approach offers an effective solution for online signature verification.
    • The method provides a robust alternative for handling variable-length time series data in biometrics.