Algorithm 1 Split Bregman Iteration (SBI).

1:Set$\mu$, $k=0$, ${\mathit{x}}^{(0)}=0$, ${\mathit{z}}^{(0)}=0$, ${\mathit{b}}^{(0)}=0$.   2:repeat   3: ${\mathit{x}}^{(k+1)}=\underset{\mathit{x}}{argmin}H(\mathit{x})+\frac{\mu }{2}{∥\mathit{x}-\mathit{K}{\mathit{z}}^{(k)}-{\mathit{d}}^{(k)}∥}_2^2$;   4: ${\mathit{z}}^{(k+1)}=\underset{\mathit{z}}{argmin}G(\mathit{z})+\frac{\mu }{2}{∥{\mathit{x}}^{(k+1)}-\mathit{K}\mathit{z}-{\mathit{d}}^{(k)}∥}_2^2$;   5: ${\mathit{d}}^{(k+1)}={\mathit{d}}^{(k)}-({\mathit{x}}^{(k+1)}-\mathit{K}{\mathit{z}}^{(k+1)})$;   6: $k=k+1$.   7:until Stop criterion is satisfied.