{'fraction_non_alphanumeric': 0.01166489925768823, 'fraction_numerical': 0.0, 'mean_word_length': 5.601398601398602, '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}}
Application of diametrical clustering to tree-based matching pursuit for sinusoidal modeling

This paper deals with the application of Diametrical Clustering to the design of structured dictionaries in order to reduce the computational complexity of the Matching Pursuit algorithm for sinusoidal modeling. Diametrical Clustering organizes the dictionary in clusters, so that the similarity measure (average squared correlation coefficient between two atoms) is maximized. The optimal centroids are the dominant right singular vectors of the average correlation matrix of the atoms in the cluster. Some experiments are presented which show the suitability of this clustering algorithm, because the correlations of the atoms in a cluster with its centroid are much higher than the correlations with the centroids of other cluster. A dictionary of sinusoids has been divided in four clusters, and the centroids have been obtained and represented.