Piecewise-polynomial Signal Segmentation Using Reweighted Convex Optimization

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26220%2F17%3APU123542" target="_blank" >RIV/00216305:26220/17:PU123542 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1109/TSP.2017.8076092" target="_blank" >http://dx.doi.org/10.1109/TSP.2017.8076092</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/TSP.2017.8076092" target="_blank" >10.1109/TSP.2017.8076092</a>

Result language
angličtina
Original language name
Piecewise-polynomial Signal Segmentation Using Reweighted Convex Optimization
Original language description
We present a method for segmenting a one-dimensional piecewise polynomial signal corrupted by an additive noise. The method’s principal part is based on sparse modeling, and its formulation as a reweighted convex optimization problem is solved numerically by proximal splitting. The method solves a sequence of weighted `21-minimization problems, where the weights used for the next iteration are computed from the current solution.We perform experiments on simulated and real data and discuss the results.
Czech name
—
Czech description
—

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ů

Article name in the collection
Proceedings of the 40th International Conference on Telecommunications and Signal Processing (TSP) 2017
ISBN
978-1-5090-3981-4
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
769-774
Publisher name
Neuveden
Place of publication
Barcelona
Event location
Barcelona
Event date
Jul 5, 2017
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000425229000163

Similar results(10)