1164650
Constructing Facial Identity Surfaces for Recognition
We present a novel approach to face recognition by constructing facial identity structures across views and over time, referred to as identity surfaces, in a Kernel Discriminant Analysis (KDA) feature space. This approach is aimed at addressing three challenging problems in face recognition: modelling faces across multiple views, extracting non-linear discriminatory features, and recognising faces over time. First, a multi-view face model is designed which can be automatically fitted to face images and sequences to extract the normalised facial texture patterns. This model is capable of dealing with faces with large pose variation. Second, KDA is developed to compute the most significant non-linear basis vectors with the intention of maximising the between-class variance and minimising the within-class variance. We applied KDA to the problem of multi-view face recognition, and a significant improvement has been achieved in reliability and accuracy. Third, identity surfaces are constructed in a pose-parameterised discriminatory feature space. Dynamic face recognition is then performed by matching the object trajectory computed from a video input and model trajectories constructed on the identity surfaces. These two types of trajectories encode the spatio-temporal dynamics of moving faces.
737421
Recognising trajectories of facial identities using kernel discriminant analysis
We present a comprehensive approach to address three challenging problems in face recognition: modelling faces across multi-views, extracting the nonlinear discriminating features, and recognising moving faces dynamically in image sequences. A multi-view dynamic face model is designed to extract the shape-and-pose-free facial texture patterns. Kernel discriminant analysis, which employs the kernel technique to perform linear discriminant analysis in a high-dimensional feature space, is developed to extract the significant nonlinear features which maximise the between-class variance and minimise the within-class variance. Finally, an identity surface based face recognition is performed dynamically from video input by matching object and model trajectories. q 2003 Elsevier B.V. All rights reserved.
5262698
An integrated algorithm of incremental and robust PCA
Principal component analysis (PCA) is a well-established technique in image processing and pattern recognition. Incremental PCA and robust PCA are two interesting problems with numerous potential applications. However, these two issues have only been separately addressed in the previous studies. In this paper, we present a novel algorithm for incremental and robust PCA by seamlessly integrating the two issues together. The proposed algorithm has the advantages of both incremental PCA and robust PCA. Moreover, unlike most M-estimation based robust algorithms, it is computational efficient. Experimental results on dynamic background modelling are provided to show the performance of the algorithm with a comparison to the conventional batch-mode and nonrobust algorithms.
10776344
Robust Head Tracking Based on a Multi-State Particle Filter
This paper proposes a novel method for robust and automatic realtime head tracking by fusing face and head cues within a multi-state particle filter. Due to large appearance variability of human head, most existing head tracking methods use little object-specific prior knowledge, resulting in limited discriminant power. In contrast, face is a distinct pattern much easier to capture, which motivates us to incorporate a vector-boosted multi-view face detector (C. Huang, et al., 2005) to lend strong aid to general head observation cues including color and contour edge. To simultaneously and collaboratively perform temporal inference of both the face state and the head state, a Markov-network-based particle filter is constructed using sequential belief propagation Monte Carlo (G. Hua, et al., 2004). Our approach is tested on sequences used by previous researchers as well as on new data sets which includes many challenging real-world cases, and shows robustness against various unfavorable conditions
8996068
A mobile sensor network using autonomously controlled animals
Recent research has demonstrated that it is possible to use wireless communication to deliver brain stimulation to guide the movements of rats through a variety of terrains by stimulating multiple brain regions to produce stimulus cues for various commanded movements. The rats can be controlled not only while in direct line of sight of a human controller, but also by teleoperation, using signals transmitted from a wireless video camera mounted on the animal's backpack. Remotely guided rats or other animals are ideal for search and rescue operations because they are highly adept at negotiating difficult 3D terrain, in both light and dark. The animals autonomously choose their own methods for traversing particular obstacles. Primarily for these reasons, they can be more effective than mechanical robots in search and rescue applications. They can also be trained to detect and home in on specific sensory targets, allowing them to be used as biosensors. To meet these challenges, a cluster of interrelated research studies, including network topology design, routing algorithms, media access control techniques, radio resource management, radio propagation modeling, and mobility modeling are comprised. In this paper, the authors have designed and implemented the hardware of backpacks and set up a simple wireless ad hoc network by using static routing.
24872800
Face Recognition using Patch-based Spin Images
This paper explores how spin images can be constructed using shape-from-shading information and used for the purposes of face recognition. We commence by extracting needle-maps from gray-scale images of faces, using a mean needle-map to enforce the correct pattern official convexity and concavity. Spin images (Johnson and Hebert, 1999) are estimated from the needle maps using local spherical geometry to approximate the facial surface. Our representation is based on the spin image histograms for an arrangement of image patches. We demonstrate how this representation can be used to perform face recognition across different subjects and illumination conditions. Experiments show the method to be reliable and accurate
8278906
A Hybrid Method of Unsupervised Feature Selection Based on Ranking
Feature selection is a key problem to pattern recognition. So far, most methods of feature selection focus on sample data where class information is available. For sample data without class labels, however, the related methods for feature selection are few. This paper proposes a new way of unsupervised feature selection. Our method is a hybrid approach based on ranking the features according to their relevance to clustering using a new ranking index which belongs to exponential entropy. Firstly a candidate feature subset is selected using a modified fuzzy feature evaluation index (FFEI) with a new method to calculate the feature weight, which makes the algorithm to be robust and independent of domain knowledge. Then a wrapper method is used to select compact feature subset from the candidate feature set based on the clustering performance. Experimental results on benchmark data sets indicate the effectiveness of the proposed method
53246102
Informal prototyping of continuous graphical interactions by demonstration
Informal prototyping tools have shown great potential in facilitating the early stage design of user interfaces. How-ever, continuous interactions, an important constituent of highly interactive interfaces, have not been well supported by previous tools. These interactions give continuous visual feedback, such as geometric changes of a graphical object, in response to continuous user input, such as the movement of a mouse. We built Monet, a sketch-based tool for proto-typing continuous interactions by demonstration. In Monet, designers can prototype continuous widgets and their states of interest using examples. They can also demonstrate com-pound behaviors involving multiple widgets by direct ma-nipulation. Monet allows continuous interactions to be eas-ily integrated with event-based, discrete interactions. Con-tinuous widgets can be embedded into storyboards and their states can condition or trigger storyboard transitions. Monet achieves these features by employing continuous function approximation and statistical classification techniques, without using any domain specific knowledge or assuming any application semantics. Informal feedback showed that Monet is a promising approach to enabling more complete tool support for early stage UI design.