Recognizing faces prone to occlusions and common variations using optimal face subgraphs

DOI10.1016/j.amc.2016.02.047zbMath1410.94012OpenAlexW2304134348MaRDI QIDQ1733428

Syaheerah Lebai Lutfi, Mohammed Azmi Al-Betar, Ibrahim Venkat, Badr Mohammed Lahasan, Philippe De Wilde

Publication date: 21 March 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://kar.kent.ac.uk/58070/1/lahasan%26al_pre_publication.pdf

zbMATH Keywords

optimizationface recognitiongraphical modelharmony searchocclusion

Mathematics Subject Classification ID

Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Uses Software

• FERET
• AR face

Cites Work

• Novel selection schemes for harmony search
• Memetic techniques for examination timetabling
• Novel derivative of harmony search algorithm for discrete design variables
• Face recognition using adaptively weighted patch PZM array from a single exemplar image per person
• A harmony search algorithm for university course timetabling
• Median null(\(S_w\))-based method for face feature recognition
• Graph Laplace for Occluded Face Completion and Recognition
• Structured Sparse Error Coding for Face Recognition With Occlusion
• Face Recognition Using Ensemble String Matching

This page was built for publication: Recognizing faces prone to occlusions and common variations using optimal face subgraphs