Sparse power factorization: balancing peakiness and sample complexity

Jakob Geppert, Felix Krahmer, Dominik Stöger

Publikation: Beitrag in FachzeitschriftArtikelBegutachtung

4 Zitate (Scopus)

Abstract

In many applications, one is faced with an inverse problem, where the known signal depends in a bilinear way on two unknown input vectors. Often at least one of the input vectors is assumed to be sparse, i.e., to have only few non-zero entries. Sparse power factorization (SPF), proposed by Lee, Wu, and Bresler, aims to tackle this problem. They have established recovery guarantees for a somewhat restrictive class of signals under the assumption that the measurements are random. We generalize these recovery guarantees to a significantly enlarged and more realistic signal class at the expense of a moderately increased number of measurements.

OriginalspracheEnglisch
Seiten (von - bis)1711-1728
Seitenumfang18
FachzeitschriftAdvances in Computational Mathematics
Jahrgang45
Ausgabenummer3
DOIs
PublikationsstatusVeröffentlicht - Juni 2019

Fingerprint

Untersuchen Sie die Forschungsthemen von „Sparse power factorization: balancing peakiness and sample complexity“. Zusammen bilden sie einen einzigartigen Fingerprint.

Dieses zitieren