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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Face recognition using threshold string representation matching under unconstrained conditions

Srikanta Patnaik, Manisha Kumari Meena, Hemant Kumar Meena, Gurpinder Singh
International Journal of Intelligent Systems Technologies and Applications
Face and Expression Recognition
article

Face recognition using threshold string representation matching under unconstrained conditions

Srikanta Patnaik, Manisha Kumari Meena, Hemant Kumar Meena, Gurpinder Singh
article en

Abstract

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.

International Journal of Intelligent Systems Technologies and ApplicationsVol. 23(3)
Malaviya National Institute of Technology Jaipur (IN), Indian Institute of Technology Bhubaneswar (IN)
Openalex Percentile: Top 73%
Face and Expression Recognition
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.