{'fraction_non_alphanumeric': 0.021814006888633754, 'fraction_numerical': 0.0, 'mean_word_length': 5.556390977443609, '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}}
Robust face recognition via double low-rank matrix recovery for feature extraction

Feature extraction is one of the most fundamental problems in face recognition tasks. In this paper, motivated by low-rank representation (LRR) model on exploring the multiple subspace structures of observation data, we propose a double low-rank matrix recovery method to learn low-rank subspaces from face images, where it takes into account the recovery of row space and column space information simultaneously. Applying Augmented Lagrangian Multiplier (ALM), the optimization problem on minimization of nuclear norm is resolved efficiently. By evaluating on public face databases, experimental results show that our proposed method works much better than existing face recognition methods based on feature extraction. It is more robust to outliers, varying illumination and occlusion.