Related Experiment Video
Updated: Jan 1, 2026

09:39
DNA Fingerprinting of Mycobacterium leprae Strains Using Variable Number Tandem Repeat VNTR - Fragment Length Analysis FLA
Published on: July 15, 2011
27.7K
Learning a Fixed-Length Fingerprint Representation
IEEE Transactions on Pattern Analysis and Machine Intelligence
|December 25, 2019
Summary
DeepPrint, a novel deep network, creates compact 200-byte fingerprint representations. This method enhances accuracy and speed for fingerprint matching, outperforming existing systems.
Area of Science:
- Biometrics
- Computer Vision
- Machine Learning
Background:
- Traditional fingerprint matching relies on variable-length minutiae representations.
- Minutiae-based methods face challenges with computational cost, security, and accuracy in low-quality prints.
Purpose of the Study:
- To introduce DeepPrint, a deep learning network for generating compact, fixed-length fingerprint representations.
- To demonstrate the advantages of DeepPrint over existing minutiae-based approaches.
Main Methods:
- Developed a deep network architecture incorporating fingerprint domain knowledge (alignment, minutiae detection).
- Extracted fixed-length fingerprint representations of 200 bytes.
- Benchmarked DeepPrint against commercial systems (Verifinger, Innovatrics) using NIST SD4 dataset.
Main Results:
- DeepPrint achieved comparable rank-1 accuracy (98.80%) to top commercial matchers on a large dataset.
- DeepPrint significantly reduced search time (0.3 seconds vs. 27 seconds).
- The compact representation offers improved security and discriminative power, especially for low-quality fingerprints.
Conclusions:
- DeepPrint provides the most compact and discriminative fixed-length fingerprint representation to date.
- The method offers a faster, more secure, and robust alternative for fingerprint identification.
Related Concept Videos
IR Frequency Region: Fingerprint Region
1.8K
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...
1.8K
Fast Fourier Transform
817
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)log2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
The computational efficiency of the FFT becomes...
817
Long-patch Base Excision Repair
7.8K
Since the discovery of the two BER pathways, there has been a debate about how a cell chooses one pathway over the other and the factors determining this selection. Numerous in vitro experiments have pointed out multiple determinants for the sub-pathway selection. These are:
7.8K

