{'fraction_non_alphanumeric': 0.01740139211136891, 'fraction_numerical': 0.002320185614849188, 'mean_word_length': 5.440298507462686, '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}}
Recovery of Linearly Mixed Sparse Sources from Multiple Measurement Vectors Using L1-Minimization

Multiple measurement vector (MMV) enables joint sparse recovery which can be applied in wide range of applications. Traditional MMV algorithms assume that the solution has independent columns or correlation among the columns. This assumption is not accurate for applications like signal estimation in photoplethysmography (PPG). In this paper, we consider a structure for the solution matrix decomposed into a sparse matrix with independent columns and a square mixing matrix. Based on this structure, we find the uniqueness condition for l1minimization. Moreover, an algorithm is proposed that provides a new cost function based on the new structure. It is shown that the new structure increases the recovery performance especially in low number of measurements.