{'fraction_non_alphanumeric': 0.013256006628003313, 'fraction_numerical': 0.0008285004142502071, 'mean_word_length': 5.163265306122449, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Efficient multi-algorithmic approaches for face recognition using subspace methods

Face recognition is an active research in the field of biometrics due to its potential benefits to various security based applications. To make the results of face recognition unsusceptible to different kinds of variations in the image and to enhance the accuracy, robustness of two or more methods can be fused in a single framework. The fusion can be achieved at various levels. Objective of this paper is to suggest optimal fusion of subspace methods to achieve robust results for various test conditions. This is achieved by performing feature level fusion of popular subspace methods namely PCA, LDA, LPP and ICA1. The Fusion is performed by considering different combinations of set of two, three and four subspace methods. Experiments are conducted by using two different databases: ORL and Yale. Experimental results suggest that by the fusion of these subspace approaches; there is a significant improvement in the accuracy compared to performance of an individual subspace method. This work helped us to determine the optimal combination of subspace methods to achieve robust results for specific test conditions.