Face recognition using threshold string representation matching under unconstrained conditions
This paper introduces a new approach called the threshold string representation matching (TSRM) algorithm, designed to enhance face identification and verification in scenarios by partial occlusions like sunglasses, scarves, and caps. The TSRM algorithm innovatively manipulates pixel features by calculating the difference between the centre pixel and its neighbours rather than relying on the traditional feature compression method (CSM-RL), where pixel difference is taken row-wise. This technique also improves the robustness of facial expression recognition by focusing on localised spatial relationships within the image patches. Our algorithm provides a novel feature-matching algorithm which effectively matches the prob image with the gallery image in the occlusion condition. We evaluated our proposed TSRM approach on two public face datasets: the AR dataset, which includes natural occlusion, and the ORL dataset, for synthetic occlusion.
Authors
- Srikanta Patnaik (ORCID: https://orcid.org/0000-0001-8297-0614)
- Manisha Kumari Meena
- Hemant Kumar Meena (ORCID: https://orcid.org/0000-0002-7084-3682)
- Gurpinder Singh
Institutions
- Malaviya National Institute of Technology Jaipur (IN)
- Indian Institute of Technology Bhubaneswar (IN)
Publication Details
- Journal
- International Journal of Intelligent Systems Technologies and Applications
- Published
- 2025-01-01
- DOI
- https://doi.org/10.1504/ijista.2025.148889
- Primary Topic
- Face and Expression Recognition
- Type
- article
- Field-Weighted Citation Impact
- 0.00