Abstract: In this paper, we present a comparative study of three
methods of 2D face recognition system such as: Iso-Geodesic Curves
(IGC), Geodesic Distance (GD) and Geodesic-Intensity Histogram
(GIH). These approaches are based on computing of geodesic
distance between points of facial surface and between facial curves.
In this study we represented the image at gray level as a 2D surface in
a 3D space, with the third coordinate proportional to the intensity
values of pixels. In the classifying step, we use: Neural Networks
(NN), K-Nearest Neighbor (KNN) and Support Vector Machines
(SVM). The images used in our experiments are from two wellknown
databases of face images ORL and YaleB. ORL data base was
used to evaluate the performance of methods under conditions where
the pose and sample size are varied, and the database YaleB was used
to examine the performance of the systems when the facial
expressions and lighting are varied.
Abstract: We present a new algorithm for nonlinear dimensionality reduction that consistently uses global information, and that enables understanding the intrinsic geometry of non-convex manifolds. Compared to methods that consider only local information, our method appears to be more robust to noise. Unlike most methods that incorporate global information, the proposed approach automatically handles non-convexity of the data manifold. We demonstrate the performance of our algorithm and compare it to state-of-the-art methods on synthetic as well as real data.
Abstract: Earlier studies in kinship networks have primarily
focused on observing the social relationships existing between family
relatives. In this study, we pre-identified hubs in the network to
investigate if they could play a catalyst role in the transfer of physical
information. We conducted a case study of a ceremony performed in
one of the families of a small Hindu community – the Uttar Rarhi
Kayasthas. Individuals (n = 168) who resided in 11 geographically
dispersed regions were contacted through our hub-based
representation. We found that using this representation, over 98% of
the individuals were successfully contacted within the stipulated
period. The network also demonstrated a small-world property, with
an average geodesic distance of 3.56.