Algebraic compressed sensing
DC Element | Wert | Sprache |
---|---|---|
dc.contributor.author | Breiding, Paul | |
dc.contributor.author | Gesmundo, Fulvio | |
dc.contributor.author | Michalek, Mateusz | |
dc.contributor.author | Vannieuwenhoven, Nick | |
dc.date.accessioned | 2023-07-12T06:56:58Z | - |
dc.date.available | 2023-07-12T06:56:58Z | - |
dc.date.issued | 2023 | |
dc.identifier.issn | 1063-5203 | |
dc.identifier.uri | http://osnascholar.ub.uni-osnabrueck.de/handle/unios/71961 | - |
dc.description.abstract | We introduce the broad subclass of algebraic compressed sensing problems, where structured signals are modeled either explicitly or implicitly via polynomials. This includes, for instance, low-rank matrix and tensor recovery. We employ powerful techniques from algebraic geometry to study well-posedness of sufficiently general compressed sensing problems, including existence, local recoverability, global uniqueness, and local smoothness. Our main results are summarized in thirteen questions and answers in algebraic compressed sensing. Most of our answers concerning the minimum number of required measurements for existence, recoverability, and uniqueness of algebraic compressed sensing problems are optimal and depend only on the dimension of the model.(c) 2023 Elsevier Inc. All rights reserved. | |
dc.description.sponsorship | Deutsche Forschungsgemeinschaft (DFG) [467575307, 445466444]; Postdoctoral Fellowship of the Research Foundation Flanders (Research Foundation Flanders) [12E8119N]; Internal Funds KU Leuven BOF [STG/19/002]; Supported by the Deutsche Forschungsgemeinschaft (DFG) - Projektnummer 445466444. Supported by the Deutsche Forschungsgemeinschaft (DFG) - Projektnummer 467575307. Partially supported by a Postdoctoral Fellowship of the Research Foundation Flanders (Research Foundation Flanders) with project 12E8119N. Partially supported by Internal Funds KU Leuven BOF STG/19/002. | |
dc.language.iso | en | |
dc.publisher | ACADEMIC PRESS INC ELSEVIER SCIENCE | |
dc.relation.ispartof | APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS | |
dc.subject | Algebraic compressed sensing | |
dc.subject | ALGORITHM | |
dc.subject | COMPLEXITY | |
dc.subject | Identifiability | |
dc.subject | Mathematics | |
dc.subject | Mathematics, Applied | |
dc.subject | MOMENT VARIETIES | |
dc.subject | POLYNOMIAL SYSTEMS | |
dc.subject | RANDOM PROJECTIONS | |
dc.subject | RANK MATRIX COMPLETION | |
dc.subject | Recoverability | |
dc.subject | SIGNAL RECOVERY | |
dc.title | Algebraic compressed sensing | |
dc.type | journal article | |
dc.identifier.doi | 10.1016/j.acha.2023.03.006 | |
dc.identifier.isi | ISI:000983072500001 | |
dc.description.volume | 65 | |
dc.description.startpage | 374 | |
dc.description.endpage | 406 | |
dc.contributor.orcid | http://orcid.org/0000-0001-5692-4163 | |
dc.contributor.orcid | http://orcid.org/0000-0002-6081-786X | |
dc.contributor.researcherid | P-3299-2017 | |
dc.identifier.eissn | 1096-603X | |
dc.publisher.place | 525 B ST, STE 1900, SAN DIEGO, CA 92101-4495 USA | |
dcterms.isPartOf.abbreviation | Appl. Comput. Harmon. Anal. | |
dcterms.oaStatus | Green Submitted | |
local.import.remains | affiliations : University Osnabruck; Saarland University; University of Konstanz; KU Leuven | |
local.import.remains | earlyaccessdate : APR 2023 | |
local.import.remains | web-of-science-index : Science Citation Index Expanded (SCI-EXPANDED) | |
crisitem.author.dept | FB 06 - Mathematik/Informatik/Physik | - |
crisitem.author.deptid | fb6 | - |
crisitem.author.orcid | 0000-0003-3747-9185 | - |
crisitem.author.parentorg | Universität Osnabrück | - |
crisitem.author.netid | BrPa211 | - |
Seitenaufrufe
1
Letzte Woche
0
0
Letzter Monat
0
0
geprüft am 06.06.2024