Fusion of audio and video information for multi modal person authentication
We present an algorithm functioning as a supervisor module in a multi-expert decision making machine. It uses the Bayes theory in order to estimate the biases of individual expert opinions. The biases are used to calibrate and conciliate expert opinions to a single decision. This supervision technique is applied to the real case of a person authentication technique using two modalities, face and speech. The visual part involves the matching of a coarse grid containing Gabor phase information from face images. The acoustic part is performed by a text-dependent speaker verification system based on Hidden Markov Models. Experimental results show that the proposed fusion method improves the quality of individual expert decisions by reaching success rates of 99.5%.

title: Face authentication with Gabor information on deformable graphs
abstract: Elastic graph matching has been proposed as a practical implementation of dynamic link matching, which is a neural network with dynamically evolving links between a reference model and an input image. Each node of the graph contains features that characterize the neighborhood of its location in the image. The elastic graph matching usually consists of two consecutive steps, namely a matching with a rigid grid, followed by a deformation of the grid, which is actually the elastic part. The deformation step is introduced in order to allow for some deformation, rotation, and scaling of the object to be matched. This method is applied here to the authentication of human faces where candidates claim an identity that is to be checked. The matching error as originally suggested is not powerful enough to provide satisfying results in this case. We introduce an automatic weighting of the nodes according to their significance. We also explore the significance of the elastic deformation for an application of face-based person authentication. We compare performance results obtained with and without the second matching step. Results show that the deformation step slightly increases the performance, but has lower influence than the weighting of the nodes. The best results are obtained with the combination of both aspects. The results provided by the proposed method compare favorably with two methods that require a prior geometric face normalization, namely the synergetic and eigenface approaches.

title: Expert Conciliation for Multi Modal Person Authentication Systems by Bayesian Statistics
abstract: We present an algorithm functioning as a supervisor module in a multi expert decision making machine. It uses the Bayes theory in order to estimate the biases of individual expert opinions. These are then used to calibrate and conciliate expert opinions to one opinion. We present a framework for simulating decision strategies using expert opinions whose properties are easily modifiable. By using real data coming from a person authentication system using image and speech data we were able to confirm that the proposed supervisor improves the quality of individual expert decisions by reaching success rates of 99.5 %.

title: Shape Normalisaiton for Face Recognition
abstract: This paper presents methods for shape normalisation of face images. Localisation and shape normalisation are prerequisites for face recognition algorithms like the eigenface approach. Other established face recognition methods like labeled graph matching can also be accelerated by providing normalised face image databases.

title: Person Authentication by Fusing Face and Speech Information
abstract: vision Reference EPFL-CONF-82406 Record created on 2006-03-10, modified on 2017-05-10

title: Face Authentication Using Morphological Dynamic Link Architecture
abstract: A very attractive approach for face detection is based on multiresolution images (also known as mosaic images). Motivated by the simplicity of this approach, a rule-based face detection algorithm in frontal views is developed first. Second, a novel dynamic link architecture based on multiscale morphological dilation-erosion is proposed for face authentication. More specifically, a sparse grid is placed over the outcome of face detection stage for each person in a reference set. Subsequently, multiscale morphological operations are employed to yield a feature vector at each node of the grid and dynamic link matching is applied to verify the identity of each person from a test set. The first experimental results reported in this paper verify the superiority of the proposed method over the (standard) dynamic link matching that is based on Gabor wavelets.

title: Identification of Diatoms by Grid Graph Matching
abstract: Diatoms are unicellular algae found in water and other places wherever there is humidity and enough light for photo synthesis. In this paper a graph matching based identification approach for the retrieval of diatoms from an image database is presented. The retrieval is based on the matching of labeled grid graphs carrying texture information of the underlying diatom. A grid graph is a regular, rectangular arrangement of nodes overlaid on an image. Each node of the graph is labeled with texture features describing a rectangular sub-region of the object. Properties of gray level co-occurrence matrices as well as of Gabor wavelets are used as texture features. The method has been evaluated on a diatom database holding images of 188 different diatoms belonging to 38 classes. For the identification of these diatoms recognition rates of more than 90 percent were obtained.

title: Chosen IV Statistical Analysis for Key Recovery Attacks on Stream Ciphers
abstract: A recent framework for chosen IV statistical distinguishing analysis of stream ciphers is exploited and formalized to provide new methods for key recovery attacks. As an application, a key recovery attack on simplified versions of two eSTREAM Phase 3 candidates is given: For Grain-128 with IV initialization reduced to up to 180 of its 256 iterations, and for Trivium with IV initialization reduced to up to 672 of its 1152 iterations, it is experimentally demonstrated how to deduce a few key bits. Evidence is given that the present analysis is not applicable on Grain-128 or Trivium with full IV initialization.

title: Reduced Complexity Attacks on the Alternating Step Generator
abstract: In this paper, we present some reduced complexity attacks on the Alternating Step Generator (ASG). The attacks are based on a quite general framework and mostly benefit from the low sampling resistance of the ASG, and of an abnormal behavior related to the distribution of the initial states of the stop/go LFSR's which produce a given segment of the output sequence. Our results compare well with previous results as they show a greater flexibility with regard to known output of the ASG, which amounts in reduced complexity. We will also give a closed form for the complexity of attacks on ASG (and SG) as presented in .

title: Symmetry based indexing of diatoms in an image database
abstract: We introduce several methods for symmetry detection and present results of their experimental evaluation on diatom images. The methods are based on distance lists, cyclic string matching, and gray level gradient direction histograms. From the experimental results it can be concluded that symmetry information is useful for various indexing tasks in image databases. Types of symmetry considered in this paper are rotational and reflectional symmetry of the shape as well as symmetry of the gray level distribution of the internal structure of objects. Using the symmetry based indexing scheme proposed, the effort for the subsequent task of diatom classification can significantly be reduced.

title: Algebraic Immunity of S-Boxes and Augmented Functions
abstract: In this paper, the algebraic immunity of S-boxes and augmented functions of stream ciphers is investigated. Augmented functions are shown to have some algebraic properties that are not covered by previous measures of immunity. As a result, efficient algebraic attacks with very low data complexity on certain filter generators become possible. In a similar line, the algebraic immunity of the augmented function of the eSTREAM candidate Trivium is experimentally tested. These tests suggest that Trivium has some immunity against algebraic attacks on augmented functions.