Deep Learning For Smile Recognition

Inspired by recent successes of deep learning in computer vision, we propose a novel application of deep convolutional neural networks to facial expression recognition, in particular smile recognition. A smile recognition test accuracy of 99.45% is achieved for the Denver Intensity of Spontaneous Facial Action (DISFA) database, significantly outperforming existing approaches based on hand-crafted features with accuracies ranging from 65.55% to 79.67%. The novelty of this approach includes a comprehensive model selection of the architecture parameters, allowing to find an appropriate architecture for each expression such as smile. This is feasible because all experiments were run on a Tesla K40c GPU, allowing a speedup of factor 10 over traditional computations on a CPU.Comment: Proceedings of the 12th Conference on Uncertainty Modelling in Knowledge Engineering and Decision Making (FLINS 2016

Morphological Complexity and Conceptualization : The Human Body

In this squib, I want to argue that the morphological structure of words is, at least to some extent, motivated. As an example I have choosen the partonomic (and for the less part taxonomic) nomenclature of the human body. While important work by Brown et alii (1973), Anderson (1978) and Schladt (1997) exists on this topic, these analyses focus on the conceptualization of body-parts and their semantics, but not on their morphological representation. In the following, I want to check two predictions about the morphological complexity of lexical items denoting parts of the human body. The first assumption is that the most canonical body-parts are always expressed by mono-lexematic items. The second one consists in the assumption that body-parts of the lowest levels in the hierarchy are always morphologically complex. A set of six body-parts has been analysed in 27 languages. The set consists of two canonical (HEAD and EAR) and of one from the lowest level of the hierarchy (TOENAIL). For this I have adopted a sample from Schladt (1997) and a small one compiled by mysel

Fresh Silo Polish, Serf!

I find the art of palindrome creation both fascinating and ridiculous. The difficulty, especially with longer ones, is trying to insure that everything makes sense. It never does, so I content myself with developing a theme of sorts and hope the other 70 or 80 per cent of the words are not too bothersome

A Simple and Correct Even-Odd Algorithm for the Point-in-Polygon Problem for Complex Polygons

Determining if a point is in a polygon or not is used by a lot of applications in computer graphics, computer games and geoinformatics. Implementing this check is error-prone since there are many special cases to be considered. This holds true in particular for complex polygons whose edges intersect each other creating holes. In this paper we present a simple even-odd algorithm to solve this problem for complex polygons in linear time and prove its correctness for all possible points and polygons. We furthermore provide examples and implementation notes for this algorithm.Comment: Proceedings of the 12th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications (VISIGRAPP 2017), Volume 1: GRAP

The Global Employer: The Labor Relations and Collective Agreements Issue

[Excerpt] Baker & McKenzie’s Global Employment Practice Group is pleased to present its 56th issue of The Global Employer™ entitled “The Labor Relations and Collective Agreements Issue.” In this issue you will find the first report from our Future of Work Series. Labor Relations Report - Brand Attack: How to avoid becoming the target of a corporate campaign and what actions to take if you do. The Future of Work is a series of client reports based on panel discussions at our Global Employer Forum, a two-day thought leadership conference. During the forum, nearly 70 clients, academics and consultants gathered with our employment partners to discuss pressing workplace topics like talent shortages, data privacy, global mobility assignments, globalization of unions and managing the employment aspects of M&A deals. Rather than the traditional “how to” legal format of most law firm conferences, the Global Employer Forum features panel discussions of in-house counsel and senior-level executives from some of the world’s largest multinational organizations who discussed their personal experiences addressing these challenges and the solutions they have found to overcome them. Following the Labor Relations Report, you will also find information pertaining to the current state of labor relations and union negotiations in Argentina and a general overview of the current state of collective bargaining in Brazil. In Germany, we take a look at some of the numbers behind collective bargaining agreements; and a review of the impacts on labor benefits of the January 2014, Income Tax Law reform in Mexico. From Spain we bring you articles that discuss negotiating with representatives bodies in collective lay-offs and the new role of company level collective bargaining agreements; and from the US, recent efforts by the NLRB as it Targets Successor Issues in US Mergers and Acquisitions

Minimax rank estimation for subspace tracking

Rank estimation is a classical model order selection problem that arises in a variety of important statistical signal and array processing systems, yet is addressed relatively infrequently in the extant literature. Here we present sample covariance asymptotics stemming from random matrix theory, and bring them to bear on the problem of optimal rank estimation in the context of the standard array observation model with additive white Gaussian noise. The most significant of these results demonstrates the existence of a phase transition threshold, below which eigenvalues and associated eigenvectors of the sample covariance fail to provide any information on population eigenvalues. We then develop a decision-theoretic rank estimation framework that leads to a simple ordered selection rule based on thresholding; in contrast to competing approaches, however, it admits asymptotic minimax optimality and is free of tuning parameters. We analyze the asymptotic performance of our rank selection procedure and conclude with a brief simulation study demonstrating its practical efficacy in the context of subspace tracking.Comment: 10 pages, 4 figures; final versio