Ton H. Akkermans
Philips
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Ton H. Akkermans.
IEEE Transactions on Information Forensics and Security | 2009
Haiyun Xu; Raymond N. J. Veldhuis; Asker M. Bazen; Tom A. M. Kevenaar; Ton H. Akkermans; Berk Gökberk
Most 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.
IEEE Systems Journal | 2009
Haiyun Xu; Raymond N. J. Veldhuis; Tom A. M. Kevenaar; Ton H. Akkermans
The spectral minutiae representation is a 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 as an input a fixed-length feature vector. Based on the spectral minutiae features, this paper introduces two feature reduction algorithms: the Column Principal Component Analysis and the Line Discrete Fourier Transform feature reductions, which can efficiently compress the template size with a reduction rate of 94%. With reduced features, we can also achieve a fast minutiae-based matching algorithm. This paper presents the performance of the spectral minutiae fingerprint recognition system and shows a matching speed with 125 000 comparisons per second on a PC with Intel Pentium D processor 2.80 GHz and 1 GB of RAM. This fast operation renders our system suitable as a preselector for a large-scale fingerprint identification system, thus significantly reducing the time to perform matching, especially in systems operating at geographical level (e.g., police patrolling) or in complex critical environments (e.g., airports).
conference on security steganography and watermarking of multimedia contents | 2006
Michiel van der Veen; Tom A. M. Kevenaar; Geert Jan Schrijen; Ton H. Akkermans; Fei Zuo
In recent literature, privacy protection technologies for biometric templates were proposed. Among these is the so-called helper-data system (HDS) based on reliable component selection. In this paper we integrate this approach with face biometrics such that we achieve a system in which the templates are privacy protected, and multiple templates can be derived from the same facial image for the purpose of template renewability. Extracting binary feature vectors forms an essential step in this process. Using the FERET and Caltech databases, we show that this quantization step does not significantly degrade the classification performance compared to, for example, traditional correlation-based classifiers. The binary feature vectors are integrated in the HDS leading to a privacy protected facial recognition algorithm with acceptable FAR and FRR, provided that the intra-class variation is sufficiently small. This suggests that a controlled enrollment procedure with a sufficient number of enrollment measurements is required.
Biometric Technology for Human Identification | 2004
Pim Tuyls; Evgeny Verbitskiy; T Tanya Ignatenko; Daniel Willem Elisabeth Schobben; Ton H. Akkermans
Unique Biometric Identifiers offer a very convenient way for human identification and authentication. In contrast to passwords they have hence the advantage that they can not be forgotten or lost. In order to set-up a biometric identification/authentication system, reference data have to be stored in a central database. As biometric identifiers are unique for a human being, the derived templates comprise unique, sensitive and therefore private information about a person. This is why many people are reluctant to accept a system based on biometric identification. Consequently, the stored templates have to be handled with care and protected against misuse [1, 2, 3, 4, 5, 6]. It is clear that techniques from cryptography can be used to achieve privacy. However, as biometric data are noisy, and cryptographic functions are by construction very sensitive to small changes in their input, and hence one can not apply those crypto techniques straightforwardly. In this paper we show the feasibility of the techniques developed in [5], [6] by applying them to experimental biometric data. As biometric identifier we have choosen the shape of the inner ear-canal, which is obtained by measuring the headphone-to-ear-canal Transfer Functions (HpTFs) which are known to be person dependent [7].
Control Engineering Practice | 2001
Ton H. Akkermans; Sorin G. Stan
Abstract This paper addresses the use of PID regulators to achieve some of the main control goals in an optical disc drive: (i) focusing of the laser spot on the disc surface, (ii) tracking the continuous data spiral during playback, and (iii) radially searching the target location on disc during an access procedure. The paper discusses the servo loops and a dedicated PID-based digital servo integrated circuit (DSIC) employed to perform the control tasks mentioned above.
european symposium on research in computer security | 2009
Ileana Buhan; Jeroen Breebaart; Jorge Guajardo; Koen de Groot; Emile Kelkboom; Ton H. Akkermans
Biometric information is regarded as highly sensitive information and therefore encryption techniques for biometric information are needed to address security and privacy requirements of biometric information. Most security analyses for these encryption techniques focus on the scenario of one user enrolled in a single biometric system. In practice, biometric systems are deployed at different places and the scenario of one user enrolled in many biometric systems is closer to reality. In this scenario, cross-matching (tracking users enrolled in multiple databases) becomes an important privacy threat. To prevent such cross-matching, various methods to create renewable and indistinguishable biometric references have been published. In this paper, we investigate the indistinguishability or the protection against cross-matching of a continuous-domain biometric cryptosystem, the QIM. In particular our contributions are as follows. Firstly, we present a technique, which allows an adversary to decide whether two protected biometric reference data come from the same person or not. Secondly, we quantify the probability of success of an adversary who plays the indistinguishability game and thirdly, we compare the probability of success of an adversary to the authentication performance of the biometric system for the MCYT fingerprint database. The results indicate that although biometric cryptosystems represent a step in the direction of privacy enhancement, we are not there yet.
international conference on biometrics | 2006
Ton H. Akkermans; Tom A. M. Kevenaar; Daniel Willem Elisabeth Schobben
We investigate how the acoustic properties of the pinna – i.e. the outer flap of the ear- and the ear canal can be used as a biometric. The acoustic properties can be measured relatively easy with an inexpensive sensor and feature vectors can be derived with little effort. Classification results for three platforms are given (headphone, earphone, mobile phone) using noise as an input signal. Furthermore, preliminary results are given for the mobile phone platform where we use music as an input signal. We achieve equal error rates in the order of 1%-5%, depending on the platform that is used to do the measurement.
IFAC Proceedings Volumes | 1998
Sorin G. Stan; Ton H. Akkermans; M Maarten Steinbuch; Meindert L. Norg
Abstract This paper presents an overview of the specific design issues related to the high- and very high-speed CD-ROM drives. The general architecture and key specifications of a CD-ROM system are briefly introduced and various aspects regarding the improvement of these specifications are considered. The strategies employed to control the turntable motor as well as to position the optical head(s) are discussed. The described control techniques and algorithms are specifically aimed to boost the performance of the CD-ROM drives, namely to increase their data throughput and decrease their access time.
IFAC Proceedings Volumes | 2000
Ton H. Akkermans; Sorin G. Stan
Abstract This paper addresses the use of PID regulators to achieve some of the main control goals in an optical disc drive: (i) focusing of the laser spot on the disc surface, (ii) tracking the continuous data spiral during playback, and (iii) radially searching the target location on disc during an access procedure. The servo loops employed to perform the control tasks mentioned above will be described and a dedicated PID-based digital servo integrated circuit (DSIC) will also be introduced.
Archive | 2006
Ton H. Akkermans; Daniel Willem Elisabeth Schobben