{"id":"https://openalex.org/W2766665194","doi":"https://doi.org/10.1109/tsp.2017.8076092","title":"Piecewise-Polynomial signal segmentation using reweighted convex optimization","display_name":"Piecewise-Polynomial signal segmentation using reweighted convex optimization","publication_year":2017,"publication_date":"2017-07-01","ids":{"openalex":"https://openalex.org/W2766665194","doi":"https://doi.org/10.1109/tsp.2017.8076092","mag":"2766665194"},"language":"en","primary_location":{"id":"doi:10.1109/tsp.2017.8076092","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tsp.2017.8076092","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 40th International Conference on Telecommunications and Signal Processing (TSP)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028788659","display_name":"Michaela Novosadov\u00e1","orcid":null},"institutions":[{"id":"https://openalex.org/I60587646","display_name":"Brno University of Technology","ror":"https://ror.org/03613d656","country_code":"CZ","type":"education","lineage":["https://openalex.org/I60587646"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Michaela Novosadova","raw_affiliation_strings":["Signal Processing Laboratory (SPLab), Brno University of Technology, Brno, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Signal Processing Laboratory (SPLab), Brno University of Technology, Brno, Czech Republic","institution_ids":["https://openalex.org/I60587646"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054854110","display_name":"Pavel Rajmic","orcid":"https://orcid.org/0000-0002-8381-4442"},"institutions":[{"id":"https://openalex.org/I60587646","display_name":"Brno University of Technology","ror":"https://ror.org/03613d656","country_code":"CZ","type":"education","lineage":["https://openalex.org/I60587646"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Pavel Rajmic","raw_affiliation_strings":["Signal Processing Laboratory (SPLab), Brno University of Technology, Brno, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Signal Processing Laboratory (SPLab), Brno University of Technology, Brno, Czech Republic","institution_ids":["https://openalex.org/I60587646"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5028788659"],"corresponding_institution_ids":["https://openalex.org/I60587646"],"apc_list":null,"apc_paid":null,"fwci":0.4802,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.64081321,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"21","issue":null,"first_page":"769","last_page":"774"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11236","display_name":"Control Systems and Identification","score":0.9944000244140625,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10136","display_name":"Statistical Methods and Inference","score":0.9915000200271606,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/piecewise","display_name":"Piecewise","score":0.8603357076644897},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.6142346858978271},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.5596541166305542},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5129156112670898},{"id":"https://openalex.org/keywords/noise","display_name":"Noise (video)","score":0.47708258032798767},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.46735572814941406},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4671596586704254},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46583500504493713},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44724953174591064},{"id":"https://openalex.org/keywords/segmentation","display_name":"Segmentation","score":0.4437962770462036},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4355507493019104},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.38725191354751587},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.35048824548721313},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.3311203718185425},{"id":"https://openalex.org/keywords/image","display_name":"Image (mathematics)","score":0.08227473497390747},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07136064767837524}],"concepts":[{"id":"https://openalex.org/C164660894","wikidata":"https://www.wikidata.org/wiki/Q2037833","display_name":"Piecewise","level":2,"score":0.8603357076644897},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.6142346858978271},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.5596541166305542},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5129156112670898},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.47708258032798767},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46735572814941406},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4671596586704254},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46583500504493713},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44724953174591064},{"id":"https://openalex.org/C89600930","wikidata":"https://www.wikidata.org/wiki/Q1423946","display_name":"Segmentation","level":2,"score":0.4437962770462036},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4355507493019104},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38725191354751587},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.35048824548721313},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.3311203718185425},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.08227473497390747},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07136064767837524},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tsp.2017.8076092","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tsp.2017.8076092","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 40th International Conference on Telecommunications and Signal Processing (TSP)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1547941176","https://openalex.org/W1575567117","https://openalex.org/W1591116419","https://openalex.org/W1813685547","https://openalex.org/W1922442141","https://openalex.org/W2013743275","https://openalex.org/W2054110507","https://openalex.org/W2078214343","https://openalex.org/W2089700840","https://openalex.org/W2092663520","https://openalex.org/W2107861471","https://openalex.org/W2116148865","https://openalex.org/W2154332973","https://openalex.org/W2557498652","https://openalex.org/W2560437693","https://openalex.org/W2783487770","https://openalex.org/W2962781485","https://openalex.org/W3099936673","https://openalex.org/W4235713725","https://openalex.org/W6634632683","https://openalex.org/W6748064500"],"related_works":["https://openalex.org/W2083007106","https://openalex.org/W2988866178","https://openalex.org/W1620850494","https://openalex.org/W3153752017","https://openalex.org/W2756132392","https://openalex.org/W3035814349","https://openalex.org/W4285101096","https://openalex.org/W4382725876","https://openalex.org/W2084892497","https://openalex.org/W2115614142"],"abstract_inverted_index":{"We":[0,67],"present":[1],"a":[2,6,29,43],"method":[3,41],"for":[4,57],"segmenting":[5],"one-dimensional":[7],"piecewise":[8],"polynomial":[9],"signal":[10],"corrupted":[11],"by":[12,37],"an":[13],"additive":[14],"noise.":[15],"The":[16,40],"method's":[17],"principal":[18],"part":[19],"is":[20,34],"based":[21],"on":[22,70],"sparse":[23],"modeling,":[24],"and":[25,72,75],"its":[26],"formulation":[27],"as":[28],"reweighted":[30],"convex":[31],"optimization":[32],"problem":[33],"solved":[35],"numerically":[36],"proximal":[38],"splitting.":[39],"solves":[42],"sequence":[44],"of":[45],"weighted":[46],"l":[47],"<sub":[48],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[49],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">21</sub>":[50],"-minimization":[51],"problems,":[52],"where":[53],"the":[54,58,64,77],"weights":[55],"used":[56],"next":[59],"iteration":[60],"are":[61],"computed":[62],"from":[63],"current":[65],"solution.":[66],"perform":[68],"experiments":[69],"simulated":[71],"real":[73],"data":[74],"discuss":[76],"results.":[78]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}