6477815
An Affective User Interface Based on Facial Expression Recognition and Eye-Gaze Tracking
This paper describes a pipeline by which facial expression and eye-gaze of the user are tracked, and then 3D facial animation is synthesized in the remote place based upon timing information of the facial and eye movement information. The system first detects a facial area within the given image and then classifies its facial expression into 7 emotional weightings. Such weighting information, transmitted to the PDA via a mobile network, is used for non-photorealistic facial expression animation. It turns out that facial expression animation using emotional curves is more effective in expressing the timing of an expression comparing to the linear interpolation method. The emotional avatar embedded on a mobile platform has some potential in conveying emotion between peoples via Internet.
7461874
Face and Facial Expression Recognition with an Embedded System for Human-Robot Interaction
In this paper, we present an embedded system in which face recognition and facial expression recognition for Human-Robot Interaction are implemented. To detect face with a fast and reliable way, AdaBoost algorithm is used. Then, Principal Component Analysis is applied for recognizing the face. Gabor wavelets are combined with Enhanced Fisher Model for facial expression recognition. Performance of the facial expression recognition reaches to 93%. The embedded system runs on 150MHz and the processing speed is 0.6 frames / second. Experimental result demonstrates that face detection, recognition and facial expression can be implemented with an embedded system for the Human-Robot Interaction.
33400437
Facial Expression Recognition Using Active Appearance Model
This paper describes a facial expression recognition system based upon Active Appearance Model (AAM), which has been typically used for the face recognition task. Given that AAM has been also used in tracking the moving object, we thought it could be effective in recognizing the facial expressions of humans. Our results show that the performance of the facial expression recognition using AAM is reliably high when it combined with an enhanced Fisher classification model.
8330560
Shape Comparison of the Hippocampus Using a Multiresolution Representation and ICP Normalization
It is known that deformation of the hippocampus shape is involved with several neurological diseases. In this paper, we propose a hybrid shape representation scheme, which consists of multiresolution skeletons, voxels and meshes for the shape analysis of the hippocampus. Initially, a hippocampal surface model is reconstructed from MRI and then it is placed into a canonical coordinate system, where the position, orientation and scaling are normalized. From the voxel representation of the hippocampus, multiresolution skeletons are extracted and Iterative Closest Point normalization is carried out. Then the shape similarity of two hippocampal models is computed with a hierarchical fashion. In addition, we have implemented a neural network based classifier to discriminate whether a hippocampal model is normal or not. Results indicate that the proposed hybrid representation and the skeleton-based normalization using ICP are very effective in 3D shape analysis of the hippocampus.
37111410
Performance Comparison Between Backpropagation, Neuro-Fuzzy Network, and SVM
In this study, we compare the performance of well-known neural networks, namely, back-propagation (BP) algorithm, Neuro-Fuzzy network and Support Vector Machine (SVM) using the standard three database sets: Wisconsin breast cancer, Iris and wine data. Since such database have been useful for evaluating performance of a group of machine learning algorithms, a series of experiments have been carried out for three algorithms using the cross validation method. Results suggest that SVM outperforms the others and the Neuro-Fuzzy network is better than the BP algorithm for this data set.
36946020
Face Representation Method Using Pixel-to-Vertex Map (PVM) for 3D Model Based Face Recognition
3D model based approach for face recognition has been spotlighted as a robust solution under variant conditions of pose and illumination. Since a generative 3D face model consists of a large number of vertices, a 3D model based face recognition system is generally inefficient in computation time. In this paper, we propose a novel 3D face representation algorithm to reduce the number of vertices and optimize its computation time. Finally, we evaluate the performance of proposed algorithm with the Korean face database collected using a stereo-camera based 3D face capturing device.
18562018
2-Way Text Classification for Harmful Web Documents
The openness of the Web allows any user to access almost any type of information. However, some information, such as adult content, is not appropriate for all users, notably children. Additionally for adults, some contents included in abnormal porn sites can do ordinary people's mental health harm. In this paper, we propose an efficient 2-way text filter for blocking harmful web documents and also present a new criterion for clear classification. It filters off 0-grade web texts containing no harmful words using pattern matching with harmful words dictionaries, and classifies 1-grade,2-grade and 3-grade web texts using a machine learning algorithm.
14130132
Signal space detection for recording channels with jitter noise
A delay-constrained sequence detector is considered for recording channels whose major impediments include intersymbol interference (ISI) and magnetic transition jitter noise. The jitter noise is data-dependent, and a given noise sample is correlated with neighboring noise samples. A sequence detector with a finite decision delay can be formulated in a finite dimensional vector space. For a correlated noise channel, the decision boundary is generally quadratic. We present a technique for obtaining a minimal set of hyperplanes approximating a quadratic decision boundary with a negligible performance loss. In this process, a distance measure, which is consistent with the notion of the effective SNR, is defined and used as a design parameter to trade the complexity and performance. As an achievable performance bound, we derive the effective SNR for the maximum-likelihood sequence detector (MLSD) for these channels. The performance of the partial response maximum likelihood (PRML) detector commonly adopted for current data storage channels as well as the Viterbi algorithm (VA) based on the traditional Euclidean metric, which serves as the MLSD for additive white Gaussian noise, are also analyzed and compared with that of the proposed signal space detector.
6826338
Geometric crossover for multiway graph partitioning
Geometric crossover is a representation-independent generalization of the traditional crossover defined using the distance of the solution space. Using a distance tailored to the problem at hand, the formal definition of geometric crossover allows to design new problem-specific crossovers that embed problem-knowledge in the search. The standard encoding for multiway graph partitioning is highly redundant: each solution has a number of representations, one for each way of labeling the represented partition. Traditional crossover does not perform well on redundant encodings. We propose a new geometric crossover for graph partitioning based on a labeling-independent distance that filters the redundancy of the encoding. A correlation analysis of the fitness landscape based on this distance shows that it is well suited to graph partitioning. Our new genetic algorithm outperforms existing ones.
14743541
SCAI TREC-8 Experiments
This working note reports our experiences with TREC-8 on four tracks: Ad Hoc, Filtering, Web, and QA. The Ad Hoc retrieval engine, SCAIR, has been used for the Web and QA experiments, and the ltering experiments were based on it's own engine. As a second entry to TREC, we focused this year on exploring possibilities of applying machine learning techniques to TREC tasks. The Ad Hoc track employed a cluster-based retrieval method where the scoring function used cluster information extracted from a collection of precompiled documents. Filtering was based on naive Bayes learning supported by an EM algorithm. In the Web track, we compared the performance of using link information to that of not using the information. In the QA track, some passage extraction techniques have been tested using the baseline SCAIR retrieval engine.
11689182
Decentralized Authentication Mechanisms for Object-based Storage Devices
Network-attached object-based storage separates data-path from control-path and enables direct interaction between clients and the storage devices. Clients interact with the file manager only to acquire the meta-data information and some cryptographic primitives, for example, access keys. Most of the current schemes rely on a centralized file manager to support these activities. This paper presents security mechanisms for decentralized authentication for object-based storage. The schemes are novel in several ways. First of all, they reduce the load on the file manager and free the system from central point of failure and denial of service attacks. We exploit Role-based Access Control (RBAC) to provide scalability and design authentication schemes that efficiently utilize RBAC. In most of the cases, the client needs to acquire only one access key from the file manager, which can be used by the client to further derive role-keys for the roles that he/she is permitted to play within an organization. Further, the number of cryptographic keys required for the purpose of authentication in these schemes is less as compared to the existing schemes. Finally, we also present two simple schemes that enable the clients to access objects stored on any device on the network using a single identity key.