Topology Preserving Structural Matching for Automatic Partial Face Recognition

ABSTRACT:

In this paper, we propose a topology preserving graph matching (TPGM) method for partial face recognition. Most existing face recognition methods extract features from holistic facial images. However, faces in real-world unconstrained environments may be occluded by objects or other faces, which cannot provide the whole face images for description. Keypoint based partial face recognition methods such as multi-keypoint descriptor with Gabor ternary pattern (MKD-GTP) and robust point set matching (RPSM) match the local keypoints for partial face recognition. However, they simply measure the node-wise similarity without higher order geometric graph information, which are susceptible to noises. To address this, our TPGM method estimates a non-rigid transformation encoding the second order geometric structure of the graph, so that more accurate and robust correspondence can be computed with the topological information. In order to exploit higher order topological information, we propose a topology preserving structural matching (TPSM) method to construct a higher order structure for each face and estimate the transformation. Experimental results on four widely used face datasets demonstrate that our method outperforms most existing state-of-the-art face recognition methods.

PROJECT OUTPUT VIDEO:

SYSTEM REQUIREMENTS:

HARDWARE REQUIREMENTS:

• System           : Pentium Dual Core.

• Hard Disk      : 120 GB.

• Monitor          : 15’’ LED

• Input Devices : Keyboard, Mouse

• Ram                : 1GB.

SOFTWARE REQUIREMENTS:

• Operating system : Windows 7.

• Coding Language : MATLAB.

• Tool                      : MATLAB R2013A /2018

REFERENCE:

Yueqi Duan, Jiwen Lu, Senior Member, IEEE, Jianjiang Feng, Member, IEEE, and Jie Zhou, Senior Member, IEEE, “Topology Preserving Structural Matching for

Automatic Partial Face Recognition”, IEEE Transactions on Information Forensics and Security, 2018.