Block-sparse signal recovery (BSR) appears in some fields of sparse modelling and machine learning, including color imaging, equalization of sparse communication channels 
, multi-response linear regression and imagine annotation  and so forth. Essentially, the important problem in BSR is how to reconstruct a block-sparse or approximately block-sparse signal from a linear system. Commonly, one thinks over the below model:
where is the observation measurement, is a known measurement matrix (or sensing matrix) with , and is a vector of measurement errors. Generally, the conventional compressed sensing (CS) simply thinks out the sparsity of the signal to be recovered, however it doesn’t consider any additional structure, i.e., non-zero elements appear in blocks (or clusters) rather than being arbitrarily spread all over the vector. We call these signals as the block-sparse signals. In order to define block sparsity, we need to give several additional notations. Suppose that the signal over the block index set , then we can describe the signal as
where represents the th block of and . We call a vector as block -sparse over if is non-zero for no more than indices . In fact, if the block-sparse structure of signal is neglected, the conventional CS doesn’t efficiently treat such structured signal. To reconstruct block-sparse signal, researchers   proposed the following mixed -minimization:
where is the mixed norm of a vector . The set stands for some noise structure,
where represents the conjugate transpose of the matrix . (1.2) is a convex optimization issue and could be converted into a second-order cone program, so can be solved efficiently.
To study the theoretical performance of mixed -minimization, Eldar and Mishali  proposed the definition of block restricted isometry property (block RIP).
For the reminder of this paper, for simplicity, represents the block RIP constant . Eldar and Mishali  showed that the mixed -minimization method can exactly reconstruct any block -sparse signal when the measurement matrix fulfills the block RIP with . Later, Lin and Li  improved the sufficient condition on to , and builded condition for accurate recovery. In 2019, the conclusions of literature  and  together present a complete characterization to the block RIP condition on that the mixed minimization method guarantees the block-sparse signal recovery in the field of block-sparse compressed sensing.
Recently, a lot of researchers    have revealed that minimization not only constantly needs less constrained the RIP requirements, but also could ensure exact recovery for smaller compared with the minimization. In the present paper, we are interested in investigating the stable reconstruction of block-sparse signals by the mixed minimization as follows:
where . Simulation experiments   indicated that fewer linear measurements are needed for accurate reconstruction when than when . More related work can be found in literature       .
In this paper, we further investigate the high-order block RIP conditions for the exact and stable reconstruction for (approximate) block-sparse signals by mixed minimization. The crux is extend sparse representation of an -polytope (Lemma 2.2 ) to the block scenario. With this technique, we obtain a sufficient condition on RIC that guarantees the exact and stable reconstruction of approximate block-sparse signals via mixed minimization, and establish error bounds between the solution to (1.6) and the signal to be recovered. Obviously, when is accurately block-sparse and (i.e., ), we will derive the accurate reconstruction condition. Particularly, we will determine how many random Gaussian measurements suffice for the condition to hold with high probability.
The remainder of the paper is constructed as follows. In Section 2, we will provide some notations and a few lemmas. In Section 3, we will present the main results, and the associating proofs are given in Section 5. In Section 4, a series of numerical experiments are presented to support our theoretical results. Lastly, the conclusion is drawn in Section 6.
Throughout this article, we use the below notations unless special mentioning. For a subset in , denotes the complement of in . For any vector , represents a vector which is equal to on block indices and displaces other blocks with zero. Denote by block indices of the largest block in norm of the vector , i.e., for any and . We represent as with all but the largest blocks in norm set to zero. Henceforth, we invariably choose that , where is the minimizer of (1.6).
In order to prove our main results, it is necessary to present the below lemma which is a crucial technical tool. Factually, we extend sparse expression of an -polytope proposed by  to the block context.
For a positive integer , a positive number and given , define the block -polytope by
Then any can be expressed as the convex combination of block -sparse vectors, i.e.,
Here and and . In addition,
We can prove the assertion holds by induction. If is block -sparse, we can set and , then . Suppose that assertion holds for all block -sparse vectors (). Then for any block -sparse vectors such that and , without loss of generality suppose that is not block -sparse (otherwise the statement is naturally true by assumption of ). Besides, can be represented as , where , is equal to the largest for every , is equal to the next largest , etc. Here denotes a unit vector in , which is equal to on the th largest block of and zero other places. Set , and fix , where . Then we have and
Denote the set
It is easy to see that , hence is not empty. Then we note that , which implies
It follows that
where . Then by simple calculations, we obtain and , where is block -sparse for all . Finally, since is block -sparse, under the induction assumption, we have , where is block -sparse, and , . Hence, , which implies that statement is true for . ∎
We will utilize the below lemma in the process of proving the main conclusions, which is a useful important inequality.
(Lemma 5.3 ) Suppose that , , , then for all ,
More generally, assume that , and , then for all ,
In view of the definition of , and , we get the below lemma.
Recall that , where is the solution to (1.6). It holds that
Assume that is the block index set over blocks with largest norm of the vector . Therefore, . By applying the minimality of the solution and the reverse triangular inequality of , we get
Note that and . Combining with the above inequalities, the desired result can be derived. ∎
where the probability is taken over all matrices and is a constant relying merely on and such that for all , . Suppose that . Then, for any , we have
for all -sparse vectors with probability
3 Main Results
Based on the knowledge prepared above, we present the main results in this part-a high-order block RIP condition for the robust reconstruction of arbitrary signals with block structure via mixed minimization. In the case that the signal to be recovered is block-sparse, the condition can respectively guarantee the accurate construction and stable recovery in the noise-free case and in the noise situation. When the original signal is not block-sparse and the linear measurement is corrupted by noise, the below result presents a sufficient condition for recovery of structured signals.
In the case of , we obtain the same results as Theorem 3 in .
Under the same conditions as in Theorem 3.1, suppose that and is block -sparse. Then can be accurately reconstructed via
In the following, we will decide how many random Gaussian measurements are demanded for (3.1) to be fulfilled with overwhelming probability. In this sequel, let be a probability measure space and
Given and , the random matrices can be produced by making choice of the elements as independent copies of . This generates the random matrices .
4 Numerical experiments
In this section, we carry out a few numerical simulations to hold out the application of our theoretical results. We could transform the constrained optimization problem (1.6) into an alternative unconstrained form below:
The augmented Lagrangian function of the above problem is
where is a Lagrangian multiplier, and is a penalty parameter. Then, ADMM composes of the below three steps:
The solution of problem (4.4) is explicitly provided by
To use the existing conclusions on the proximity operator of -norm (), by employing the inequality: for and , the optimization problem (4.5) can be converted into
In our experiments, without loss of generality, we think over the block-sparse signal with even block size, i.e., , , and take the signal length . For each experiment, first of all, we randomly produce block-sparse signal
with the amplitude of each nonzero entry generated according to the Gaussian distribution. We use anorthogonal Gaussian random matrix as the measurement matrix . We set the number of random measurement unless otherwise specified. With and , we generate the linear measurement by , where is the Gaussian noise vector. Each given experimental result is an average over 100 independent trails.
In Fig. 1a, we produce the signals by making choice of blocks uniformly at random with , i.e., the block size . The relative error of recovery is plotted versus the regularization parameter for the different values of , i.e., . The ranges from to . From the figure, the parameter is a proper choice. Fig. 1b presents experimental results regarding the performance of the non-block algorithm and the block algorithm with . Two curves of relative error are provided via mixed minimization and orthogonal greedy algorithm (OGA) . Fig. 1b reveals the signal construction is quite significant in signal recovery.
Signal-to-noise ratio (SNR, SNR) versus the values of and the nonzero entries , the results are respectively given in Fig. 2a and b. In Fig. 2a, the values of vary from to , and in Fig. 2b, the number of nonzero entries ranges from to . Figs. 2a and b evidences that mixed minimization performs better than that of standard minimization. Figs. 2a and b provide the relationship between the relative error and the number of measurements in different block sizes and the values of .
Eventually, we compare the performance of Group-Lp for with other typical algorithms consisting of Block-OMP algorithm, Block-SL0 algorithm  for solver and Block-ADM algorithm . We exploit SNR to weigh the algorithm efficiency. In Fig. 4a, we select signals whose block size with the number of nonzero entries as the test signals, and in Fig. 4b, the block size . One can see that, overall, the performance of Group-Lp () is much better than that of other three algorithms.
5 The proofs of Main Results
Denote . Then, by utilizing Lemma 2.3, we have
where (a) follows from Hlder’s inequality, (b) is due to the fact that , and given , and (c) is from the fact that , .
From Cauchy-Schwartz inequality and the definition of block RIP, we get
Take . Then,
Furthermore, both and are block -sparse, because is block -sparse, and is block -sparse.
Observe that the identity below