基于群稀疏性的分段多项式曲线拟合

2016 8th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT) Pub Date : 2016-10-01 DOI:10.1109/ICUMT.2016.7765379

Michaela Novosadová, P. Rajmic

{"title":"基于群稀疏性的分段多项式曲线拟合","authors":"Michaela Novosadová, P. Rajmic","doi":"10.1109/ICUMT.2016.7765379","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":174688,"journal":{"name":"2016 8th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Piecewise-polynomial curve fitting using group sparsity\",\"authors\":\"Michaela Novosadová, P. Rajmic\",\"doi\":\"10.1109/ICUMT.2016.7765379\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":174688,\"journal\":{\"name\":\"2016 8th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT)\",\"volume\":\"61 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 8th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICUMT.2016.7765379\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 8th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICUMT.2016.7765379","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 7

摘要

我们提出了一种分割一维信号的方法，它的片段被建模为多项式，并且被加性噪声破坏。该方法基于稀疏建模，并将其表述为一个凸优化问题，通过近端算法求解。我们在模拟数据上进行实验，讨论结果，并提出可能导致更好结果的未来方向。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2016 8th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT)

自引率

0.00%

发文量