Related Experiment Video
Updated: Sep 4, 2025

11:01
SSVEP-based Experimental Procedure for Brain-Robot Interaction with Humanoid Robots
Published on: November 24, 2015
13.3K
VGG16-random fourier hybrid model for masked face recognition
1Department of Computer Science & Engineering Amrita School of Engineering, Coimbatore Amrita Vishwa Vidyapeetham, Coimbatore, India.
Summary
This study introduces a novel masked face recognition method using VGG-16 and facial feature extraction from the upper face. The approach enhances accuracy for recognizing individuals wearing masks, crucial for security systems.
Area of Science:
- Computer Science
- Artificial Intelligence
- Biometrics
Background:
- The COVID-19 pandemic necessitates mask-wearing, significantly impacting facial recognition system accuracy.
- Occlusion of facial features by masks poses challenges for existing recognition technologies.
Purpose of the Study:
- To develop and evaluate a robust method for masked face recognition.
- To address the accuracy degradation of facial recognition systems due to face masks.
Main Methods:
- A novel approach combining a cropping-based strategy focusing on the upper face (forehead and eyes) with an improved VGG-16 architecture.
- Utilizing transfer learning with VGG-16 for extracting discriminative features from un-occluded facial regions.
- Employing Random Fourier Feature extraction to reduce feature vector dimensionality and mitigate bias.
Main Results:
- The proposed method demonstrates superior performance in masked face recognition compared to state-of-the-art techniques.
- Experiments conducted on multiple benchmark datasets (Georgia Tech, HEAD POSE, Robotics Lab) validate the approach's effectiveness.
Conclusions:
- The developed masked face recognition system effectively overcomes challenges posed by facial occlusions.
- This research offers a significant advancement in maintaining the reliability of facial recognition technology in real-world scenarios involving mask usage.
More Related Videos
Related Concept Videos
Masking and Demasking Agents
2.6K
EDTA titrations may necessitate masking and demasking agents to temporarily protect a particular metal ion in a mixture from the EDTA reaction. These agents facilitate the sequential analysis of the metal ions by forming stable complexes with some—but not all—metal ions during certain steps.
There are many masking agents, such as cyanide, fluoride, triethanolamine, thiourea, and 2,3-bis(sulfanyl)propan-1-ol (formerly 2,3-dimercapto-1-propanol), with the masking agent chosen based on...
There are many masking agents, such as cyanide, fluoride, triethanolamine, thiourea, and 2,3-bis(sulfanyl)propan-1-ol (formerly 2,3-dimercapto-1-propanol), with the masking agent chosen based on...
2.6K
Facial Feedback Hypothesis
243
Charles Darwin proposed that facial expressions are an evolutionary adaptation for communication. He argued that these expressions are not influenced by culture but are universal across species. For example, a snarling expression with exposed teeth signals a threat in many animals, including humans. Darwin also suggested that displaying an emotion can intensify the feeling. Smiling, for example, could enhance one's sense of happiness. This idea laid the foundation for understanding the role...
243
IR Frequency Region: Fingerprint Region
1.1K
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.1K
Fast Fourier Transform
453
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...
453
Force Classification
1.5K
Forces play a crucial role in the study of physics and engineering. They are essential in describing the motion, behavior, and equilibrium of objects in the physical world. Forces can be classified based on their origin, type, and direction of action.
Contact and non-contact forces are two of the most widely used categories of forces. As the name suggests, contact forces require physical contact between two objects to act upon each other. Examples of contact forces include frictional,...
Contact and non-contact forces are two of the most widely used categories of forces. As the name suggests, contact forces require physical contact between two objects to act upon each other. Examples of contact forces include frictional,...
1.5K
Discrete Fourier Transform
395
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...
395

