Dense 3D Face Correspondence
Syed Zulqarnain Gilani, Ajmal Mian, Faisal Shafait, Ian Reid

TL;DR
This paper introduces an automated algorithm for establishing dense correspondences between 3D faces, constructing a deformable model, and fitting it to new faces, achieving high accuracy in face recognition and landmark detection.
Contribution
The paper presents a novel iterative method for dense 3D face correspondence, deformable model construction, and fitting that improves accuracy and generalizes well across datasets.
Findings
Mean localization error of 1.28mm on synthetic faces.
98.5% face recognition accuracy on FRGCv2.
Effective generalization to unseen datasets.
Abstract
We present an algorithm that automatically establishes dense correspondences between a large number of 3D faces. Starting from automatically detected sparse correspondences on the outer boundary of 3D faces, the algorithm triangulates existing correspondences and expands them iteratively by matching points of distinctive surface curvature along the triangle edges. After exhausting keypoint matches, further correspondences are established by generating evenly distributed points within triangles by evolving level set geodesic curves from the centroids of large triangles. A deformable model (K3DM) is constructed from the dense corresponded faces and an algorithm is proposed for morphing the K3DM to fit unseen faces. This algorithm iterates between rigid alignment of an unseen face followed by regularized morphing of the deformable model. We have extensively evaluated the proposed…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
