Piecewise-polynomial signal segmentation using convex optimization
Kybernetika, Tome 53 (2017) no. 6, pp. 1131-1149
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library
A method is presented for segmenting one-dimensional signal whose independent segments are modeled as polynomials, and which is corrupted by additive noise. The method is based on sparse modeling, the main part is formulated as a convex optimization problem and is solved by a proximal splitting algorithm. We perform experiments on simulated and real data and show that the method is capable of reliably finding breakpoints in the signal, but requires careful tuning of the regularization parameters and internal parameters. Finally, potential extensions are discussed.
A method is presented for segmenting one-dimensional signal whose independent segments are modeled as polynomials, and which is corrupted by additive noise. The method is based on sparse modeling, the main part is formulated as a convex optimization problem and is solved by a proximal splitting algorithm. We perform experiments on simulated and real data and show that the method is capable of reliably finding breakpoints in the signal, but requires careful tuning of the regularization parameters and internal parameters. Finally, potential extensions are discussed.
DOI :
10.14736/kyb-2017-6-1131
Classification :
46N10, 47N10, 65K10, 90C25, 90C30, 90C90
Keywords: signal segmentation; denoising; sparsity; piecewise-polynomial signal model; convex optimization
Keywords: signal segmentation; denoising; sparsity; piecewise-polynomial signal model; convex optimization
@article{10_14736_kyb_2017_6_1131,
author = {Rajmic, Pavel and Novosadov\'a, Michaela and Da\v{n}kov\'a, Marie},
title = {Piecewise-polynomial signal segmentation using convex optimization},
journal = {Kybernetika},
pages = {1131--1149},
year = {2017},
volume = {53},
number = {6},
doi = {10.14736/kyb-2017-6-1131},
mrnumber = {3758939},
zbl = {06861645},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.14736/kyb-2017-6-1131/}
}
TY - JOUR AU - Rajmic, Pavel AU - Novosadová, Michaela AU - Daňková, Marie TI - Piecewise-polynomial signal segmentation using convex optimization JO - Kybernetika PY - 2017 SP - 1131 EP - 1149 VL - 53 IS - 6 UR - http://geodesic.mathdoc.fr/articles/10.14736/kyb-2017-6-1131/ DO - 10.14736/kyb-2017-6-1131 LA - en ID - 10_14736_kyb_2017_6_1131 ER -
%0 Journal Article %A Rajmic, Pavel %A Novosadová, Michaela %A Daňková, Marie %T Piecewise-polynomial signal segmentation using convex optimization %J Kybernetika %D 2017 %P 1131-1149 %V 53 %N 6 %U http://geodesic.mathdoc.fr/articles/10.14736/kyb-2017-6-1131/ %R 10.14736/kyb-2017-6-1131 %G en %F 10_14736_kyb_2017_6_1131
Rajmic, Pavel; Novosadová, Michaela; Daňková, Marie. Piecewise-polynomial signal segmentation using convex optimization. Kybernetika, Tome 53 (2017) no. 6, pp. 1131-1149. doi: 10.14736/kyb-2017-6-1131
Cité par Sources :