Feature Selection for Pose Invariant Lip Biometrics

For the first time in this paper the authors present results showing the effect of out of plane speaker head pose variation on a lip biometric based speaker verification system. Using appearance DCT based features, they adopt a Mutual Information analysis technique to highlight the class discriminant DCT components most robust to changes in out of plane pose. Experiments are conducted using the initial phase of a new multi view Audio-Visual database designed for research and development of pose-invariant speech and speaker recognition. They show that verification performance can be improved by substituting higher order horizontal DCT components for vertical, particularly in the case of a train/test pose angle mismatch.

Robust face recognition with partial occlusion, illumination variation and limited training data by optimal feature selection

This study investigates face recognition with partial occlusion, illumination variation and their combination, assuming no prior information about the mismatch, and limited training data for each person. The authors extend their previous posterior union model (PUM) to give a new method capable of dealing with all these problems. PUM is an approach for selecting the optimal local image features for recognition to improve robustness to partial occlusion. The extension is in two stages. First, authors extend PUM from a probability-based formulation to a similarity-based formulation, so that it operates with as little as one single training sample to offer robustness to partial occlusion. Second, they extend this new formulation to make it robust to illumination variation, and to combined illumination variation and partial occlusion, by a novel combination of multicondition relighting and optimal feature selection. To evaluate the new methods, a number of databases with various simulated and realistic occlusion/illumination mismatches have been used. The results have demonstrated the improved robustness of the new methods.

“The Double Feature Evil”: Efforts to Eliminate the American Dual Bill

The essay discusses the actions and motivations of various groups that tried to end the practice of double feature film exhibition in the United States during the 1930s and 1940s. Used as a price-cutting strategy, double features were embraced by marginal exhibitors and low-budget producers, but attacked by most major studios and established theatre chains. Methods employed to control the double feature included voluntary bans, governmental legislation, and legal action. During the depression, Franklin D. Roosevelt's New Deal opposed the double feature as a strategy likely to undermine established admission price levels. But the double feature proved resilient and survived all these efforts, as well as an additional series of assaults, based on conservation of energy and materiel, mounted during the Second World War.

Determination of absolute ion yields from a MALDI source through calibration of an image-charge detector

MALDI (matrix-assisted laser desorption/ionization) is one of the most important techniques used to produce large biomolecular ions in the gas phase. Surprisingly, the exact ionization mechanism is still not well understood and absolute values for the ion yields are scarce. This is in part due to the unknown efficiencies of typical detectors, especially for heavy biomolecular ions. As an alternative, charged particles can be non-destructively detected using an image-charge detector where the output voltage signal is proportional to the total charge within the device. In this paper, we report an absolute calibration which provides the voltage output per detected electronic charge in our experimental arrangement. A minimum of 3 x 10(3) ions were required to distinguish the signal above background noise in a single pass through the device, which could be further reduced using filtering techniques. The calibration results have been applied to raw MALDI spectra to measure absolute ion yields of both matrix and analyte ions.

An efficient feature selection method for mobile devices with application to activity recognition

This paper presents a feature selection method for data classification, which combines a model-based variable selection technique and a fast two-stage subset selection algorithm. The relationship between a specified (and complete) set of candidate features and the class label is modelled using a non-linear full regression model which is linear-in-the-parameters. The performance of a sub-model measured by the sum of the squared-errors (SSE) is used to score the informativeness of the subset of features involved in the sub-model. The two-stage subset selection algorithm approaches a solution sub-model with the SSE being locally minimized. The features involved in the solution sub-model are selected as inputs to support vector machines (SVMs) for classification. The memory requirement of this algorithm is independent of the number of training patterns. This property makes this method suitable for applications executed in mobile devices where physical RAM memory is very limited. An application was developed for activity recognition, which implements the proposed feature selection algorithm and an SVM training procedure. Experiments are carried out with the application running on a PDA for human activity recognition using accelerometer data. A comparison with an information gain based feature selection method demonstrates the effectiveness and efficiency of the proposed algorithm.

Comparing large graphs efficiently by margins of feature vectors

Measuring the structural similarity of graphs is a challenging and outstanding problem. Most of the classical approaches of the so-called exact graph matching methods are based on graph or subgraph isomorphic relations of the underlying graphs. In contrast to these methods in this paper we introduce a novel approach to measure the structural similarity of directed and undirected graphs that is mainly based on margins of feature vectors representing graphs. We introduce novel graph similarity and dissimilarity measures, provide some properties and analyze their algorithmic complexity. We find that the computational complexity of our measures is polynomial in the graph size and, hence, significantly better than classical methods from, e.g. exact graph matching which are NP-complete. Numerically, we provide some examples of our measure and compare the results with the well-known graph edit distance. (c) 2006 Elsevier Inc. All rights reserved.