On the Limitation of Convex Optimization for Sparse Signal Segmentation

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

Result language
angličtina
Original language name
On the Limitation of Convex Optimization for Sparse Signal Segmentation
Original language description
We show that convex optimization methods have fundamental properties that complicate performing signal segmentation based on sparsity assumptions. We review the recently introduced overcomplete sparse segmentation model, we perform experiments revealing the limits, and we explain this behaviour. We also propose modifications and alternatives.
Czech name
—
Czech description
—

Project
<a href="/en/project/GA16-13830S" target="_blank" >GA16-13830S: Magnetic resonance perfusion imaging using compressed sensing</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2016
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 39th International Conference on Telecommunications and Signal Processing (TSP) 2016
ISBN
978-1-5090-1288-6
ISSN
—
e-ISSN
—
Number of pages
5
Pages from-to
550-554
Publisher name
Neuveden
Place of publication
Neuveden
Event location
Vídeň
Event date
Jun 27, 2016
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000390164000120

Similar results(10)