{'fraction_non_alphanumeric': 0.01160541586073501, 'fraction_numerical': 0.0, 'mean_word_length': 5.166666666666667, '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}}
New generation Stokes inversion codes

Abstract We utilize the concept of sparsity or compressibility to develop an new generation of inversion codes for the Stokes parameters. The inversion code uses numerical optimization techniques based on the idea of proximal algorithms to impose sparsity. In so doing, we allow to exploit the presence of spatial correlation on the maps of physical parameters. Sparsity also regularizes the solution by reducing the number of unknowns. The solution has an increased robustness.