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

DOI10.1016/J.AMC.2016.02.047MaRDI QIDQ1733428zbMATH OpenOpenAlexFDO

Authors Badr Mohammed Lahasan, Ibrahim Venkat, Mohammed Azmi Al-Betar, Syaheerah Lebai Lutfi, 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

face recognitiongraphical modelharmony searchocclusionoptimization

Mathematics Subject Classification ID

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

Recommendations

• A connectionist computational method for face recognition
• AI 2005: Advances in Artificial Intelligence
• scientific article; zbMATH DE number 938483
• Occlusion invariant face recognition using mean based weight matrix and support vector machine
• Shape and texture based face recognition on overlapping 3D sub-regions

Cites work

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

Cited in

(1)

• Occlusion robust face recognition with scattering operator in gradient domain

Describes a project that uses

Uses Software

• FERET
• AR face

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1733428)