A New Extracted Features to Recognize Faces Effected by Occlusions and Common Variations
DOI:
https://doi.org/10.37934/araset.57.1.211239Keywords:
EBGM, Greedy algorithm, Face graph, JetAbstract
Face recognition from non-identical face photos is a prominent area of research in pattern recognition and computer vision. Existing face recognition systems struggle with diverse changes like lighting conditions, expressions, and facial occlusions. This paper proposes a new Face Recognition (FR) approach that combines the Elastic Bunch Graph Matching (EBGM) approach with the greedy algorithm to automatically identify face landmarks. The proposed approach independently selects each optimal landmark of face image from different corresponding face images where the corresponding landmark of corresponding face image which achieves the best similarity is used rather than using one or at most two corresponding face images and computing the average between both. The locations of corresponding landmarks can be displaced to achieve maximum similarity with optimal landmarks. This proposed approach demonstrates improved recognition performance compared to contemporary face recognition methods. It effectively handles changing ratios of face parts and can recognize faces even with increasing occlusion sizes.