Algorithms for Compressive Sensing Signal Reconstruction with ApplicationsView this Special Issue
Research Article | Open Access
Xunzhi Zhu, "Approximately Normalized Iterative Hard Thresholding for Nonlinear Compressive Sensing", Mathematical Problems in Engineering, vol. 2016, Article ID 2594752, 8 pages, 2016. https://doi.org/10.1155/2016/2594752
Approximately Normalized Iterative Hard Thresholding for Nonlinear Compressive Sensing
The nonlinear compressive sensing (NCS) is an extension of classical compressive sensing (CS) and the iterative hard thresholding (IHT) algorithm is a popular greedy-type method for solving CS. The normalized iterative hard thresholding (NIHT) is a modification of IHT and is more effective than IHT. In this paper, we propose an approximately normalized iterative hard thresholding (ANIHT) algorithm for NCS by using the approximate optimal stepsize combining with Armijo stepsize rule preiteration. Under the condition similar to restricted isometry property (RIP), we analyze the condition that can identify the iterative support sets in a finite number of iterations. Numerical experiments show the good performance of the new algorithm for the NCS.
Compressed sensing (CS) [1, 2] deals with the problem of recovering sparse signals from underdetermined linear measurements. In recent years, it has attracted considerable attention in areas of signal processing, electrical engineering, computer science, and applied mathematics; see [3, 4]. However, many real-life applications in physics and biomedical sciences carry some strongly nonlinear structure, so that the linear model is not suited anymore, even as an approximation. It is of utmost interest to investigate compressive sensing with nonlinear measurements, which is called nonlinear compressive sensing (NCS) [5, 6]. So, it is necessary to consider the following NCS: to find a vector from the observations given bywhere is nonlinear, is some noise term and , and is the -norm of , which refers to the number of nonzero elements in the vector . The optimization problem associated with (1) iswhere is -norm and is the residual function. Let be continuously differentiable and let denote its Jacobian matrix. Then . Clearly, if is linear function, model (1) and the optimization problem (2) reduce to classical CS,and problemrespectively, where .
Greedy methods have already proven useful and efficient to tackle (4) . A variety of greedy methods have been proposed to solve (4), such as matching pursuit (MP) , orthogonal MP (OMP) , compressive sampling matching pursuit (CoSaMP) , subspace pursuit (SP) , hard thresholding pursuit (HTP) , and conjugate gradient iterative hard thresholding (CGIHT) .
There is another greedy method, iterative hard thresholding (IHT) algorithm for problem (4), which was proposed by Blumensath and Davies in [14, 15]. When matrix is row full-rank and the spectral norm , IHT converges to a local minimum of (4) . In , the authors showed that the numerical studies of IHT are not very promising and the algorithm often fails to converge when the conditions fail. Then they gave normalized IHT (NIHT) with an adaptive stepsize and line search and proved that it converges to a local minimum if is row full-rank and -regular, where -regular means that any columns of are linear independent . Cartis and Thompson  showed NIHT converges to local minimum if matrix is -regular. Blumensath  showed that IHT can recover signals from NCS under conditions similar to those required in CS.
Inspired by these works, we propose an approximately NIHT (ANIHT) algorithm to solve the NCS problem (2). Since problem (2) is in general a nonconvex programming, we can only expect to find out the stationary point rather than the local minimizer, which is different from NIHT for CS. Then we show that the accumulation point of the ANIHT algorithm is the stationary point. With the nondegeneracy and strict complementarity of stationary point, the support sets of the sequence are identified in a finite number of iterations. At last, we simulate several experiments to demonstrate the effectiveness of the algorithm.
This paper is organized as follows. Section 2 gives the ANIHT algorithm for (2) and proves its convergence properties. Numerical results are given in Section 3. The last section makes some concluding remarks.
In this section, we will present the approximately normalized iterative hard thresholding (ANIHT) algorithm for (2) and then analyze its convergence properties. Denote For and set , projector onto is . Note that the projection onto sparse set , written as , sets all but largest absolute value components of to zero. The definition of -stationarity was proposed in  based on the notion of fixed-point equation.
Definition 1. The point is called the stationary point of problem (2), if it holds that
In NIHT for CS , to guarantee the objective function a sufficient decrease per iteration, the authors added a stepsize strategy based on restricted isometry property (RIP) . In ANIHT for NCS (2), we use the approximately optimal stepsize to accelerate the convergence and use Armijo-type stepsize and make a sufficient decrease of the objective function directly without RIP. Here is the subvector (submatrix) obtained by discarding all but the elements (columns) in . The framework of ANIHT is described as follows.
Step 1. Initialize , , , .
Step 2. Let and compute where
Step 3. If , then , , and ; else compute and , where and is the smallest positive integer such that and .
Step 4. If the stopping criterion is met, then stop.
Remark 2. We now briefly illustrate the algorithm:(i)In Step 2, a proposal point is calculated, whether accepting it depends on the relationship between its support set and the previous point’s; see Step 3. In addition, to accelerate the rate of convergence, we utilize the approximately optimal initial stepsize to compute . The linear approximate of at is is the support of the best term approximation to at the current iteration. So we obtain that This stepsize is in accordance with the optimal stepsize in NIHT for CS in . Furthermore, by Assumption 4, when is relatively small, the error introduced in the linear approximation is small; then the objective function decreases if the support set is not changed.(ii)Armijo-type stepsize rule in Step 3 makes the choice of stepsize and support set adaptively and a sufficient decrease of the objective function meanwhile per iteration. It is well defined by Lemma 6.
The following assumptions are chosen to ensure the descent property (14) of the objective function .
Assumption 3. There exists a constant such that for .
We also need the assumption that the Jacobian of residual is restricted Lipschitz continuous on .
Assumption 4. There exists a constant such that for .
Proof. We first showSince ANIHT algorithm generates monotonically decreasing function values, then for all . Direct calculation yields that It follows from (15) that which completes the proof.
Proof. According to the computation in Step 2, we have which implies that that is,If , then the above inequality and the monotonicity of yield that Otherwise, by the Armijo-type stepsize rule and the monotonicity of , we have Then can be smaller than .
By Lemma 5 and (21), we get that If , , then . Otherwise, by letting , we can obtain the desired result by the definition of .
Proof. (i) It follows from (18) that , where . Then which signifies .
It follows from Assumption 3 that and then . By Lemma 6 and the definition of in the algorithm, we have Therefore, is bounded from below by a positive constant (). We can conclude that (ii) Suppose that is an accumulation point of the sequence ; then there exists a subsequence converging to and by (i). For the simplification of notation, denote as by its boundedness and . Based on in Step 2, we consider two cases.
Case 1 (). The convergence of and guarantees that, for some , , for all . The definition of the projection on shows that Taking , we have .
Case 2 (). If there exists an such that, for all , , the projection implies that Letting and exploiting the continuity of the function , we obtain that On the other hand, if there exists an infinite number of indices of for , as the same proof in Case 1, it follows that . Since is bounded from below by a positive constant, we have which means is a stationary point of (2).
We are now ready to show that under suitable conditions the support set of a point is identified in a finite number of iterations. We can easily verify that if , then the support set of in a sufficiently small neighborhood of is identified. For , we introduce the concept of strict complementarity to identify the support set.
Definition 8. The point is called nondegenerate if . The conditionis called strict complementarity condition of (2), where .
Theorem 9. For any sequence converging to , we have the following:(i)if is nondegenerate point, thenfor all sufficiently large andwhere and .(ii)if satisfies strict complementarity, then (35) holds if and only if (36) holds.
Proof. (i) Suppose that is a nondegenerate point. We have (35) when is sufficiently close to . By (35) and the continuity of , we can easily get that (ii) Suppose that satisfies strict complementarity condition. The “only if” part can be obtained by the similar proof as in (i). Let (36) hold. Since , . Assume that there is an infinite subsequence and an index such that and for all . By (36), While the strict complementarity condition (34) implies that . This contradiction proves that .
3. Numerical Experiments
In this part, sensor localization problem and phase retrieval problem will be stimulated. In both examples, the stop criteria will be set as , where is pretty small in different cases or the maximum iterative times being equal to 5000.
Sensor localization problem can be described as follows: given known anchors , the purpose is to find a sensor satisfying where , , is the noise (which obeys the normal distribution with zero expectation and variance here). The problem of finding an satisfying above equalities is the same as finding an optimal solution to the optimization problem (4) with . We first compare the on an example with , , and . Each component of the vectors was randomly and independently generated from a standard normal distribution. Then the true vector and are designed as following MATLAB codes:For each value of , we ran algorithm from 100 different and randomly generated initial data sets. The numbers of runs of 100 in which the methods found the “correct” solution are given in Table 1. Here, the “correct” solution means that , or and are very close, say As can be clearly seen by the results in the table, the performs well in terms of the success probability. For more details, when the “true” solutions are quite sparse compared to the dimension , can almost recover all the “ture” solutions, while the performance is becoming worse as rises.
Then we run algorithm in a higher dimensional data set, where , , and . For each data set, we run 40 times and record the average results (in which the unsuccessful recoveries are expelled). Figure 1 shows the performance of when addressing this problem.
Phase retrieval is to recover a signal from the magnitude of its Fourier transform, or of any other linear transform. Due to the loss of Fourier phase information, the problem is generally ill-posed. The phase retrieval problem can be described as follows: given known measurement vectors , the purpose is to reconstruct a signal satisfying where is the th column of the general matrix or the discrete Fourier transform (DFT) and , , is the noise (which obeys the normal distribution with zero expectation and variance here). Also this problem is equivalent to recover an optimal solution to the optimization problem (4) with , where , .
There are some other methods for sparse phase retrieval and the codes are available. So we can compare our algorithm with them. We first compare the algorithm with the partial sparse-simplex method () and greedy sparse-simplex () method in  with , , and which is identical to those in . The true vector and the measurement vectors are generated as that produced in sensor localization problem; is designed as following MATLAB codes:For each value of , we ran algorithm from 100 different and randomly generated initial data sets. The numbers of runs of 100 in which the methods found the “correct” solution are given in Table 2. As can be clearly seen by the results in the table, the outperforms and in terms of the success probability. What is more, the data in the row with are higher than those with and .
We also compare our algorithm with in  to recover a signal from the magnitude of its Fourier transform. Namely, it is to find a real-valued discrete time signal from its magnitude-squared value of an point discrete Fourier transform (DFT): We denote by the DFT matrix; then elements and , where denotes the element-wise absolute-squared value. We get by the pseudo MATLAB codes:
To see the accuracy of the solutions and the speed of these two methods, we run the two methods for increasing from 512 to 3072 and keeping , . We also test them under noiseless and two noise levels, and . From Table 3, we can see that outperforms in terms of both average CPU time and average relative error for large .
Nonlinear CS (NCS) not only is of academic interest but also might be important in many real-world applications when the measurements cannot be designed to be perfectly linear. In this paper, we have proposed an ANIHT algorithm for NCS and studied its convergence. We have showed that any accumulation point of the algorithm is the stationary point. The support set of the sequence can be identified with the assumption of nondegeneracy and strict complementarity of stationary point. The numerical experiments show that ANIHT algorithm is effective for NCS. In the future, we will further consider other methods for nonlinear least square problem to improve the rate of convergence, such as L-M method or cubic regularization methods .
The author declared that there are no competing interests in their submitted paper.
This research was supported by National Natural Science Foundation of China (11271233) and Shandong Province Natural Science Foundation (ZR2012AM016).
- E. J. Candes and T. Tao, “Decoding by linear programming,” IEEE Transactions on Information Theory, vol. 51, no. 12, pp. 4203–4215, 2005.
- D. L. Donoho, “Compressed sensing,” IEEE Transactions on Information Theory, vol. 52, no. 4, pp. 1289–1306, 2006.
- Y. C. Eldar and G. Kutyniok, Compressed Sensing: Theory and Applications, Cambridge University Press, Cambridge, UK, 2012.
- S. Foucart and H. Rauhut, A Mathematical Introduction to Compressive Sensing, Birkhäuser, New York, NY, USA, 2013.
- T. Blumensath, “Compressed sensing with nonlinear observations and related nonlinear optimization problems,” IEEE Transactions on Information Theory, vol. 59, no. 6, pp. 3466–3474, 2013.
- H. Ohlsson, A. Y. Yang, R. Dong, and S. S. Sastry, “Nonlinear basis pursuit,” in Proceedings of the 47th Asilomar Conference on Signals, Systems and Computers, pp. 115–119, Pacific Grove, Calif, USA, November 2013.
- V. N. Temlyakov and P. Zheltov, “On performance of greedy algorithms,” Journal of Approximation Theory, vol. 163, no. 9, pp. 1134–1145, 2011.
- S. G. Mallat and Z. Zhang, “Matching pursuits with time-frequency dictionaries,” IEEE Transactions on Signal Processing, vol. 41, no. 12, pp. 3397–3415, 1993.
- G. Davis, S. Mallat, and M. Avellaneda, “Adaptive greedy approximations,” Constructive Approximation, vol. 13, no. 1, pp. 57–98, 1997.
- D. Needell and J. A. Tropp, “CoSaMP: iterative signal recovery from incomplete and inaccurate samples,” Applied and Computational Harmonic Analysis, vol. 26, no. 3, pp. 301–321, 2009.
- W. Dai and O. Milenkovic, “Subspace pursuit for compressive sensing signal reconstruction,” IEEE Transactions on Information Theory, vol. 55, no. 5, pp. 2230–2249, 2009.
- S. Foucart, “Hard thresholding pursuit: an algorithm for compressive sensing,” SIAM Journal on Numerical Analysis, vol. 49, no. 6, pp. 2543–2563, 2011.
- J. D. Blanchard, J. Tanner, and K. Wei, “CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion,” Information and Inference. A Journal of the IMA, vol. 4, no. 4, pp. 289–327, 2015.
- T. Blumensath and M. E. Davies, “Iterative thresholding for sparse approximations,” Journal of Fourier Analysis and Applications, vol. 14, no. 5, pp. 629–654, 2008.
- T. Blumensath and M. E. Davies, “Iterative hard thresholding for compressed sensing,” Applied and Computational Harmonic Analysis, vol. 27, no. 3, pp. 265–274, 2009.
- T. Blumensath and M. E. Davies, “Normalized iterative hard thresholding: guaranteed stability and performance,” IEEE Journal on Selected Topics in Signal Processing, vol. 4, no. 2, pp. 298–309, 2010.
- A. Beck and Y. C. Eldar, “Sparsity constrained nonlinear optimization: optimality conditions and algorithms,” SIAM Journal on Optimization, vol. 23, no. 3, pp. 1480–1509, 2013.
- C. Cartis and A. Thompson, “A new and improved quantitative recovery analysis for iterative hard thresholding algorithms in compressed sensing,” IEEE Transactions on Information Theory, vol. 61, no. 4, pp. 2019–2042, 2015.
- Y. Shechtman, A. Beck, and Y. C. Eldar, “GESPAR: efficient phase retrieval of sparse signals,” IEEE Transactions on Signal Processing, vol. 62, no. 4, pp. 928–938, 2014.
- C. Cartis, N. I. Gould, and P. L. Toint, “On the evaluation complexity of cubic regularization methods for potentially rank-deficient nonlinear least-squares problems and its relevance to constrained nonlinear optimization,” SIAM Journal on Optimization, vol. 23, no. 3, pp. 1553–1574, 2013.
Copyright © 2016 Xunzhi Zhu. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.