{'fraction_non_alphanumeric': 0.018950437317784258, 'fraction_numerical': 0.0, 'mean_word_length': 5.420560747663552, '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}}
On the performance of sparse unmixing on non-linear mixtures

This paper explores the performance of sparse unmixing (SU) on non-linear mixtures. We consider SU as an endmember selection method from a spectral library and measure its performance using recently proposed approximately perfect recovery condition for sparse unmixing, comparing with non-negative least squares (NNLS). We also further explore the effect of thresholding on SU and NNLS. Simulations on various kinds of non-linear mixtures and an experiment on real hyperspectral data show that thresholding greatly improves the performance in endmember selection and NNLS could outperform SU when combined with thresholding.