Italy

The non-intrusive nature and high accuracy of face recognition algorithms have led to their successful deployment across multiple applications ranging from border access to mobile unlocking and digital payments. However, their vulnerability against sophisticated and cost-effective presentation attack mediums raises essential questions regarding its reliability. In the literature, several presentation attack detection algorithms are presented; however, they are still far behind from reality. The major problem with existing work is the generalizability against multiple attacks both in the seen and unseen setting. The algorithms which are useful for one kind of attack (such as print) perform unsatisfactorily for another type of attack (such as silicone masks). In this research, we have proposed a deep learning-based network termed as \textit{MixNet} to detect presentation attacks in cross-database and unseen attack settings. The proposed algorithm utilizes state-of-the-art convolutional neural network architectures and learns the feature mapping for each attack category. Experiments are performed using multiple challenging face presentation attack databases such as SMAD and Spoof In the Wild (SiW-M) databases. Extensive experiments and comparison with existing state of the art algorithms show the effectiveness of the proposed algorithm.

ICPR 2020

MixNet for Generalized Face Presentation Attack Detection

print

replay

state of the art

face presentation attack detection

generalized algorithm

mask

ICPR 2020 is the premier international conference on Pattern Recognition, gathering leading researchers from around the world to present their latest achievements in Pattern Analysis and Recognition, applied Artificial Intelligence and Machine Learning. The topic of the year is " Putting Artificial intelligence to work on Patterns". 
For the first time, ICPR has employed a two-round review process similar to journal submissions, with new papers allowed to be submitted in either the first or second round and papers submitted in the first round and not accepted allowed to be revised and re-submitted for second round review. 

In this edition of the **ICPR 2020** Conference, there are 1407 Oral/Poster presentations organized in five Tracks: 
- Artificial Intelligence, Machine Learning for Pattern Analysis; 
- Biometrics, Human Analysis and Behavior Understanding; Computer Vision, Robotics and Intelligent Systems; 
- Document and Media Analysis; and 
- Image and Signal Processing. 

The **ICPR 2020** Main Conference program also includes 7 Keynotes from prominent world-renowned scientists, 8 Tutorials, 28 Demos, 8 Challenges, 2 Panels, as well as an Industry/Sponsor Exhibition. In addition, 41 Workshops on a range of important current and emerging research topics complete the ICPR 2020 program. 


poster

In my presentation, there are three main parts: background, literature and proposed method. My research work is about imbalanced data classification. The proposed method, oversampling the minority which is kind of data-level solutions to create balanced datasets. Motivated by the over-constraint and over-generation problems of traditional over-sampling solutions, I present my proposed method addressing these two problems accordingly.

Position-Aware Safe Boundary Interpolation Oversampling

—In this paper, we propose a dual memory model
inspired by neural science. Short-term memory processes the
data stream before integrating them into long-term memory,
which generalizes. The use case is learning the ability to recognize
handwriting. This begins with the learning of prototypical letters
. It continues throughout life and gives the individual the ability
to recognize increasingly varied handwriting. This second task
is achieved by incrementally training our dual-memory model.
We used a convolution network for encoding and random forests
as the memory model. Indeed, the latter have the advantage of
being easily enhanced to integrate new data and new classes.
Performances on the MNIST database are very encouraging
since they exceed 95% and the complexity of the model remains
reasonable

Dual-Memory Model for Incremental Learning:
The Handwriting Recognition Use Case



In this presentation, we will discuss the utilization of visual attention (saliency) for object detection and tracking and briefly summarise 1) How a visual attention map such as subjectness attention or saliency map and an objectness attention map can facilitate region proposal generation in a 2-stage object detector; 2) How a visual attention map can be used for tracking multiple objects using a sequential Monte Carlo probability hypothesis density (PHD) filter. The proposed neural network for simultaneously detect objects and generate objectness and subjectness maps to save computational power is also discussed in this presentation. The experiments are conducted on KITTI and DETRAC datasets. The use of visual attention and hierarchical features has shown a considerable improvement of ≈8% in object detection which effectively increased tracking performance by ≈4% on KITTIdataset.

Utilising Visual Attention Cues for Vehicle Detection and Tracking


Text segmentation, the task of dividing a document into sections, is often a prerequisite for performing additional natural language processing tasks. Existing text segmentation methods have typically been developed and tested using clean, narrative-style text with segments containing distinct topics. Here we consider a challenging text segmentation task: dividing newspaper marriage announcement lists into units of one announcement each. In many cases the information is not structured into sentences, and adjacent segments are not topically distinct from each other. In addition, the text of the announcements, which is derived from images of historical newspapers via optical character recognition, contains many typographical errors. As a result, these announcements are not amenable to segmentation with existing techniques. We present a novel deep learning-based model for segmenting such text and show that it significantly outperforms an existing state-of-the-art method on our task.

Segmenting Messy Text: Detecting Boundaries in Text Derived from Historical Newspaper Images


A Lite BERT (ALBERT) has been introduced to scale up deep bidirectional representation learning for natural languages. Due to the lack of pretrained ALBERT models for Korean language, the best available practice is the multilingual model or resorting back to the any other BERT-based model. In this paper, we develop and pretrain KoreALBERT, a monolingual ALBERT model specifically for Korean language understanding. We introduce a new training objective, namely Word Order Prediction (WOP), and use alongside the existing MLM and SOP criteria to the same architecture and model parameters. Despite having significantly fewer model parameters (thus, quicker to train), our pretrained KoreALBERT outperforms its BERT counterpart on 6 different NLU tasks. Consistent with the empirical results in English by Lan et al., KoreALBERT seems to improve downstream task performance involving multi-sentence encoding for Korean language. The pretrained KoreALBERT is publicly available to encourage research and application development for Korean NLP.

KoreALBERT: Pretraining a Lite BERT Model for Korean Language Understanding


VR sickness is one of the main reasons that hinder the growth of VR. Since the level of VR sickness is in proportion to the degree of motion in VR content, it would be benefitted if the level of VR sickness can be predicted based on VR contents. In this paper, we propose a novel method with perception prior and hybrid temporal features to predict the occurrence of VR sickness.

VR Sickness Assessment with Perception Prior and Hybrid Temporal Features

In this paper, we tackle the task of automatically analyzing 3D volumetric scans obtained from computed tomography(CT) devices. In particular, we address a particular task for which data is very limited: the segmentation of ancient Egyptian mummies CT scans.We aim at digitally unwrapping the mummy and identify different segments such as body, bandages and jewelry. The problem is complex because of the lack of annotated data for the different semantic regions to segment, thus discouraging the use of strongly supervised approaches. We, therefore, propose a weakly supervised and efficient interactive segmentation method to solve this challenging problem. After segmenting the wrapped mummy from its exterior region using histogram analysis and template matching, we first design a voxel distance measure to find an approximate solution for the body and bandage segments. Here, we use geodesic distances since voxel features as well as spatial relationship among voxels is incorporated in this measure. Next, we refine the solution using a GrabCut based segmentation together with a tracking method on the slices of the scan that assigns labels to different regions in the volume, using limited supervision in the form of scribbles drawn by the user. The efficiency of the proposed method is demonstrated using visualizations and validated through quantitative measures and qualitative unwrapping of the mummy

Weakly Supervised Geodesic Segmentation of Egyptian Mummy CT Scans

Obtaining a meaningful, interpretable yet compact representation of the immediate surroundings of an autonomous vehicle is paramount for effective operation as well as safety. This paper proposes a solution to this by representing semantically important objects from a top-down, ego-centric bird’s eye view. The novelty in this work is from formulating this problem as an adversarial learning task, tasking a generator model to produce bird’s eye view representations which are plausible enough to be mistaken as a ground truth sample. This is achieved by using a Wasserstein Generative Adversarial Network based model conditioned on object detections from monocular RGB images and the corresponding bounding boxes. Extensive experiments show our model is more robust to novel data compared to strictly supervised benchmark models, while being a fraction of the size of the next best.

DeepBEV: A Conditional Adversarial Network for Bird's Eye View Generation

Active learning emerged as an alternative to alleviate
the effort to label huge amount of data for data-hungry applications (such as image/video indexing and retrieval, autonomous
driving, etc.). The goal of active learning is to automatically select
a number of unlabeled samples for annotation (according to a
budget), based on an acquisition function, which indicates how
valuable a sample is for training the model. The learning loss
method is a task-agnostic approach which attaches a module
to learn to predict the target loss of unlabeled data, and
select data with the highest loss for labeling. In this work,
we follow this strategy but we define the acquisition function
as a learning to rank problem and rethink the structure of
the loss prediction module, using a simple but effective listwise
approach. Experimental results on four datasets demonstrate that
our method outperforms recent state-of-the-art active learning
approaches for both image classification and regression tasks.

Learning to Rank for Active Learning: A Listwise
Approach


This paper addresses the problem of selecting appearance features for multiple object tracking (MOT) in urban scenes. Over the years, a large number of features has been used for MOT. However, it is not clear whether some of them are better than others. Commonly used features are color histograms, histograms of oriented gradients, deep features from convolutional neural networks and re-identification (ReID) features. In this study, we assess how good these features are at discriminating objects enclosed by a bounding box in urban scene tracking scenarios. Several affinity measures, namely the L1, L2 and the Bhattacharyya distances, Rank-1 counts and the cosine similarity, are also assessed for their impact on the discriminative power of the features. Results on several datasets show that features from ReID networks are the best for discriminating instances from one another regardless of the quality of the detector. If a ReID model is not available, color histograms may be selected if the detector has a good recall and there are few occlusions; otherwise, deep features are more robust to detectors with lower recall.

Premium content

Downloads

Next from ICPR 2020

Position-Aware Safe Boundary Interpolation Oversampling

Similar lecture

Generalized Iris Presentation Attack Detection Algorithm under Cross-Database Settings