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.