the problem of eye detection in face images is very important for a large number of applications ranging from face recognition to gaze tracking. in this paper we propose a new algorithm for eyes detection. first, the face region is extracted from the image by skin-color information. second, horizontal projection in image is used to approximate region of the eye be obtained . at last, the eye ce...

In this paper we compare two recently proposed methods, FGMRES 5] and GMRESR 7], for the iterative solution of sparse linear systems with an unsymmetric nonsingular matrix. Both methods compute minimal residual approximations using preconditioners, which may be diierent from step to step. The insights resulting from this comparison lead to better variants of both methods.

Principal Components Analysis (PCA) is an appearance based technique used widely for the dimensionality reduction and it records a great performance in face recognition. PCA based approaches typically include two phases: training and classification (Draper et al 2003). In the training phase, an Eigen space is established from the training samples using PCA and the training face images are mappe...

Conditions for the construction of polynomial eigen–operators for the Hamiltonian of collective string field theories are explored. Such eigen–operators arise for only one monomial potential v(x) = μx2 in the collective field theory. They form a w∞– algebra isomorphic to the algebra of vertex operators in 2d gravity. Polynomial potentials of orders only strictly larger or smaller than 2 have no...

Following Futurism, we show how periodic motions can be represented by a small number of eigen-shapes that capture the whole dynamic mechanism of periodic motions. Spectral decomposition of a silhouette of an object in motion serves as a basis for behavior classiÿcation by principle component analysis. The boundary contour of the walking dog, for example, is ÿrst computed eÆciently and accurate...

In the theoretical part of this paper, we introduce a simplified proof technique for error bounds and convergence of a variation of E. Kansa’s well-known unsymmetric meshless collocation method. For a numerical implementation of the convergent variation, a previously proposed greedy technique is coupled with linear optimization. This algorithm allows a fully adaptive on-the-fly data-dependent m...