Encrypted face recognition algorithm based on Ridgelet-DCT transform and THM chaos
Related Experiment Video
Updated: Oct 4, 2025

Author Spotlight: Assessment of Visual Acuity in Central Vision Loss Through Motion-Based Peripheral Vision Testing
Published on: February 23, 2024
Zilong Liu1,2, Jingbing Li1, Jing Liu3
1School of Information and Communication Engineering, Hainan University, Haikou 570228, China.
Abstract:
With the popularization and application of face recognition technology, a large number of face image data are spread and used on the Internet. It has brought great potential safety hazard for personal privacy. Combined with the characteristics of tent chaos and Henon chaos, a THM (tent-Henon map) chaotic encrypted face algorithm based on Ridgelet-DCT transform is proposed in this paper. Different from conventional face recognition methods, this new approach encryptes the face images by means of using the homomorphic encryption method to extract their visual robust features in the first place, and then uses the proposed neural network model to design the encrypted face recognition algorithm. This paper selects the ORL face database of Cambridge University to verify the algorithm. Experimental results show that the algorithm has a good performance in encryption effect, security and robustness, and has a broad application prospect.
More Related Videos
Related Concept Videos
Association Areas of the Cortex
Prefrontal Association Area: This area is located in the frontal lobe and is involved in planning, decision-making, and moderating social behavior. It connects with primary motor areas,...
Routh-Hurwitz Criterion II
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...
Region of Convergence of Laplace Tarnsform
Consider a decaying exponential signal that begins at a specific time. When deriving its Laplace transform, the time-domain variable is replaced with a complex variable. This...
Convolution: Math, Graphics, and Discrete Signals
To simplify the convolution integral, it is assumed that both the input signal and impulse response are zero for negative time values. The graphical convolution process...

