{'fraction_non_alphanumeric': 0.01701093560145808, 'fraction_numerical': 0.0, 'mean_word_length': 5.983050847457627, '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}}
Image registration using entropic graph-matching criteria

Image registration requires the specification of a class of discriminatory image features and an appropriate image dissimilarity measure. Entropic spanning graphs produce a consistent estimator of feature entropy and divergence. Direct estimators with non-parametric "plug-in" density estimators, on single pixels and independent image component feature vectors are compared. A technique for minimum spanning tree construction with significantly lower memory and time complexity is investigated. On the basis of misregistration errors with decreasing SNR, the minimal graph entropy estimator can have better performance than indirect estimators. In general, misregistration errors are lower with higher dimensional ICA feature vectors as compared to single pixels.