2.5d Elastic Graph Matching Algorithms
Abstract
In this paper, a series of advances in Elastic Graph Matching (EGM) for face recognition assisted by the availability of 3D facial geometry is proposed. More specifically, we conceptually extend the EGM algorithm in order to exploit the 3D nature of human facial geometry for face recognition/verification. In order to achieve that, first we extend the matching module of the EGM algorithm in order to capitalize on the 2.5D facial data. Moreover, we incorporate the 3D geometry into the multiscale analysis used and build a novel geodesic multiscale morphological pyramid of dilations/erosions in order to fill the graph jets. We demonstrate the efficiency of the proposed advances in the face recognition/verification problem.
Cite
Text
Zafeiriou et al. "2.5d Elastic Graph Matching Algorithms." IEEE/CVF International Conference on Computer Vision Workshops, 2009. doi:10.1109/ICCVW.2009.5457635Markdown
[Zafeiriou et al. "2.5d Elastic Graph Matching Algorithms." IEEE/CVF International Conference on Computer Vision Workshops, 2009.](https://mlanthology.org/iccvw/2009/zafeiriou2009iccvw-5d/) doi:10.1109/ICCVW.2009.5457635BibTeX
@inproceedings{zafeiriou2009iccvw-5d,
title = {{2.5d Elastic Graph Matching Algorithms}},
author = {Zafeiriou, Stefanos and Petrou, Maria and Argyriou, Vasileios},
booktitle = {IEEE/CVF International Conference on Computer Vision Workshops},
year = {2009},
pages = {703-710},
doi = {10.1109/ICCVW.2009.5457635},
url = {https://mlanthology.org/iccvw/2009/zafeiriou2009iccvw-5d/}
}