An Efficient Hyperdimensional Computing Paradigm for Face Recognition

3Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.

Abstract

In this paper, a combined framework is proposed that includes Hyperdimensional (HD) computing, neural networks, and k-means clustering to fulfill a computationally simple incremental learning framework in a facial recognition system. The main advantages of HD computing algorithms are the simple computations needed, the high resistance to noise,and the ability to store excessive amounts of information into a single HD vector. The problem of incremental learning revolves around the ability to regularly update the knowledge within the framework to include new subjects in an online manner. Using an HD computing classifier proved efficient and highly accurate to implement an incremental learning framework as no re-training was required after each online update to the framework wbich is HD computing biggest advantage. Another advantage is that HD computing classifiers can achieve a high degree of generalization. The framework was tested on a total of 11 open source benchmark data sets. A number of experimental tests were preformed to ensure consistent performance of the framework under different conditions against different data sets.

Cite

CITATION STYLE

APA

Yasser, M., Hussain, K. F., & Ali, S. A. E. F. (2022). An Efficient Hyperdimensional Computing Paradigm for Face Recognition. IEEE Access, 10, 85170–85179. https://doi.org/10.1109/ACCESS.2022.3197668

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free