{'fraction_non_alphanumeric': 0.018465909090909092, 'fraction_numerical': 0.0, 'mean_word_length': 5.351351351351352, '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}}
An IFS based approach for face recognition

Nowadays face recognition is gaining great attention from the researcher respect to other biometrics, because it represents a good compromise between reliability and people acceptance. While this growth largely is driven by growing application demands, such as identification for law enforcement and authentication, for banking and security system access. The recognition task is difficult because of image variation in terms of position, size, expression, and pose. In this paper a new IFS based recognition method is presented. It exploits the IFS theory, largely studied in still image compression and indexing, but not enough for the face recognition task.