In this paper, by exploiting orthogonal projection matrix and block Schur complement, we extend the study to a complete perturbation model. Based on the block-restricted isometry property (BRIP), we establish some sufficient conditions for recovering the support of the block 𝐾-sparse signals via block orthogonal matching pursuit (BOMP) algorithm. Under some constraints on the minimum magnitude of the nonzero elements of the block 𝐾-sparse signals, we prove that the support of the block 𝐾-sparse signals can be exactly recovered by the BOMP algorithm in the case of ${\ell }_2$ and ${\ell }_2/{\ell }_{\infty }$ bounded total noise if 𝑨 satisfies the BRIP of order $K+1$ with

中文翻译：

---

基于群稀疏表示和正交匹配追踪的摄动分析

在本文中，通过利用正交投影矩阵和块Schur补，我们将研究扩展到一个完整的扰动模型。基于块受限等距性质（BRIP），我们通过块正交匹配追踪（BOMP）算法建立了一些条件来恢复块稀疏信号的支持。在对块稀疏信号的非零元素的最小幅度的一些约束下，我们证明了在以下情况下，BOMP算法可以精确地恢复块稀疏信号的支持。${\ell }_2$ 和 ${\ell }_2/{\ell }_{\infty }$ 如果ies满足阶跃BRIP，则有界总噪声 $ķ+\mathrm{1个}$ 与