PENDETEKSIAN TITIK – TITIK JANGKAR UNTUK VERIFIKASI FACE 3D

Dahlan Abdullah, Safwandi Safwandi

Abstract


This paper outlines methods to detect key anchor points in 3D face scanner data. These anchor points can be used to estimate the pose and then match the test image to a 3D face model. We present two algorithms for detecting face anchor points in the context of face verification; One for frontal images and one for arbitrary pose. We achieve 99% success in finding anchor points in frontal images and 86% success in scans with large variations in pose and changes in expression. These results demonstrate the challenges in 3D face recognition under arbitrary pose and expression. We are currently working on robust fitting algorithms to localize more precisely the anchor points for arbitrary pose images.

Full Text:

PDF

References


. R. Bartak. Theory and practice of constraint propagation. In CPDC2001 Workshop, pages 7–14, Gliwice, 2001.

. P. Besl and N. McKay. A method for registration of 3-d

shapes. IEEE Trans. PAMI, 14(2):239–256, 1992.

. V. Blanz and T. Vetter. Face recognition based on fitting a 3d

morphable model. IEEE Trans. PAMI, 25(9):1063–1074, 2003.

. C. Boehnen and T. Russ. A fast multi-modal approach to

facial feature detection. In Workshop on Applications of Computer Vision, 2004.

. K. I. Chang, K. W. Bowyer, and P. J. Flynn. An evaluation of

multimodal 2d+3d face biometrics. IEEE Trans. PAMI, 27(4):619–624, 2005.

. C. Dorai and A. Jain. Cosmos - a representation scheme for

d free-form objects. IEEE Trans. PAMI, 19(10):1115–1130,




DOI: https://doi.org/10.29103/techsi.v4i1.109

Article Metrics

 Abstract Views : 135 times
 PDF Downloaded : 3 times

Refbacks

  • There are currently no refbacks.


Copyright (c) 2012 Dahlan Abdullah, Safwandi Safwandi

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

 


Indexed by:

          

Google Scholar
   
 

 


© Copyright of Journal TECHSI, (e-ISSN:2614-6029, p-ISSN:2302-4836).

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.