Piecewise-polynomial Signal Segmentation Using Convex Optimization

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26220%2F17%3APU124495" target="_blank" >RIV/00216305:26220/17:PU124495 - isvavai.cz</a>
Result on the web
<a href="https://www.kybernetika.cz/content/2017/6/1131" target="_blank" >https://www.kybernetika.cz/content/2017/6/1131</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.14736/kyb-2017-6-1131" target="_blank" >10.14736/kyb-2017-6-1131</a>

Result language
angličtina
Original language name
Piecewise-polynomial Signal Segmentation Using Convex Optimization
Original language description
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.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
20201 - Electrical and electronic engineering

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2017
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)