.png){kind=icon}
Return
Reference Face Graph for Face Recognition
.png){kind=icon}
OA
AI
DOI：10.1109/TIFS.2014.2359548.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Face recognition has been studied extensively; however, real-world face recognition still remains a challenging task. The demand for unconstrained practical face recognition is rising with the explosion of online multimedia such as social networks, and video surveillance footage where face analysis is of significant importance. In this paper, we approach face recognition in the context of graph theory. We recognize an unknown face using an external reference face graph (RFC). An REG is generated and recognition of a given face is achieved by comparing it to the faces in the constructed RFC. Centrality measures are utilized to identify distinctive faces in the reference face graph. The proposed RFC-based face recognition algorithm is robust to the changes in pose and it is also alignment free. The REG recognition is used in conjunction with DCT locality sensitive hashing for efficient retrieval to ensure scalability. Experiments are conducted on several publicly available databases and the results show that the proposed approach outperforms the state-of-the-art methods without any preprocessing necessities such as face alignment. Due to the richness in the reference set construction, the proposed method can also handle illumination and expression variation.
Keywords:
Face recognition
graph analysis
centrality measure
alignment-free
pose robust
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8
Papers:
5.3K
Citations:
2.3W
Organization
View more organizations
Cited Papers
ShareSave
ShareSaveFace identification using reference-based features with message passing model.png)
NEUROCOMPUTINGOAAI
NEUROCOMPUTINGIF6.5
OAAIShareSaveShareSaveShareSaveShareSaveShareSave View more