{'fraction_non_alphanumeric': 0.008353221957040573, 'fraction_numerical': 0.0, 'mean_word_length': 5.877049180327869, '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}}
Emitter number detection based on clustering and the application of information theoretic criteria

An approach for determining the number of emitters for array processing is proposed based on the asymptotic distribution of eigenvalues of a sample covariance. Instead of using the set of the smallest eigenvalues, different eigenvalue groupings are used as the competing models. An information theoretic criterion is used for determining the optimal grouping. The approach is able to solve the eigenvalue correspondence problem associated with most emitter number detection algorithms and demonstrates an improved detection performance under certain circumstances. The approach is computationally more efficient than order statistics based approaches. Computer simulations are used to demonstrate the performance of the proposed approach.