{'fraction_non_alphanumeric': 0.01735357917570499, 'fraction_numerical': 0.0, 'mean_word_length': 5.243243243243243, '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}}
Piecewise-polynomial curve fitting using group sparsity

We present a method for segmenting one-dimensional signal, whose segments are modeled as polynomials, and which is corrupted by an additive noise. The method is based on sparse modeling and its formulation as a convex optimization problem is solved by proximal algorithms. We perform experiments on simulated data, discuss the results and suggest future directions that could lead to even better results.