16604799
Face Recognition Using Line Edge Map
The automatic recognition of human faces presents a significant challenge to the pattern recognition research community. Typically, human faces are very similar in structure with minor differences from person to person. They are actually within one class of "human face". Furthermore, lighting conditions change, while facial expressions and pose variations further complicate the face recognition task as one of the difficult problems in pattern analysis. This paper proposes a novel concept: namely, that faces can be recognized using a line edge map (LEM). The LEM, a compact face feature, is generated for face coding and recognition. A thorough investigation of the proposed concept is conducted which covers all aspects of human face recognition, i.e. face recognition under (1) controlled/ideal conditions and size variations, (2) varying lighting conditions, (3) varying facial expressions, and (4) varying pose. The system performance is also compared with the eigenface method, one of the best face recognition techniques, and with reported experimental results of other methods. A face pre-filtering technique is proposed to speed up the search process. It is a very encouraging to find that the proposed face recognition technique has performed better than the eigenface method in most of the comparison experiments. This research demonstrates that the LEM, together with the proposed generic line-segment Hausdorff distance measure, provides a new method for face coding and recognition.
8115984
Facial expression recognition from line-based caricatures
The automatic recognition of facial expression presents a significant challenge to the pattern analysis and man-machine interaction research community. Recognition from a single static image is particularly a difficult task. In this paper, we present a methodology for facial expression recognition from a single static image using line-based caricatures. The recognition process is completely automatic. It also addresses the computational expensive problem and is thus suitable for real-time applications. The proposed approach uses structural and geometrical features of a user sketched expression model to match the line edge map (LEM) descriptor of an input face image. A disparity measure that is robust to expression variations is defined. The effectiveness of the proposed technique has been evaluated and promising results are obtained. This work has proven the proposed idea that facial expressions can be characterized and recognized by caricatures.
44837860
Line segment Hausdorff distance on face matching
Abstract A novel concept of line segment Hausdorff distance is proposed in this paper. Researchers apply Hausdorff distance to measure the similarity of two point sets. It is extended here to match two sets of line segments. The new approach has the advantage to incorporate structural and spatial information to compute the similarity. The added information can conceptually provide more and better distinctive capability for recognition. This would strengthen and enhance the matching process of similar objects such as faces. The proposed technique has been applied online segments generated from the edge maps of faces with encouraging result that supports the concept experimentally. The results also implicate that line segments could provide sufficient information for face recognition. This might imply a new way for face coding and recognition.
15321155
Line-Based Affine Invariant Object Location Using Transformation Space Decomposition
This paper presents a novel line-based affine invariant object location methodology. Our algorithm employs a new line-based transformation space decomposition technique to exploit intrinsic structural information provided by line features. Furthermore, we propose a new line-based distance transform to integrate with our algorithm to provide efficient transformation cell evaluation and subdivision in a coarse to fine manner. The algorithm is able to rapidly accelerate the searching process while maintaining high discriminative power and minimal storage requirement. The efficiency and discriminative power of this methodology are demonstrated using real-world examples with promising results
41738297
Human face profile recognition using attributed string
A new attributed string matching method for human face profile recognition is proposed in this work. It is a novel idea to apply structural and syntactic technique on face profile matching. The approach works on a chain of profile line segments and highlights the favor of curve matching by suppressing the operations of insert and delete. The technique relies mainly on the merge and change operations of string to tackle the inconsistency problem of feature point detection. A quadratic penalty function is proposed to prohibit large angle changes and overmerging. The method produces very encouraging results and is found to be suitable for similar shape classification.
14861370
On transforming statistical models for non-frontal face verification
We address the pose mismatch problem which can occur in face verification systems that have only a single (frontal) face image available for training. In the framework of a Bayesian classifier based on mixtures of gaussians, the problem is tackled through extending each frontal face model with artificially synthesized models for non-frontal views. The synthesis methods are based on several implementations of maximum likelihood linear regression (MLLR), as well as standard multi-variate linear regression (LinReg). All synthesis techniques rely on prior information and learn how face models for the frontal view are related to face models for non-frontal views. The synthesis and extension approach is evaluated by applying it to two face verification systems: a holistic system (based on PCA-derived features) and a local feature system (based on DCT-derived features). Experiments on the FERET database suggest that for the holistic system, the LinReg-based technique is more suited than the MLLR-based techniques; for the local feature system, the results show that synthesis via a new MLLR implementation obtains better performance than synthesis based on traditional MLLR. The results further suggest that extending frontal models considerably reduces errors. It is also shown that the local feature system is less affected by view changes than the holistic system; this can be attributed to the parts based representation of the face, and, due to the classifier based on mixtures of gaussians, the lack of constraints on spatial relations between the face parts, allowing for deformations and movements of face areas.
14459995
Phase Transitions of Dominating Clique Problem and Their Implications to Heuristics in Satisfiability Search
We study a monotone NP decision problem, the dominating clique problem, whose phase transition occurs at a very dense stage of the random graph evolution process. We establish the exact threshold of the phase transition and propose an efficient search algorithm that runs in super-polynomial time with high probability. Our empirical studies reveal two even more intriguing phenomena in its typical-case complexity: (1) the problem is "uniformly hard" with a tiny runtime variance on negative instances. (2) Our algorithm and its CNF-tailored implementation, outperform several SAT solvers by a huge margin on dominating cliques and some other SAT problems with similar structures.
6963840
Applying Neural Network to Reinforcement Learning in Continuous Spaces
This paper is concerned with the problem of Reinforcement Learning (RL) in large or continuous spaces. Function approximation is the main method to solve such kind of problem. We propose using neural networks as function approximators in this paper. Then we experiment with three kind of neural networks in Mountain-Car task and illustrate comparisons among them. The result shows that CMAC and Fuzzy ARTMAP perform better than BP in Reinforcement Learning with Function Approximation (RLFA).
15420304
Incremental gradient descent imputation method for missing data in learning classifier systems
Learning with incomplete or missing data has been a major challenge in learning classifier system. One method for covering missing data is imputing missing values based on the statistic of known values. Another is marking them matching arbitrary case. A new approach using incremental gradient descent imputation model is proposed in this paper, which use the relationship among variables to estimate the missing value. And, some experiments are conducted in order to compare the performance of new approach and other classical covering methods.
17713377
Feedback based Dynamic Autonomous Web Service Composition
Web services are becoming very important in applications from electronic commerce to application interoperation. While numerous efforts have focused on service composition, plan selection among similar plans with different performance has not been addressed. We propose a feedback based dynamic autonomous composition strategy for the automated composition of web services described in semantic Web. The strategy is tested in a simulated environment with good experimental results.
13799231
Improving molecular cancer class discovery through sparse non-negative matrix factorization
MOTIVATION
Identifying different cancer classes or subclasses with similar morphological appearances presents a challenging problem and has important implication in cancer diagnosis and treatment. Clustering based on gene-expression data has been shown to be a powerful method in cancer class discovery. Non-negative matrix factorization is one such method and was shown to be advantageous over other clustering techniques, such as hierarchical clustering or self-organizing maps. In this paper, we investigate the benefit of explicitly enforcing sparseness in the factorization process.


RESULTS
We report an improved unsupervised method for cancer classification by the use of gene-expression profile via sparse non-negative matrix factorization. We demonstrate the improvement by direct comparison with classic non-negative matrix factorization on the three well-studied datasets. In addition, we illustrate how to identify a small subset of co-expressed genes that may be directly involved in cancer.