3D face database for human pattern recognition

2008 ◽  
Author(s):  
LiMei Song ◽  
Lu Lu
Author(s):  
Xiaoni Wang ◽  

This study proposes an iterative closest shape point (ICSP) registration method based on regional shape maps for 3D face recognition. A neutral expression image randomly selected from a face database is considered as the reference face. The point-to-point correspondences between the input face and the reference face are achieved by constructing the points’ regional shape maps. The distance between corresponding point pairs is then minimized by iterating through the correspondence findings and coordinate transformations. The vectors composed of the closest shape points obtained in the last iteration are regarded as the feature vectors of the input face. These 3D face feature vectors are finally used for both training and recognition using the Fisherface method. Experiments are conducted using the 3D face database maintained by the Chinese Academy of Science Institute of Automation (CASIA). The results show that the proposed method can effectively improve 3D face recognition performance.


Author(s):  
Wang Yushun ◽  
Zhuang Yueting

Online interaction with 3D facial animation is an alternative way of face-to-face communication for distance education. 3D facial modeling is essential for virtual educational environments establishment. This article presents a novel 3D facial modeling solution that facilitates quasi-facial communication for online learning. Our algorithm builds 3D facial models from a single image, with support of a 3D face database. First from the image, we extract a set of feature points, which are then used to automatically estimate the head pose parameters using the 3D mean face in our database as a reference model. After the pose recovery, a similarity measurement function is proposed to locate the neighborhood for the given image in the 3D face database. The scope of neighborhood can be determined adaptively using our cross-validation algorithm. Furthermore, the individual 3D shape is synthesized by neighborhood interpolation. Texture mapping is achieved based on feature points. The experimental results show that our algorithm can robustly produce 3D facial models from images captured in various scenarios to enhance the lifelikeness in distant learning.


Author(s):  
Yuxiao Hu ◽  
Zhenqiu Zhang ◽  
Xun Xu ◽  
Yun Fu ◽  
Thomas S. Huang

2010 ◽  
pp. 727-737
Author(s):  
Yushun Wang ◽  
Yueting Zhuang

Online interaction with 3D facial animation is an alternative way of face-to-face communication for distance education. 3D facial modeling is essential for virtual educational environments establishment. This article presents a novel 3D facial modeling solution that facilitates quasi-facialcommunication for online learning. Our algorithm builds 3D facial models from a single image, with support of a 3D face database. First from the image, we extract a set of feature points, which are then used to automatically estimate the head pose parameters using the 3D mean face in our database as a reference model. After the pose recovery, a similarity measurement function is proposed to locate the neighborhood for the given image in the 3D face database. The scope of neighborhood can be determined adaptivelyusing our cross-validation algorithm. Furthermore, the individual 3D shape is synthesized by neighborhood interpolation. Texture mapping is achieved based on feature points. The experimental results show that our algorithm can robustly produce 3D facial models from images captured in various scenarios to enhance the lifelikeness in distant learning.


2018 ◽  
Vol 81 (2) ◽  
pp. 202-223 ◽  
Author(s):  
Petra Urbanová ◽  
Zuzana Ferková ◽  
Marie Jandová ◽  
Mikoláš Jurda ◽  
Dominik Černý ◽  
...  

Abstract Face databases have assumed an important role in a variety of clinical and applied research domains. However, the number of datasets accessible to the scientific community is limited and the knowledge of their existence may be concealed from a wider range of specialists. In the present paper we introduce a sizeable dataset of 3D facial scans - FIDENTIS 3D Face Database (F3D-FD or FIDENTIS Database), which is accompanied by basic demographic and descriptive data. The database is structured according to recorded subjects, and comprises single-scan entries as well as a smaller number of multiscan entries. The multi-scan entries vary in the time passed between recording sessions and in the devices employed to collect the 3D data. The total number of 2476 individuals puts our database within the category of large-scale databases. The 3D scans are accessible through a web-based interface at www. fidentis.cz. A licensed version of the database is available to interested parties upon signing a license agreement. Because of its varied composition, and low target-specificity the database has capacity to be of great assistance for the worldwide research community.


2011 ◽  
Vol 48-49 ◽  
pp. 280-283
Author(s):  
Xin Xin Li ◽  
Xun Gong

This paper presents a new point matching method to solve the dense point-to-point alignment of scanned 3D faces. Texture maps of 3D models are generated at first by unwrapping 3D faces to 2D space. Then, we build planar templates based on the mean shape computed by a group of annotated texture map. 34 landmarks on the unwrapped texture images are located by AAM and the final correspondence is built according to the templates. Comparing to the traditional algorithms, the presented point matching method can achieve good matching accuracy and stability.


2011 ◽  
Author(s):  
Qun Wang ◽  
Jiang Li ◽  
Vijayan K. Asari ◽  
Mohammad A. Karim

2013 ◽  
Vol 462-463 ◽  
pp. 452-457 ◽  
Author(s):  
Qi Rong Zhang ◽  
Jia Nan Gu ◽  
Ming Fu Zhang

Li et al. [Pattern Recognition 41 (2008) 3287 -- 329 proposed the constrained maximum variance mapping method. The CMVM is globally maximizing the distances between different manifolds. We find out that globally minimizing the distances between the same manifolds can have better recognition than CMVM method on the Yale face database, ORL face database and UMIST face database. Hence we propose to use an inverse constrained maximum variance mapping method (ICMVM) which can be seen as the inverse Laplacian Fisher discriminate criteria. Experiment results suggest that this new approach performs well.


Sign in / Sign up

Export Citation Format

Share Document