Marta Gomez-Barrero

Prof. Marta Gomez-Barrero

Fakultät Wirtschaft, Hochschule Ansbach, 91522 Ansbach, Germany
orcid

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 December 2017 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
MGMarta Gomez-Barrero
Marta Gomez-Barrero
Javier GalballyJavier Galbally
Javier Galbally
CRChristian Rathgeb
Christian Rathgeb
CBChristoph Busch
Christoph Busch
The wide deployment of biometric recognition systems in the last two decades has raised privacy concerns regarding the storage and use of biometric data. As a consequence, the ISO/IEC 24745 international standard on biometric information protection has established two main requirements for protecting biometric templates: irreversibility and unlinkability. Numerous efforts have been directed to the development and analysis of irreversible templates. However, there is still no systematic quantitative manner to analyze the unlinkability of such templates. In this paper, we address this shortcoming by proposing a new general framework for the evaluation of biometric templates' unlinkability. To illustrate the potential of the approach, it is applied to assess the unlinkability of the four state-of-the-art techniques for biometric template protection: biometric salting, bloom filters, homomorphic encryption, and block re-mapping. For the last technique, the proposed framework is compared with other existing metrics to show its advantages.

1 July 2017 in Pattern Recognition
Verified
Journal Article
Closed access
MGMarta Gomez-Barrero
Marta Gomez-Barrero
EMEmanuele Maiorana
Emanuele Maiorana
Javier GalballyJavier Galbally
Javier Galbally
PCPatrizio Campisi
Patrizio Campisi
JFJulian Fierrez
Julian Fierrez

1 November 2019 in Computer Speech & Language
Verified
Journal Article
Open access
ANAndreas Nautsch
Andreas Nautsch
AJAbelino Jiménez
Abelino Jiménez
ATAmos Treiber
Amos Treiber
JKJascha Kolberg
Jascha Kolberg
CJCatherine Jasserand
Catherine Jasserand
CBChristoph Busch
Christoph Busch

1 October 2013 in Computer Vision and Image Understanding
Verified
Journal Article
Open access
Javier GalballyJavier Galbally
Javier Galbally
ARArun Ross
Arun Ross
MGMarta Gomez-Barrero
Marta Gomez-Barrero
JFJulian Fierrez
Julian Fierrez
JOJavier Ortega-Garcia
Javier Ortega-Garcia
This is the author’s version of a work that was accepted for publication in Computer Vision and Image Understanding. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Computer Vision and Image Understanding, 117, 10, (2013) DOI: 10.1016/j.cviu.2013.06.003A binary iriscode is a very compact representation of an iris image. For a long time it was assumed that the iriscode did not contain enough information to allow for the reconstruction of the original iris. The present work proposes a novel probabilistic approach based on genetic algorithms to reconstruct iris images from binary templates and analyzes the similarity between the reconstructed synthetic iris image and the original one. The performance of the reconstruction technique is assessed by empirically estimating the probability of successfully matching the synthesized iris image against its true counterpart using a commercial matcher. The experimental results indicate that the reconstructed images look reasonably realistic. While a human expert may not be easily deceived by them, they can successfully deceive a commercial matcher. Furthermore, since the proposed methodology is able to synthesize multiple iris images from a single iriscode, it has other potential applications including privacy enhancement of iris-based systems.This work has been partially supported by projects Contexts (S2009/TIC-1485) from CAM, Bio-Challenge (TEC2009-11186) and Bio-Shield (TEC2012-34881) from Spanish MECD, TABULA RASA (FP7-ICT-257289) and BEAT (FP7-SEC-284989) from EU, and Cátedra UAM-Telefónica

1 September 2015 in Pattern Recognition
Verified
Journal Article
Open access
Javier GalballyJavier Galbally
Javier Galbally
MDMoises Diaz
Moises Diaz
Miguel FerrerMiguel Ferrer
Miguel Ferrer
MGMarta Gomez-Barrero
Marta Gomez-Barrero
AMAythami Morales
Aythami Morales
JFJulian Fierrez
Julian Fierrez
This is the author’s version of a work that was accepted for publication in Pattern Recognition . Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Pattern Recognition , 48, 9 (2005) DOI: 10.1016/j.patcog.2015.03.019On-line signature verification still remains a challenging task within biometrics. Due to their behavioral nature (opposed to anatomic biometric traits), signatures present a notable variability even between successive realizations. This leads to higher error rates than other largely used modalities such as iris or fingerprints and is one of the main reasons for the relatively slow deployment of this technology. As a step towards the improvement of signature recognition accuracy, the present paper explores and evaluates a novel approach that takes advantage of the performance boost that can be reached through the fusion of on-line and off-line signatures. In order to exploit the complementarity of the two modalities, we propose a method for the generation of enhanced synthetic static samples from on-line data. Such synthetic off-line signatures are used on a new on-line signature recognition architecture based on the combination of both types of data: real on-line samples and artificial off-line signatures synthesized from the real data. The new on-line recognition approach is evaluated on a public benchmark containing both real versions (on-line and off-line) of the exact same signatures. Different findings and conclusions are drawn regarding the discriminative power of on-line and off-line signatures and of their potential combination both in the random and skilled impostors scenarios.M. D.-C. is supported by a PhD fellowship from the ULPGC and M.G.-B. is supported by a FPU fellowship from the Spanish MECD. This work has been partially supported by projects: MCINN TEC2012-38630- C04-02, Bio-Shield (TEC2012-34881) from Spanish MINECO, BEAT (FP7-SEC-284989) from EU, CECABANK and Cátedra UAM-Telefónic

2 November 2020 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Open access
KRKiran Raja
Kiran Raja
MFMatteo Ferrara
Matteo Ferrara
AFAnnalisa Franco
Annalisa Franco
LSLuuk Spreeuwers
Luuk Spreeuwers
IBIlias Batskos
Ilias Batskos
CBChristoph Busch
Christoph Busch
Morphing attacks have posed a severe threat to Face Recognition System (FRS). Despite the number of advancements reported in recent works, we note serious open issues such as independent benchmarking, generalizability challenges and considerations to age, gender, ethnicity that are inadequately addressed. Morphing Attack Detection (MAD) algorithms often are prone to generalization challenges as they are database dependent. The existing databases, mostly of semi-public nature, lack in diversity in terms of ethnicity, various morphing process and post-processing pipelines. Further, they do not reflect a realistic operational scenario for Automated Border Control (ABC) and do not provide a basis to test MAD on unseen data, in order to benchmark the robustness of algorithms. In this work, we present a new sequestered dataset for facilitating the advancements of MAD where the algorithms can be tested on unseen data in an effort to better generalize. The newly constructed dataset consists of facial images from 150 subjects from various ethnicities, age-groups and both genders. In order to challenge the existing MAD algorithms, the morphed images are with careful subject pre-selection created from the contributing images, and further post-processed to remove morphing artifacts. The images are also printed and scanned to remove all digital cues and to simulate a realistic challenge for MAD algorithms. Further, we present a new online evaluation platform to test algorithms on sequestered data. With the platform we can benchmark the morph detection performance and study the generalization ability. This work also presents a detailed analysis on various subsets of sequestered data and outlines open challenges for future directions in MAD research.