English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this paper, we use the block orthogonal matching pursuit (BOMP) algorithmto recover block sparse signals $\x$ from measurements $\y=\A\x+\v$, where $\v$is an $\ell_2$-bounded noise vector (i.e., $\|\v\|_2\leq \epsilon$ for someconstant $\epsilon$). We investigate some sufficient conditions based on theblock restricted isometry property (block-RIP) for exact (when $\v=\0$) andstable (when $\v\neq\0$) recovery of block sparse signals $\x$. First, on theone hand, we show that if $\A$ satisfies the block-RIP with$\delta_{K+1}<1/\sqrt{K+1}$, then every block $K$-sparse signal $\x$ can beexactly or stably recovered by BOMP in $K$ iterations. On the other hand, weshow that, for any $K\geq 1$ and $1/\sqrt{K+1}\leq \delta<1$, there exists amatrix $\A$ satisfying the block-RIP with $\delta_{K+1}=\delta$ and a block$K$-sparse signal $\x$ such that BOMP may fail to recover $\x$ in $K$iterations. Then, we study some sufficient conditions for recovering block$\alpha$-strongly-decaying $K$-sparse signals. We show that if $\A$ satisfiesthe block-RIP with $\delta_{K+1}<\sqrt{2}/2$, then every$\alpha$-strongly-decaying block $K$-sparse signal can be exactly or stablyrecovered by BOMP in $K$ iterations under some conditions on $\alpha$. Ournewly found sufficient condition on the block-RIP of $\A$ is less restrictivethan that for $\ell_1$ minimization for this special class of sparse signals.Furthermore, for any $K\geq 1$, $\alpha>1$ and $\sqrt{2}/2\leq \delta<1$, therecovery of $\x$ may fail in $K$ iterations for a sensing matrix $\A$ whichsatisfies the block-RIP with $\delta_{K+1}=\delta$. Finally, we study somesufficient conditions for partial recovery of block sparse signals.Specifically, if $\A$ satisfies the block-RIP with $\delta_{K+1}<\sqrt{2}/2$,then BOMP is guaranteed to recover some blocks of $\x$ if these blocks satisfya sufficient condition.

Sharp Sufficient Conditions for Stable Recovery of Block Sparse Signals by Block Orthogonal Matching Pursuit