Computing the 3D face recognition based on pseudo 2D Hidden Markov Models using geodesic distances

Author

Castellano, M. ; Mastronardi, G. ; Daleno, D. ; Cariello, L. ; Decataldo, G.

Author_Institution

Dept. of Electr. & Electron., Polytech. of Bari, Bari

fYear

2008

fDate

25-28 June 2008

Firstpage

335

Lastpage

338

Abstract

Face recognition is a very challenging issue and has attracted much attention over past decades. First a 3D mesh model of face is manipulated to calculate the geodesic distances on triangulated surface by the dasiafast marching on triangulated domainspsila (FMTD) numerical algorithm. Then these are processed by multidimensional scaling in order to embed the surface into a low dimensional space. Next, by using the so constructed canonical forms and a 3-6-6-6-3 structure of pseudo 2-D hidden Markov models, an interesting face recognition is carried out.

Keywords

computational geometry; face recognition; hidden Markov models; solid modelling; 3D face recognition; 3D mesh model; fast marching on triangulated domains numerical algorithm; geodesic distances; pseudo 2D hidden Markov models; triangulated surface; Biometrics; Costs; Face recognition; Geometry; Geophysics computing; Hidden Markov models; Multidimensional systems; Robustness; Security; Two dimensional displays; 3D Face Recognition; Fast Marching on Triangulated Domains; Geodesic Distances; Multidimensional Scaling; Pseudo 2-D Hidden Markov Models;

fLanguage

English

Publisher

ieee

Conference_Titel

Systems, Signals and Image Processing, 2008. IWSSIP 2008. 15th International Conference on

Conference_Location

Bratislava

Print_ISBN

978-80-227-2856-0

Electronic_ISBN

978-80-227-2880-5

Type

conf

DOI

10.1109/IWSSIP.2008.4604435

Filename

4604435