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%.
18993736
Matching 2.5D Scans for Face Recognition
The performance of face recognition systems that use two-dimensional images is dependent on consistent conditions such as lighting, pose, and facial appearance. We are developing a face recognition system that uses three-dimensional depth information to make the system more robust to these arbitrary conditions. We have developed a face matching system that automatically correlates points in three dimensions between two 2.5D range images of different views. A hybrid Iterative Closest Point (ICP) scheme is proposed to integrate two classical ICP algorithms for fine registration of the two scans. A robust similarity metric is defined for matching purpose. Results are provided on a preliminary database of 10 subjects (one training image per subject) containing frontal face images of neutral expression with a testing database of 63 scans that varied in pose, expression and lighting.
11312001
Face Recognition with 3D Model-Based Synthesis
Current appearance-based face recognition system encounters the difficulty to recognize faces with appearance variations, while only a small number of training images are available. We present a scheme based on the analysis by synthesis framework. A 3D generic face model is aligned onto a given frontal face image. A number of synthetic face images are generated with appearance variations from the aligned 3D face model. These synthesized images are used to construct an affine subspace for each subject. Training and test images for each subject are represented in the same way in such a subspace. Face recognition is achieved by minimizing the distance between the subspace of a test subject and that of each subject in the database. Only a single face image of each subject is available for training in our experiments. Preliminary experimental results are promising.
5605322
Multimodal Facial Gender and Ethnicity Identification
Human faces provide demographic information, such as gender and ethnicity. Different modalities of human faces, e.g., range and intensity, provide different cues for gender and ethnicity identifications. In this paper we exploit the range information of human faces for ethnicity identification using a support vector machine. An integration scheme is also proposed for ethnicity and gender identifications by combining the registered range and intensity images. The experiments are conducted on a database containing 1240 facial scans of 376 subjects. It is demonstrated that the range modality provides competitive discriminative power on ethnicity and gender identifications to the intensity modality. For both gender and ethnicity identifications, the proposed integration scheme outperforms each individual modality.
17264261
Matching 2.5D face scans to 3D models
The performance of face recognition systems that use two-dimensional images depends on factors such as lighting and subject's pose. We are developing a face recognition system that utilizes three-dimensional shape information to make the system more robust to arbitrary pose and lighting. For each subject, a 3D face model is constructed by integrating several 2.5D face scans which are captured from different views. 2.5D is a simplified 3D (x,y,z) surface representation that contains at most one depth value (z direction) for every point in the (x, y) plane. Two different modalities provided by the facial scan, namely, shape and texture, are utilized and integrated for face matching. 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 from the gallery 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. Three-dimensional models in the gallery are used to synthesize new appearance samples with pose and illumination variations and the synthesized face images are used in discriminant subspace analysis. The weighted sum rule is applied to combine the scores given by the two matching components. Experimental results are given for matching a database of 200 3D face models with 598 2.5D independent test scans acquired under different pose and some lighting and expression changes. These results show the feasibility of the proposed matching scheme.
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.
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.
59108819
Agent-Based Rating Oriented Information Provision and Reallocation for High-Assurance in Open and Dynamic Environments
In order to meet the heterogeneous requirementsfrom service providers and users simultaneously, thereis an urgent need for a new information service system.After studying the characteristics of the users' accessing,that popularity of information utilization generallyexists in information system is focused. Thispaper introduces a rating oriented distributed informationsystem sustained by push/pull mobile agents for informationservice provision and utilization. Based onthis environment, autonomous information allocationtechnology is proposed. However, when users' demandchanges, congestion might arise in the system. In orderto achieve load balance for users' timeliness accessand guarantee that users can always get the informationfrom a certain pathway, autonomous informationreallocation technology is proposed. Through the comparisonsimulation to the conventional system, the effectivenessof proposed system is proved.
20901797
Decentralized workload management for assurance according to heterogeneous service levels
Due to the advent of electronic commerce, the service provider can offer the customer a Service Level Agreement (SLA) to distinguish itself in today's competitive market. Different users require different levels of service in terms of information consumption or response time, appearing a need of a system able to assure the heterogeneous service levels of the users in such a mission-critical environment. In this paper, we propose an information service infrastructure based on the Faded Information Field (FIF), a distributed service replica network founded on push/pull mobile agent technology. The cooperation between the autonomous agents and the nodes allows the online maintenance and auto-reconstruction of the FIF system in order to satisfy the different timely requirements of each user even in an ever-changing environment. Moreover, the system is able to provide different maximum information volume according to the user's service level, a double-sided feature that benefits to both the provider's business strategy and the differentiated timeliness access technology presented on this paper. The effectiveness of the proposed technology has been proved through evaluation and the simulation results show that the system is able to adapt and satisfy the different requirements of timeliness and the different levels of information volume required by each user under changing workloads, compared with 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 .
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.