{'fraction_non_alphanumeric': 0.021346469622331693, 'fraction_numerical': 0.0, 'mean_word_length': 5.161616161616162, '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}}
Convex cone volume analysis for finding endmembers in hyperspectral imagery

This paper presents a new approach, called convex cone volume analysis (CCVA), which can be considered as a partially constrained-abundance (abundance non-negativity constraint) technique to find endmembers. It can be shown that finding the maximal volume of a convex cone in the original data space is equivalent to finding the maximal volume of a simplex in a hyperplane. As a result, the CCVA can take advantage of many recently developed fast computational algorithms developed for N-FINDR to derive their counterparts for CCVA.