Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

IR Frequency Region: Fingerprint Region

IR Frequency Region: Fingerprint Region

IR spectra are divided into two main regions: the diagnostic region and the fingerprint region. The diagnostic region of the spectrum lies above 1500 cm−1. The absorptions resulting from single-bond vibrations of the N–H, C–H, and O–H stretch at higher wavenumbers and appear on the left side of the spectrum. The stretching absorptions of the C≡C and C≡N occur between 2100–2300 cm−1. In contrast, those arising from stretching absorptions of the...

Discrete Fourier Transform

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...

Fast Fourier Transform

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...

Properties of DTFT I

Properties of DTFT I

In signal processing, Discrete-Time Fourier Transforms (DTFTs) play a critical role in analyzing discrete-time signals in the frequency domain. Various properties of the DTFTs such as linearity, time-shifting, frequency-shifting, time reversal, conjugation, and time scaling help understand and manipulate these signals for different applications.
The linearity property of DTFTs is fundamental. If two discrete-time signals are multiplied by constants a and b respectively, and then combined to...

Discrete-time Fourier transform

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...

Discrete-Time Fourier Series

Discrete-Time Fourier Series

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]...

You might also read

Related Articles

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

Sort by

Same author

Provably lightweight and secure IoHT scheme with post-quantum cryptography and fog computing: A comprehensive scheme for healthcare system.

MethodsX·2025

See all related articles

Search research articles

Related Experiment Videos

Efficiency and Flexibility of Fingerprint Scheme Using Partial Encryption and Discrete Wavelet Transform to Verify

¹Computer Science Department, Education College for Pure Science, Basrah University, Basrah 61004, Iraq.

International Scholarly Research Notices

|June 30, 2016

Summary

This study introduces a novel fingerprint verification scheme using partial encryption and discrete wavelet transform. The method enhances security and efficiency for cloud-based biometric systems, overcoming spoof attacks and computational burdens.

Related Experiment Videos

Area of Science:

Computer Science
Biometrics
Image Processing

Background:

Digital image security is increasingly critical.
Fingerprint recognition is a key biometric verification method.
Cloud environments face security challenges from adversaries and spoof attacks.

Purpose of the Study:

To develop a secure and efficient fingerprint verification scheme for cloud environments.
To address limitations of traditional encryption and fingerprint recognition methods.
To propose a system resistant to spoof attacks and high computational loads.

Main Methods:

Employed partial encryption of user fingerprints.
Utilized discrete wavelet transform for feature extraction and verification.
Developed a novel scheme combining these techniques.

Main Results:

The proposed scheme overcomes limitations of traditional methods.
It reduces computational requirements for large-scale fingerprint image processing.
The system demonstrates resistance to known attacks and spoofing.

Conclusions:

The novel fingerprint verification scheme offers enhanced security and efficiency.
It provides a cost-effective solution for biometric verification in cloud settings.
Experimental results confirm good performance in user fingerprint verification.