Forensic face recognition based on KDE and evidence theory
Xiao Wen
MATEC Web of Conferences · 2021
doi:10.1051/matecconf/202133606008 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
Forensic face recognition (FFR) has been studied in recent years in forensic science. Given an automatic face recognition system, output scores of the system are used to describe the similarity of face image pairs, but not suitable for forensics. In this study, a score-mapping model based on kernel density estimation (KDE) and evidence theory is proposed. First, KDE was used to generate probability density function (PDF) for each dimensional feature vector of face image pairs. Then, the PDFs could be utilized to determine separately the basic probability assignment (BPA) of supporting the prosecution hypothesis and the defence hypothesis. Finally, the BPAs of each feature were combined by Dempster’s rule to get the final BPA, which reflects the strength of evidence support. The experimental results demonstrate that compared with the classic KDE-based likelihood ratio method, the proposed method has a better performance in terms of accuracy, sensitivity and specificity.
Abstract licence: CC BY
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.