Demo Data from SIGIR 2026 / reviewers in the wild / expert
Anton H. M. Akkermans
dblp:40/3798 · also Ton H. Akkermans
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 2009
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 1Applied, interdisciplinary, general and emerging computing · 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% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Biometric security
fingerprint recognition |
0.1 | 1 | 2009 | Fingerprint verification using spectral minutiae representations · IEEE Trans. Inf. Forensics Secur. 2009 |
Biometric security › fingerprint recognition
fingerprint verification |
0.1 | 1 | 2009 | Fingerprint verification using spectral minutiae representations · IEEE Trans. Inf. Forensics Secur. 2009 |
Biometric security
biometric template protection |
0.0 | 1 | 2009 | Fingerprint verification using spectral minutiae representations · IEEE Trans. Inf. Forensics Secur. 2009 |
Methods — techniques the papers use, named apart from their topics
spectral minutiae representation · 0.1fusion · 0.1correlation-based matching · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2009 | Fingerprint verification using spectral minutiae representationsabstractMost fingerprint recognition systems are based on the use of a minutiae set, which is an unordered collection of minutiae locations and orientations suffering from various deformations such as translation, rotation, and scaling. The spectral minutiae representation introduced in this paper is a novel method to represent a minutiae set as a fixed-length feature vector, which is invariant to translation, and in which rotation and scaling become translations, so that they can be easily compensated for. These characteristics enable the combination of fingerprint recognition systems with template protection schemes that require a fixed-length feature vector. This paper introduces the concept of algorithms for two representation methods: the location-based spectral minutiae representation and the orientation-based spectral minutiae representation. Both algorithms are evaluated using two correlation-based spectral minutiae matching algorithms. We present the performance of our algorithms on three fingerprint databases. We also show how the performance can be improved by using a fusion scheme and singular points. Haiyun Xu, Raymond N. J. Veldhuis, Asker M. Bazen, Tom A. M. Kevenaar, Anton H. M. Akkermans, Berk Gökberk |
IEEE Trans. Inf. Forensics Secur. | 5 |
| 2004 | An information theoretic model for physical uncloneable functionsabstractA "physical uncloneable function" (PUF) is a function that is realized by a physical system, such that the function is easy to evaluate but the physical system is hard to characterize. PUFs were introduced as a cost-effective way of generating secure keys for cryptographic purposes. A PUF is a physical system designed such that it interacts in a complicated way with stimuli (challenges) and leads to unique but unpredictable responses. A PUF is similar to a keyed hash function. The key is the physical system consisting of many "random" components. Pim Tuyls, Boris Skoric, S. Stallinga, Anton H. M. Akkermans, W. Ophey |
ISIT | 4 |