{'fraction_non_alphanumeric': 0.014672686230248307, 'fraction_numerical': 0.0, 'mean_word_length': 4.759740259740259, '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}}
All Iris Code Bits are Not Created Equal

Many iris recognition systems use filters to extract information about the texture of an iris image. In the Daugman-style approach, the filter output is mapped to a binary iris code. The normalized Hamming distance between two iris codes is computed and decisions about the identity of a person are based on the computed distance. The normalized Hamming distance weights all bits in an iris code equally. However, this work presents experimental evidence that all the bits in an iris code are not equally useful. Some bits are more consistent than others. An explanation of the cause of this discrepancy is given. Different regions of the iris are compared to evaluate their relative consistency. Finally, this paper investigates the theoretical impact of consistent and inconsistent bits on the false reject rate of an iris recognition system.