{'fraction_non_alphanumeric': 0.015873015873015872, 'fraction_numerical': 0.0, 'mean_word_length': 5.1415929203539825, '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}}
Using Random Matrix Theory to determine the number of endmembers in a hyperspectral image

Determining the number of spectral endmembers in a hyper-spectral image is an important step in the spectral unmixing process, and under- or overestimation of this number may lead to incorrect unmixing for unsupervised methods. In this paper we discuss a new method for determining the number of endmembers, using recent advances in Random Matrix Theory. This method is entirely unsupervised and is computationally cheaper than other existing methods. We apply our method to synthetic images, including a standard test image developed by Chein-I Chang, with good results for Gaussian independent noise.