Demo Data from EDBT 2026 / reviewers in the wild / expert
George W. Quinn
dblp:55/9606
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 2014
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1Security and privacy · 1Graphics, computer vision, multimedia, augmented reality and games · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Network and information security
1 paper |
Biometric security · 100% | |
| Artificial intelligence
1 paper |
Face, body and person analysis · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computer vision › Face, body and person analysis
face recognition |
0.2 | 1 | 2014 | Double Trouble: Differentiating Identical Twins by Face Recognition · IEEE Trans. Inf. Forensics Secur. 2014 |
Biometric security
biometric recognition |
0.2 | 1 | 2014 | Double Trouble: Differentiating Identical Twins by Face Recognition · IEEE Trans. Inf. Forensics Secur. 2014 |
Biometric security
face recognition |
0.2 | 1 | 2014 | Double Trouble: Differentiating Identical Twins by Face Recognition · IEEE Trans. Inf. Forensics Secur. 2014 |
Computer vision › Face, body and person analysis › face recognition
illumination variation |
0.1 | 1 | 2014 | Double Trouble: Differentiating Identical Twins by Face Recognition · IEEE Trans. Inf. Forensics Secur. 2014 |
Methods — techniques the papers use, named apart from their topics
face recognition algorithms · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2014 | Double Trouble: Differentiating Identical Twins by Face RecognitionabstractFacial recognition algorithms should be able to operate even when similar-looking individuals are encountered, or even in the extreme case of identical twins. An experimental data set comprised of 17486 images from 126 pairs of identical twins (252 subjects) collected on the same day and 6864 images from 120 pairs of identical twins (240 subjects) with images taken a year later was used to measure the performance on seven different face recognition algorithms. Performance is reported for variations in illumination, expression, gender, and age for both the same day and cross-year image sets. Regardless of the conditions of image acquisition, distinguishing identical twins are significantly harder than distinguishing subjects who are not identical twins for all algorithms. Jeffrey R. Paone, Patrick J. Flynn, P. Jonathon Phillips, Kevin W. Bowyer, Richard W. Vorder Bruegge, Patrick Grother, George W. Quinn, Matthew Pruitt, Jason M. Grant |
IEEE Trans. Inf. Forensics Secur. | 7 |
| 2011 | Distinguishing identical twins by face recognitionabstractThe paper measures the ability of face recognition algorithms to distinguish between identical twin siblings. The experimental dataset consists of images taken of 126 pairs of identical twins (252 people) collected on the same day and 24 pairs of identical twins (48 people) with images collected one year apart. In terms of both the number of paris of twins and lapsed time between acquisitions, this is the most extensive investigation of face recognition performance on twins to date. Recognition experiments are conducted using three of the top submissions to the Multiple Biometric Evaluation (MBE) 2010 Still Face Track [1]. Performance results are reported for both same day and cross year matching. Performance results are broken out by lighting conditions (studio and outside); expression (neutral and smiling); gender and age. Confidence intervals were generated by a bootstrap method. This is the most detailed covariate analysis of face recognition of twins to date. P. Jonathon Phillips, Patrick J. Flynn, Kevin W. Bowyer, Richard W. Vorder Bruegge, Patrick Grother, George W. Quinn, Matthew Pruitt |
FG | 6 |