Invariant representation of facial expressions for blended expression recognition on unknown subjects

Facial expressions analysis plays an important part in emotion detection. However, having an automatic and non-intrusive system to detect blended facial expression is still a challenging problem, especially when the subject is unknown to the system. Here, we propose a method that adapts to the morphology of the subject and that is based on a new invariant representation of facial expressions. In our system, one expression is defined by its relative position to 8 other expressions. As the mode of representation is relative, we show that the resulting expression space is person-independent. The 8 expressions are synthesized for each unknown subject from plausible distortions. Recognition tasks are performed in this space with a basic algorithm. The experiments have been performed on 22 different blended expressions and on either known or unknown subjects. The recognition results on known subjects demonstrate that the representation is robust to the type of data (shape and/or texture information) and to the dimensionality of the expression space. The recognition results on 22 expressions of unknown subjects show that a dimensionality of the expression space of 4 is enough to outperform traditional methods based on active appearance models and accurately describe an expression.     

On matrices, automata, and double counting in constraint programming

Matrix models are ubiquitous for constraint problems. Many such problems have a matrix of variables $\mathcal{M}$ , with the same constraint C defined by a finite-state automaton $\mathcal{A}$ on each row of $\mathcal{M}$ and a global cardinality constraint $\mathit{gcc}$ on each column of $\mathcal{M}$ . We give two methods for deriving, by double counting, necessary conditions on the cardinality variables of the $\mathit{gcc}$ constraints from the automaton $\mathcal{A}$ . The first method yields linear necessary conditions and simple arithmetic constraints. The second method introduces the cardinality automaton, which abstracts the overall behaviour of all the row automata and can be encoded by a set of linear constraints. We also provide a domain consistency filtering algorithm for the conjunction of lexicographic ordering constraints between adjacent rows of $\mathcal{M}$ and (possibly different) automaton constraints on the rows. We evaluate the impact of our methods in terms of runtime and search effort on a large set of nurse rostering problem instances.     

Urban flood risk assessment using sewer flooding databases

Sustainable water management is a global challenge for the 21st century. One key aspect remains protection against urban flooding. The main objective is to ensure or maintain an adequate level of service for all inhabitants. However, level of service is still difficult to assess and the high-risk locations difficult to identify. In this article, we propose a methodology, which (i) allows water managers to measure the service provided by the urban drainage system with regard to protection against urban flooding; and (ii) helps stakeholders to determine effective strategies for improving the service provided. One key aspect of this work is to use a database of sewer flood event records to assess flood risk. Our methodology helps urban water managers to assess the risk of sewer flooding; this approach does not seek to predict flooding but rather to inform decision makers on the current level of risk and on actions which need to be taken to reduce the risk. This work is based on a comprehensive definition of risk, including territorial vulnerability and perceptions of urban water stakeholders. This paper presents the results and the methodological contributions from implementing the methodology on two case studies: the cities of Lyon and Mulhouse.     

Dual-color fluorescence lifetime correlation spectroscopy to quantify protein-protein interactions in live cell

Dual-color fluorescence correlation spectroscopy is an interesting method to quantify protein interaction in living cells. But, when performing these experiments, one must compensate for a known spectral bleed through artifact that corrupts cross-correlation data. In this article, problems with crosstalk were overcome with an approach based on fluorescence lifetime correlation spectroscopy (FLCS). We show that FLCS applied to dual-color EGFP and mCherry cross-correlation allows the determination of protein-protein interactions in living cells without the need of spectral bleed through calibration. The methodology was validated by using EGFP-mCherry tandem in comparison with coexpressed EGFP and mCherry in live cell. The dual-color FLCS experimental procedure where the different laser intensities do not have to be controlled during experiment is really very helpful to study quantitatively protein interactions in live sample.     

Oblivious transfer and quantum channels as communication resources

We show that from a communication-complexity perspective, the primitive called oblivious transfer—which was introduced in a cryptographic context—can be seen as the classical analogue to a quantum channel in the same sense as non-local boxes are of maximally entangled qubits. More explicitly, one realization of non-cryptographic oblivious transfer allows for the perfect simulation of sending one qubit and measuring it in an orthogonal basis. On the other hand, a qubit channel allows for realizing non-cryptographic oblivious transfer with probability roughly 85 %, whereas 75 % is the classical limit.     

Particle Level Set Advection for the Interactive Visualization of Unsteady 3D Flow

Typically, flow volumes are visualized by defining their boundary as iso‐surface of a level set function. Grid‐based level sets offer a good global representation but suffer from numerical diffusion of surface detail, whereas particle‐based methods preserve details more accurately but introduce the problem of unequal global representation. The particle level set (PLS) method combines the advantages of both approaches by interchanging the information between the grid and the particles. Our work demonstrates that the PLS technique can be adapted to volumetric dye advection via streak volumes, and to the visualization by time surfaces and path volumes. We achieve this with a modified and extended PLS, including a model for dye injection. A new algorithmic interpretation of PLS is introduced to exploit the efficiency of the GPU, leading to interactive visualization. Finally, we demonstrate the high quality and usefulness of PLS flow visualization by providing quantitative results on volume preservation and by discussing typical applications of 3D flow visualization.     

A knowledge-based approach to manage information systems interoperability

Interoperability is a key property of enterprise applications, which is hard to achieve due to the large number of interoperating components and semantic heterogeneity. The inherent complexity of interoperability problems implies that there exists no silver bullet to solve them. Rather, the knowledge about how to solve wicked interoperability problems is hidden in the application cases that expose those problems. The paper addresses the question of how to organise and use method knowledge to resolve interoperability problems. We propose the structure of a knowledge-based system that can deliver situation-specific solutions, called method chunks. Situational Method Engineering promotes modularisation and formalisation of method knowledge in the form of reusable method chunks, which can be combined to compose a situation-specific method. The method chunks are stored in a method chunk repository. In order to cater for management and retrieval, we introduce an Interoperability Classification Framework, which is used to classify and tag method chunks and to assess the project situation in which they are to be used. The classification framework incorporates technical as well as business and organisational aspects of interoperability. This is an important feature as interoperability problems typically are multifaceted spanning multiple aspects. We have applied the approach to analyse an industry case from the insurance sector to identify and classify a set of method chunks.     

Representational power of restricted boltzmann machines and deep belief networks

Deep belief networks (DBN) are generative neural network models with many layers of hidden explanatory factors, recently introduced by Hinton, Osindero, and Teh (2006) along with a greedy layer-wise unsupervised learning algorithm. The building block of a DBN is a probabilistic model called a restricted Boltzmann machine (RBM), used to represent one layer of the model. Restricted Boltzmann machines are interesting because inference is easy in them and because they have been successfully used as building blocks for training deeper models. We first prove that adding hidden units yields strictly improved modeling power, while a second theorem shows that RBMs are universal approximators of discrete distributions. We then study the question of whether DBNs with more layers are strictly more powerful in terms of representational power. This suggests a new and less greedy criterion for training RBMs within DBNs.     

Monotony properties of connected visible graph searching

Search games are attractive for their correspondence with classical width parameters. For instance, the invisible search number (a.k.a. node search number) of a graph is equal to its pathwidth plus 1, and the visible search number of a graph is equal to its treewidth plus 1. The connected variants of these games ask for search strategies that are connected, i.e., at every step of the strategy, the searched part of the graph induces a connected subgraph. We focus on monotone search strategies, i.e., strategies for which every node is searched exactly once. The monotone connected visible search number of an n-node graph is at most O(logn) times its visible search number. First, we prove that this logarithmic bound is tight. Precisely, we prove that there is an infinite family of graphs for which the ratio monotone connected visible search number over visible search number is Ω(logn). Second, we prove that, as opposed to the non-connected variant of visible graph searching, “recontamination helps” for connected visible search. Precisely, we prove that, for any k4, there exists a graph with connected visible search number at most k, and monotone connected visible search number >k