在频率和空间领域使用稀疏表示的移动异质面部识别
Asif Raza Butt1, Sajjad Manzoor1,2, Asim Baig3
1Department of Electrical Engineering, Mirpur University of Science and Technology, Mirpur, AJK, Pakistan.
PloS one
|October 4, 2024
概括
本研究介绍了空间稀疏表示 (SSR) 和频率稀疏表示 (FSR) 用于识别来自多个摄像机的异质面部图像. 这些新的方法在具有挑战性的监控场景中显示出卓越的性能.
科学领域:
- 计算机视觉 计算机视觉
- 图像处理 图像处理
- 生物识别信息 生物识别信息
背景情况:
- 由于在不同的光谱范围内运行的多个摄像头,监控系统面临异质探测图像的挑战.
- 在各种视觉和红外 (IR) 模式中识别人脸,特别是有限的数据 (每人单个样本 - SSPP) 是一个重大障碍.
研究的目的:
- 提出和评估两个新的方法,空间稀疏表示 (SSR) 和频率稀疏表示 (FSR),用于移动异质人脸识别.
- 在各种条件下评估这些方法的性能,包括不同的距离,面部图像大小和不同的视觉/红外线模式.
主要方法:
- 实现空间稀疏表示 (SSR) 和频率稀疏表示 (FSR) 以实现异质面部图像识别.
- 使用最小平方最小化方法,以高效地匹配面部图像.
- 使用SCface和CASIA NIR-VIS 2.0数据库对最先进的方法进行比较,包括PCA,KFA,CKE和LRPP-GRR.
主要成果:
- 拟议的SSR和FSR方法在识别异质面部图像方面表现出卓越的性能.
- 即使在距离,图像大小的变化以及在不同的视觉和红外光谱范围内,也可以实现有效的识别.
- 这些方法在具有挑战性的每人单个样本 (SSPP) 识别任务中被证明有效.
结论:
- 空间和频率稀疏表示为复杂的监控环境中移动异质人脸识别提供了强大的解决方案.
- 拟议的方法在现有技术上取得了重大进展,特别是在多式联运和SSPP面部识别方面的挑战.
相关概念视频
Linear Approximation in Frequency Domain
88
Linear systems are characterized by two main properties: superposition and homogeneity. Superposition allows the response to multiple inputs to be the sum of the responses to each individual input. Homogeneity ensures that scaling an input by a scalar results in the response being scaled by the same scalar.
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear....
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear....
88
IR Frequency Region: Fingerprint Region
794
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...
794
Discrete Fourier Transform
225
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...
225
Fast Fourier Transform
281
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...
281
Association Areas of the Cortex
5.1K
Association areas are regions of the cerebral cortex that do not have a specific sensory or motor function. Instead, they integrate and interpret information from various sources to enable higher cognitive processes such as memory, learning, and decision-making. Some key association areas include the following:
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,...
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,...
5.1K
Discrete-time Fourier transform
278
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...
One of the notable...
278


