We propose a novel person verification system for real-time face identification. The main features of the system include accurate registration of face images using a robust form of correlation, a framework for global registration of a face database using a minimum spanning tree algorithm and a method for selecting a subset of features optimal for discrimination between clients and impostors. Th...

This paper proposes the integration of moment invariant and PCA for varied-pose face recognition. Firstly, the global feature is extracted by PCA for determine the minimum error. If error less than threshold, system will accepts the classification result from PCA. On the other hand, the system will rejects and moment invariant is used to analyze the local face such as nose and eyes. In the expe...

This study is limited to study of buckling analysis of a sandwich cylindrical shell with functionally graded face sheets and homogenous core. High-order sandwich plate theory is improved by considering the in-plane stresses of the core that usually are ignored in the analysis of sandwich structures. Assume that all properties of the face sheets and the core are temperature dependent. Strain com...

Eigenface approach is one of the simplest and most efficient methods for face recognition. In eigenface approach chosing the threshold, value is a very important factor for performance of face recognition. In addition, the dimensional reduction of face space depends upon number of eigenfaces taken. In this paper, an optimized solution for face recognition is given by taking the optimized value ...

Age.?Minimum, 18 ; maximum, 34; average, 233. Presentation.?Vertex, 30 ; pelvic, 2 ; face, 1. Position.?Left occipitoanterior, 23 ; right occipito-posterior, 5 ; right occipitoanterior, 2; left mento-auterior, 1; left sacroanterior, 1; right sacro-posterior, 1. Duration of Labour.?First stage: Minimum, 4 h. 30 m.; maximum, 62 h.; average, 15 h. 5 m. Second stage : Minimum, 25 m.; maximum, 6 h.:...

We study the problem of finding minimum multicuts for an undirected planar graph, where all the terminal vertices are on the boundary of the outer face. This is known as an Okamura-Seymour instance. We show that for such an instance, the minimum multicut problem can be reduced to the minimum-cost Steiner forest problem on a suitably defined dual graph. The minimum-cost Steiner forest problem ha...

The paper discusses the CodeSaw, social visualization software development for distributed software community. The software visualizes the distributed software development from two different perspectives: code repositories and project communication. As stated by the paper, open source software development differs from traditional development by lacking the face-to-face interactions, not having ...

We study the minimum cost path problem in an environment where the cost is direction-dependent (anisotropic). This problem arise in sailing, robotics, aircraft navigation, and routing of autonomous vehicles, where the cost is affected by the direction of waves, winds or slope of the terrain. We present an approximation algorithm to find a minimum cost path for a point robot moving in a planar s...