14450433
Integrating Faces, Fingerprints, and Soft Biometric Traits for User Recognition
Soft biometric traits like gender, age, height, weight, ethnicity, and eye color cannot provide reliable user recognition because they are not distinctive and permanent. However, such ancillary information can complement the identity information provided by the primary biometric traits (face, fingerprint, hand-geometry, iris, etc.). This paper describes a hybrid biometric system that uses face and fingerprint as the primary characteristics and gender, ethnicity, and height as the soft characteristics. We have studied the effect of the soft biometric traits on the recognition performance of unimodal face and fingerprint recognition systems and a multimodal system that uses both the primary traits. Experiments conducted on a database of 263 users show that the recognition performance of the primary biometric system can be improved significantly by making use of soft biometric information. The results also indicate that such a performance improvement can be achieved only if the soft biometric traits are complementary to the primary biometric traits.
41811385
Orientation analysis for rotated human face detection
Abstract In this paper, we present a framework of orientation analysis for rotated human face detection. A novel orientation histogram is constructed for statistical analysis of face images, which can show a proper symmetry with respect to the orientation of the principal axis and a local peak at its orthogonal orientation. By analyzing the orientation histogram, we can easily find the principal axis' orientation of the rotated face. Then an upright frontal face detector based on orientation analysis and other knowledge is designed to verify the given face. The experimental results illustrate the effectiveness of our framework.
7724153
Resampling for Face Recognition
A number of applications require robust human face recognition under varying environmental lighting conditions and different facial expressions, which considerably vary the appearance of human face. However, in many face recognition applications, only a small number of training samples for each subject are available; these samples are not able to capture all the facial appearance variations. We utilize the resampling techniques to generate several subsets of samples from the original training dataset. A classic appearance-based recognizer, LDA-based classifier, is applied to each of the generated subsets to construct a LDA representation for face recognition. The classification results from each subset are integrated by two strategies: majority voting and the sum rule. Experiments conducted on a face database containing 206 subjects (2,060 face images) show that the proposed approaches improve the recognition accuracy of the classical LDA-based face classifier by about 7 percentages.
1730176
Integrating Range and Texture Information for 3D Face Recognition
The performance of face recognition systems that use two-dimensional images depends on consistent conditions w.r.t. lighting, pose, and facial appearance. We are developing a face recognition system that utilizes three-dimensional shape information to make the system more robust to arbitrary view, lighting, and facial appearance. For each subject, a 3D face model is constructed by integrating several 2.5D face scans from different viewpoints. A 2.5D scan is composed of one range image along with a registered 2D color image. The recognition engine consists of two components, surface matching and appearance-based matching. The surface matching component is based on a modified Iterative Closest Point (ICP) algorithm.The candidate list used for appearance matching is dynamically generated based on the output of the surface matching component, which reduces the complexity of the appearance-based matching stage. The 3D model in the gallery is used to synthesize new appearance samples with pose and illumination variations that are used for discriminant subspace analysis. The weighted sum rule is applied to combine the two matching components. A hierarchical matching structure is designed to further improve the system performance in both accuracy and efficiency. Experimental results are given for matching a database of 100 3D face models with 598 2.5D independent test scans acquired in different pose and lighting conditions, and with some smiling expression. The results show the feasibility of the proposed matching scheme.
19393995
Skilled Forgery Detection in On-Line Signatures: A Multimodal Approach
Signature recognition has a long history of usage in authentication of transactions and legal contracts and hence is easily accepted by users in a variety of applications. However, the problem of skilled forgeries is an important challenge that needs to be overcome before signature recognition systems will become viable in unsupervised authentication systems. In this paper, we present a multimodal approach to forgery detection, where a physiological trait, the face of the signing person, is used to validate the signature. Methods of normalizing and combining the matching scores from the individual modalities are investigated. Test results of the system on a database of 100 users is presented. The system achieves an equal error rate of 2.2% in the presence of high quality skilled forgeries and could detect all the skilled forgeries at a genuine acceptance rate of 75%.
176930
Face detection and synthesis using Markov random field models
Markov random fields (MRFs) are proposed as viable stochastic models for the spatial distribution of gray levels for images of human faces. These models are trained using data bases of face and non-face images. The trained MRF models are then used for detecting human faces in test images. We investigate the performance of the face detection algorithm for two classes of MRFs given by the first- and second-order neighborhood systems. From the cross validation results and from actual detection in real images, it is shown that the second-order model makes fewer false detections. We also investigate the possibility of increasing our training data base of faces by simulating face-like images from the trained MRFs. The performance of the re-trained MRFs based on added face-like images is compared to the original training data base.
14843520
Deriving knowledge from figures for digital libraries
Figures in digital documents contain important information. Current digital libraries do not summarize and index information available within figures for document retrieval. We present our system on automatic categorization of figures and extraction of data from 2-D plots. A machine-learning based method is used to categorize figures into a set of predefined types based on image features. An automated algorithm is designed to extract data values from solid line curves in 2-D plots. The semantic type of figures and extracted data values from 2-D plots can be integrated with textual information within documents to provide more effective document retrieval services for digital library users. Experimental evaluation has demonstrated that our system can produce results suitable for real-world use.
12221705
Fast mode decision and motion estimation for H.264 with a focus on MPEG-2/H.264 transcoding
The H.264 standard achieves much higher coding efficiency than previous video coding standards, due to its improved inter and intra prediction modes which come with a cost of higher computational complexity. When transcoding to H.264 from MPEG-2, motion information from MPEG-2 can be used to speed up the motion search. Fast mode decision algorithms are proposed for B and P frames, and a fast intra prediction algorithm is developed for intra coding. In addition, fast motion estimation is developed by reusing the motion information from MPEG-2. Simulation results demonstrate that we can achieve significant complexity reduction while maintaining the coding efficiency.
12380989
Hamiltonian cycles in bipartite graphs
We give a sufficient condition for bipartite graphs to be Hamiltonian. The condition involves the edge-density and balanced independence number of a bipartite graph.
23366254
Autonomous Information Services Integration for High-Assurance in Demand-Oriented Information Systems
With interdependent requests of multi-service increasing, the need for adaptability, timeliness and reliability to information service systems has become more and more important. In this paper, the relationship between the timeliness and the reliability of correlated services allocation and access is clarified. Based on these factors, the autonomous network-based information services integration technology to provide one-stop service for users’ multi-service requests is proposed. We proved the effectiveness of the proposed technology through the simulation and the results show that the integrated service can reduce the total users access time compared with the conventional systems.
28342911
A matching game
Abstract We consider the following 2-person game playing on K n,n . Two players, maker and breaker, alternately take a previously untaken edge from K n,n , the complete bipartite graph of order 2 n . The game continues until all the edges of K n,n have been taken. Then the edges taken by maker induce a subgraph of K n,n , which is denoted by G ( M ). At the end of the game, we calculate the number of edge-disjoint perfect matchings of G ( M ), and denote this number by m ( M ). The maker's aim is to make this number big and the breaker's is to force it small. We will prove the following result: For any given η >0, there exists N ( η ), such that if n ⩾ N ( η ), then maker has a strategy to guarantee m(M)⩾( 1 2 −η)n .