{'fraction_non_alphanumeric': 0.02064516129032258, 'fraction_numerical': 0.0025806451612903226, 'mean_word_length': 5.747826086956522, '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}}
Sparsifying regularizations for stochastic sample average minimization in ultrasound computed tomography

Ultrasound computed tomography (USCT) is a promising imaging modality for breast cancer screening. Two challenges commonly arising in time-of-flight USCT are (1) to efficiently deal with large data sets and (2) to effectively mitigate the ill-posedness for an adequate reconstruction of the model. In this contribution, we develop an optimization strategy based on a stochastic descent method that adaptively subsamples the data, and analyze its performance in combination with different sparsity-enforcing regularization techniques. The algorithms are tested on numerical as well as real data obtained from synthetic phantom scans of the previous USCT Data Challenges.