{'fraction_non_alphanumeric': 0.027555555555555555, 'fraction_numerical': 0.0035555555555555557, 'mean_word_length': 5.3977272727272725, '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}}
Fast, variation-based methods for the analysis of extended brain sources

Identifying the location and spatial extent of several highly correlated and simultaneously active brain sources from electroencephalographic (EEG) recordings and extracting the corresponding brain signals is a challenging problem. In a recent comparison of source imaging techniques, the VB-SCCD algorithm, which exploits the sparsity of the variational map of the sources, proved to be a promising approach. In this paper, we propose several ways to improve this method. In order to adjust the size of the estimated sources, we add a regularization term that imposes sparsity in the original source domain. Furthermore, we demonstrate the application of ADMM, which permits to efficiently solve the optimization problem. Finally, we also consider the exploitation of the temporal structure of the data by employing L1;2-norm regularization. The performance of the resulting algorithm, called L1;2-SVB-SCCD, is evaluated based on realistic simulations in comparison to VB-SCCD and several state-of-the-art techniques for extended source localization.