[HTML][HTML] Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit
In this paper, we use the block orthogonal matching pursuit (BOMP) algorithm to recover
block sparse signals x from measurements y= A x+ v, where v is an ℓ 2-bounded noise …
block sparse signals x from measurements y= A x+ v, where v is an ℓ 2-bounded noise …
Inexact projected gradients on unions of subspaces
We prove convergence of the projected gradient algorithm with inexact projections when
applied to linear inverse problems with constraint sets that are unions of subspaces. Such …
applied to linear inverse problems with constraint sets that are unions of subspaces. Such …
Infinite unions of subspaces: With applications to channel estimation in mobile communication systems
T Wiese - 2021 - mediatum.ub.tum.de
Compressive sensing theory can be used to analyze linear inverse problems with constraint
sets that are finite unions of subspaces. We show how the existing theory can be modified …
sets that are finite unions of subspaces. We show how the existing theory can be modified …
On the Size of the DOA Manifold
T Wiese, M Knoedlseder… - WSA 2017; 21th …, 2017 - ieeexplore.ieee.org
We discuss the size of the set of all vectors that can be described as a linear combination of
K steering vectors relative to the size of the M-dimensional ambient space. This set is an …
K steering vectors relative to the size of the M-dimensional ambient space. This set is an …
[CITATION][C] Infinite Unions of Subspaces
T Wiese - 2021 - Universität München