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.
43527681
Learning-based pulmonary nodule detection from multislice CT data
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.
121253028
Three-dimensional model based face recognition
The performance of face recognition systems that use two-dimensional (2D) images is dependent on consistent conditions such as lighting, pose and facial expression. We are developing a multi-view face recognition system that utilizes three-dimensional (3D) information about the face to make the system more robust to these variations. This work describes a procedure for constructing a database of 3D face models and matching this database to 2.5D face scans which are captured from different views, using coordinate system invariant properties of the facial surface. 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. A robust similarity metric is defined for matching, based on an iterative closest point (ICP) registration process. Results are given for matching a database of 18 3D face models with 113 2.5D face scans.
10976624
On the maximum induced forests of a connected cubic graph without triangles
Let t(G) denote cardinality of a maximum induced forest of a graph G with n vertices. For connected simple cubic graphs G without triangles, it is shown that t(G)?2n3 except for two particular graphs. This lower bound is sharp and it improves a result due to J.A. Bondy, et al. 1]. Using this result, we show that Ewald Speckenmeyer's Conjecture, i.e. t(G)?2n3 for all biconnected cubic graphs G with girth 4, is true, except for two particular graphs, which we describe.
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.
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.
550060
Automatic categorization of figures in scientific documents
Figures are very important non-textual information contained in scientific documents. Current digital libraries do not provide users tools to retrieve documents based on the information available within the figures. We propose architecture for retrieving documents by integrating figures and other information. The initial step in enabling integrated document search is to categorize figures into a set of pre-defined types. We propose several categories of figures based on their functionalities in scholarly articles. We have developed a machine-learning-based approach for automatic categorization of figures. Both global features, such as texture, and part features, such as lines, are utilized in the architecture for discriminating among figure categories. The proposed approach has been evaluated on a testbed document set collected from the CiteSeer scientific literature digital library. Experimental evaluation has demonstrated that our algorithms can produce acceptable results for real- world use. Our tools can be integrated into a scientific-document digital library
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.