{'fraction_non_alphanumeric': 0.017475728155339806, 'fraction_numerical': 0.0, 'mean_word_length': 5.44375, '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}}
Face recognition under variable illumination via sparse representation of patches

The objective of this work is to recognize faces under variations in illumination. Previous works have indicated that the variations in illumination can dramatically reduce the performance of face recognition. To this end，an efficient method for face recognition which is robust under variable illumination is proposed in this paper. First of all, a discrete cosine transform(DCT) in the logarithm domain is employed to preprocess the images, removing the illumination variations by discarding an appropriate number of low-frequency DCT coefficients. Then, a face image is partitioned into several patches, and we classify the patches using Sparse Representation-based Classification, respectively. At last, the identity of a test image can be determined by the classification results of its patches. Experimental results on the Yale B database and the CMU PIE database show that excellent recognition rates can be achieved by the proposed method.