This work summarises and reports the results of the second Presentation Attack Detection competition on ID cards. This new version includes new elements compared to the previous one. (1) An automatic evaluation platform was enabled for automatic benchmarking; (2) Two tracks were proposed in order to evaluate algorithms and datasets respectively; and (3) A new ID card dataset was shared with Track 1 teams to serve as the baseline dataset for the training and optimisation. The Hochschule Darmstadt, Fraunhofer-IGD, and Facephi company jointly organised this challenge. 20 teams were registered, and 74 submitted models were evaluated. For Track 1, the "Dragons" team reached first place with an Average Ranking and Equal Error rate (EER) of (AVRank) of 40.48% and 11.44% EER, respectively. For the more challenging approach in Track 2, the "Incode" team reached the best results with an AVRank of 14.76% and 6.36% EER, improving on the results of the first edition of 74.30% and 21.87% EER, respectively. These results suggest that PAD on ID cards is improving, but it is still a challenging problem related to the number of images, especially of bona fide images.

Face morphing attack detection is challenging and presents a concrete and severe threat to face verification systems. A reliable detection mechanism for such attacks, tested with a robust cross-dataset protocol and unknown morphing tools, is still a research challenge. This paper proposes a framework based on the Few-Shot-Learning approach that shares image information based on the Siamese network using triplet-semi-hard-loss to tackle the morphing attack detection and boost the learning classification process. This network compares a bona fide or potentially morphed image with triplets of morphing face images. Our results show that this new network clusters the morphed images and assigns them to the right classes to obtain a lower equal error rate in a cross-dataset scenario. Few-shot learning helps to boost the learning process by sharing only small image numbers from an unknown dataset. Experimental results using cross-datasets trained with FRGCv2 and tested with FERET datasets reduced the BPCER 10 from 43% to 4.91% using ResNet50. For the AMSL open-access dataset is reduced for MobileNetV2 from BPCER 10 of 31.50% to 2.02%. For the SDD open-access synthetic dataset, the BPCER 10 is reduced for MobileNetV2 from 21.37% to 1.96%.

Imagine a world where a copy of your face could trick the most advanced security systems. This isn’t science fiction; it’s a real challenge today. LivDet-Face is a competition that aims to advance the detection of attacks at the biometric sensor, known as Presentation Attack Detection (PAD). This international contest is a key benchmark in biometric security, offering an unbiased look at the latest innovations in face PAD and demonstrating progress over time in detecting and preventing sophisticated attacks. Through the International Joint Conference on Biometrics (IJCB) platform, LivDet-Face 2024 provides a standardized evaluation process, access to advanced Presentation Attack Instruments (PAI), and a comprehensive dataset of bona fide face images. The competition had two main categories: algorithms and systems. A total of sixteen algorithms and one system were submitted for this year’s competition. Anonymous submissions topped both image and video subcategories with an ACER of 4.93% and 4.13%, respectively. In the systems category, Team Dermalog, despite being the sole submission, achieved an impressive ACER of 3.12%.

This paper summarises the Competition on Presentation Attack Detection on ID Cards (PAD-IDCard) held at the 2024 International Joint Conference on Biometrics (IJCB 2024). The competition attracted a total of ten registered teams, both from academia and industry. In the end, the participating teams submitted five valid submissions, with eight models to be evaluated by the organisers. The competition presented an independent assessment of current state-of-the-art algorithms. Today, no independent evaluation on cross-dataset is available; therefore, this work determined the state-of-the-art on ID cards. To reach this goal, a sequestered test set and baseline algorithms were used to evaluate and compare all the proposals. The sequestered test dataset contains ID cards from four different countries. In summary, a team that chose to be "Anonymous" reached the best average ranking results of 74.80%, followed very closely by the "IDVC" team with 77.65%.

This paper presents a summary of the Competition on Face Presentation Attack Detection Based on Privacy-aware Synthetic Training Data (SynFacePAD 2023) held at the 2023 International Joint Conference on Biometrics (IJCB 2023). The competition attracted a total of 8 participating teams with valid submissions from academia and industry. The competition aimed to motivate and attract solutions that target detecting face presentation attacks while considering synthetic-based training data motivated by privacy, legal and ethical concerns associated with personal data. To achieve that, the training data used by the participants was limited to synthetic data provided by the organizers. The submitted solutions presented innovations and novel approaches that led to outperforming the considered baseline in the investigated benchmarks.

This paper describes the results of the 2023 edition of the “LivDet” series of iris presentation attack detection (PAD) competitions. New elements in this fifth competition include (1) GAN-generated iris images as a category of presentation attack instruments (PAI), and (2) an evaluation of human accuracy at detecting PAI as a reference benchmark. Clarkson University and the University of Notre Dame contributed image datasets for the competition, composed of samples representing seven different PAI categories, as well as baseline PAD algorithms. Fraunhofer IGD, Beijing University of Civil Engineering and Architecture, and Hochschule Darmstadt contributed results for a total of eight PAD algorithms to the competition. Accuracy results are analyzed by different PAI types, and compared to human accuracy. Overall, the Fraunhofer IGD algorithm, using an attention-based pixel-wise binary supervision network, showed the best-weighted accuracy results (average classification error rate of 37.31%), while the Beijing University of Civil Engineering and Architecture’s algorithm won when equal weights for each PAI were given (average classification rate of 22.15%). These results suggest that iris PAD is still a challenging problem.

MOTIVATION: Chromatin immunoprecipitation followed by deep sequencing (ChIP-Seq) is a widely used approach to study protein-DNA interactions. Often, the quantities of interest are the differential occupancies relative to controls, between genetic backgrounds, treatments, or combinations thereof. Current methods for differential occupancy of ChIP-Seq data rely however on binning or sliding window techniques, for which the choice of the window and bin sizes are subjective. RESULTS: Here, we present GenoGAM (Genome-wide Generalized Additive Model), which brings the well-established and flexible generalized additive models framework to genomic applications using a data parallelism strategy. We model ChIP-Seq read count frequencies as products of smooth functions along chromosomes. Smoothing parameters are objectively estimated from the data by cross-validation, eliminating ad hoc binning and windowing needed by current approaches. GenoGAM provides base-level and region-level significance testing for full factorial designs. Application to a ChIP-Seq dataset in yeast showed increased sensitivity over existing differential occupancy methods while controlling for type I error rate. By analyzing a set of DNA methylation data and illustrating an extension to a peak caller, we further demonstrate the potential of GenoGAM as a generic statistical modeling tool for genome-wide assays. AVAILABILITY AND IMPLEMENTATION: Software is available from Bioconductor: https://www.bioconductor.org/packages/release/bioc/html/GenoGAM.html . CONTACT: [email protected]. SUPPLEMENTARY INFORMATION: Supplementary information is available at Bioinformatics online.

Abstract Summary: Standard transcriptomics measures total cellular RNA levels. Our understanding of gene regulation would be greatly improved if we could measure RNA synthesis and decay rates on a genome-wide level. To that end, the Dynamic Transcriptome Analysis (DTA) method has been developed. DTA combines metabolic RNA labeling with standard transcriptomics to measure RNA synthesis and decay rates in a precise and non-perturbing manner. Here, we present the open source R/Bioconductor software package DTA. It implements all required bioinformatics steps that allow the accurate absolute quantification and comparison of RNA turnover. Availability: DTA is part of R/Bioconductor. To download and install DTA refer to http://bioconductor.org/packages/2.10/bioc/html/DTA.html Contact: [email protected]

Triggered by a market relevant application that involves making joint predictions of pedestrian and public transit flows in urban areas, we address the question of how to utilize hidden common cause relations among variables of interest in order to improve performance in the two related regression tasks. Specifically, we propose stacked Gaussian process learning, a meta-learning scheme in which a base Gaussian process is enhanced by adding the posterior covariance functions of other related tasks to its covariance function in a stage-wise optimization. The idea is that the stacked posterior covariances encode the hidden common causes among variables of interest that are shared across the related regression tasks. Stacked Gaussian process learning is efficient, capable of capturing shared common causes, and can be implemented with any kind of standard Gaussian process regression model such as sparse approximations and relational variants. Our experimental results on real-world data from the market relevant application show that stacked Gaussian processes learning can significantly improve prediction performance of a standard Gaussian process.

In this paper, we discuss an application of spatial data mining to predict pedestrian flow in extensive road networks using a large biased sample. Existing out-of-the-box techniques are not able to appropriately deal with its challenges and constraints, in particular with sample selection bias. For this purpose, we introduce s-knn-apriori, an efficient nearest neighbor based spatial mining algorithm that allows prior knowledge and deductive models to be included in a straightforward and easy way.

This paper presents a clustering approach which groups German municipalities according to mobility characteristics. As the number of measurements for nationwide mobility studies is usually restricted, this clustering provides a means to infer mobility information for locations without measurements based on values of their respective cluster representatives. Our approach considers local and global information, i.e. characteristics of municipalities as well as relationships between municipalities. We realize previous findings in urban geography by using techniques from graph theory and computer vision. Our clustering consists of a two-step model, which first extracts and condenses single mobility characteristics and subsequently combines the various features. We apply our model to all German municipalities between 10,000 and 50,000 inhabitants. The clustering has been successfully applied in practice for the inference of traffic frequencies.

While threads have become an accepted and standardized model for expressing concurrency and exploiting parallelism for the shared-memory model, debugging threads is still poorly supported. This paper identifies challenges in debugging threads and offers solutions to them. The contributions of this paper are threefold. First, an open interface for debugging as an extension to thread implementations is proposed. Second, extensions for thread-aware debugging are identified and implemented within the Gnu Debugger to provide additional features beyond the scope of existing debuggers. Third, an active debugging framework is proposed that includes a language-independent protocol to communicate between debugger and application via relational queries ensuring that the enhancements of the debugger are independent of actual thread implementations. Partial or complete implementations of the interface for debugging can be added to thread implementations to work in unison with the enhanced debugger without any modifications to the debugger itself. Sample implementations of the interface for debugging have shown its adequacy for user-level threads, kernel threads and mixed thread implementations while providing extended debugging functionality at improved efficiency and portability at the same time.