Table of Contents Author Guidelines Submit a Manuscript
International Journal of Antennas and Propagation
Volume 2017 (2017), Article ID 1260601, 7 pages
https://doi.org/10.1155/2017/1260601
Research Article

Localization of Near-Field Sources Based on Sparse Signal Reconstruction with Regularization Parameter Selection

1School of Electrical and Electronic Engineering, Chongqing University of Technology, Chongqing 400054, China
2Key Laboratory of Wireless Sensor Networks and Communication, Shanghai Institute of Microsystem and Information Technology, Shanghai 200050, China

Correspondence should be addressed to Wei He; nc.ca.mis.liam@eh.iew

Received 9 November 2016; Accepted 9 April 2017; Published 11 May 2017

Academic Editor: María Elena de Cos Gómez

Copyright © 2017 Shuang Li et al. 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.

Abstract

Source localization using sensor array in the near-field is a two-dimensional nonlinear parameter estimation problem which requires jointly estimating the two parameters: direction-of-arrival and range. In this paper, a new source localization method based on sparse signal reconstruction is proposed in the near-field. We first utilize -regularized weighted least-squares to find the bearings of sources. Here, the weight is designed by making use of the probability distribution of spatial correlations among symmetric sensors of the array. Meanwhile, a theoretical guidance for choosing a proper regularization parameter is also presented. Then one well-known -norm optimization solver is employed to estimate the ranges. The proposed method has a lower variance and higher resolution compared with other methods. Simulation results are given to demonstrate the superior performance of the proposed method.

1. Introduction

Source localization using sensor array is one of the most important topics in array signal processing society. A great number of source localization methods were proposed in the past few decades. However, most of these methods focused on source localization in far-field case, in which the signal can be regarded as planar wave and only direction-of-arrival (DOA) estimation is required. When the range between the sources and the array is not sufficiently large compared with the aperture of the array (i.e., in the near-field case), the wavefront of the signal at the array is characterized by both azimuth and range. Thus, the performance of the DOA estimation methods for far-field case degrades significantly in the near-field.

In recent years, a majority of methods have been proposed to deal with the source localization problem in the near-filed, such as maximum likelihood methods [1], the two-dimensional MUSIC methods [2], high-order-cumulants-based methods [37], and the linear prediction methods [8, 9]. However, most of these methods either require additional parameters pairing [8, 9] or involve large computational cost due to multidimensional search [1, 2] or the computation of cumulants [37]. Furthermore, in order to take advantages of the symmetric property of the array, some other methods suffer from heavy aperture loss (i.e., at most sources can be detected when the number of sensors is [10, 11]). Recently, Malioutov et al. [12] proposed a DOA estimation method in far-field named L1-SVD, showing some advantages including high resolution and improved robustness to noise, to a limited number of snapshots and to correlation of sources. After that, several methods based on sparse signal reconstruction (SSR) were proposed to locate the near-field sources. Wang et al. [13] proposed a mixed source localization method based on sparse representation of cumulants, achieving a higher estimation accuracy. However, the method suffers from a heavy computational load for computation of cumulants. By representing the source range and DOA information as sensor-dependent phase progression, a Bayesian-compressed-sensing-based source localization method was proposed for uniform and sparse linear arrays [14]. However, it also suffers from large computational cost because of iterations. By jointly using MUSIC and sparse signal reconstruction, Tian and Sun [15] also proposed a source localization method for mixed sources. By making use of the spatial correlations of symmetric sensors output, an SSR-based source localization method was proposed by Hu et al. [16, 17], showing superior performance. However, by employing -regularized least-squares optimization to find the sparse solution, the regularization parameter was selected manually by cross validation, which causes the method to be unable to use in practice. Moreover, it is prone to be selected improperly.

In this paper, a novel SSR-based source localization method is proposed in the near-field. Firstly, just like the method in [16], by exploiting the spatial correlations of symmetric sensors output, the azimuth and range are decoupled so that a two-dimensional parameter estimation problem in the near-field is converted into a DOA estimation one in the far-field. Secondly, the theory of -regularized weighted least-squares optimization is employed on the virtual far-field array to acquire DOA estimation. Meanwhile, similar to [18], an approach is presented to choose regularization parameter. At last, L1-SVD is utilized to estimate the ranges of the sources.

The paper is organized as follows. Section 2 describes the data model of source localization. An existing SSR-based method for source localization in the near-field is reviewed in Section 3. The proposed method for DOA and range estimation is presented in Sections 4 and 5, respectively. Simulation results are shown in Section 6. Section 7 concludes this paper.

2. Data Model

Consider this case in which near-field narrowband sources impinge onto a uniform linear array with elements, as depicted in Figure 1. The received signal of sensor can be expressed aswhere represents the source signal, denotes the additive noise received by the sensor, stands for the range between the source and the sensor, refers to the range between the source and the reference sensor of the array, is the wavelength of the narrowband signals, and denotes the number of snapshots. It can be easily derived from Figure 1 thatwhere denotes the DOA of the source.

Figure 1: A near-field source impinges onto a ULA with sensors.

Let , , and denote the received signal vector, the source signal vector, and the noise vector, respectively. By stacking all into a vector, we arrive atwhere denotes the array manifold and stands for the steering vector.

By making use of the Fresnel approximation [16], can be written asIf we define and , the steering vector can be approximated aswhich indicateswhere denotes the approximated array manifold. Substituting (6) into (3), we arrive at

Given the knowledge of the observed signals , the goal is to find the ranges and the DOAs .

For convenience we make the following assumptions:(A1)The source signals are uncorrelated to each other and independent of the noise.(A2)The noises are spatially uncorrelated Gaussian white noise.(A3)The intersensor spacing of the array satisfies .

3. The DOA Estimation Method in [16]

Under the above assumptions, the spatial correlation between the and the sensor output can be expressed aswhere stands for the power of the source signal, represents the noise power, and denotes the Dirac function. Note that when , the spatial correlation is uncorrelated with the parameter . Thus, we haveStacking all from to , we obtainwhere , , , and , . Comparing (10) with (7), behaves like the received signal of a far-field array with array manifold and source signal , corrupted by the noise . Note that the two-dimensional (DOA and range) estimation problem has been transformed into a one-dimensional (DOA) estimation one now.

Then, the one-dimensional estimation problem can be cast into a sparse signal recovery problem as follows. Define a set as the sampling grid corresponding to the DOAs of the potential sources. The number of the potential sources should be much greater than the number of the real sources and the number of sensors . The overcomplete basis can be constructed as where . The sparse signal is represented by a vector , whose element should be a nonzero weight if the source comes from the direction for some and zero otherwise; that is, the sparse vector acts as the spatial spectrum. Thus, the sparse signal recovery model is formulated asA usual way to solve the sparse signal is using the well-known -regularized least-squares minimization method, which is given by [16]where denotes the regularization parameter, which balances the data-fitting error and the sparsity of . It is important to select the parameter properly since it has a great impact on the spatial spectrum. If the parameter is too small, some of the peaks in the spatial spectrum will disappear. On the contrary, spurious peaks arise when the parameter is too large. In [16], the parameter is selected manually by cross validation, which not only causes inconvenience and improper selection but also results in unavailability in practice.

4. The Proposed DOA Estimation Method

Under the assumptions (A1) and (A2) in Section 2, the covariance matrix of the received signals can be expressed aswhere . In practice, the real covariance matrix is unavailable; however, it can be consistently estimated byThe estimate error is Without consideration of the error caused by Fresnel approximation, the vector form of satisfies [19]where refers to the vectorization operation, represents asymptotic normal distribution with mean and variance , and the symbol denotes Kronecker product.

Define . It can be verified that the two vectors and satisfyLet denote the estimate of and be the estimate of ; obviously, we have The estimation error of is defined asThen, the element of the estimation error can be written aswhich implieswhereBy taking advantages of the property of normal distribution, it can be derived from (17) and (22) thatTo fit the data to its data model well while finding the sparsest solution , it is better to employ the weighted least-squares method; that is,orwhere is a weighted matrix, denotes the Hermitian square root of , and is regularization parameter. As stated before, it is of significant importance to select the regularization parameter properly. Here, similar to [18], an approach to choose is given as follows.

In order to fit the data to its data model well, is set as asymptotic covariance matrix of ; that is, . From (24), it can be derived thatHence, we obtainwhere represents the asymptotic chi-square distribution with degrees of freedom. To solve the problem in (26), we introduce another parameter and should choose it high enough so that the probability of is small, which implies thatholds true with a high probability . We can find a confidence interval for and use its lower bound as a choice of . Generally, it is enough to choose to determine the parameter .

Now, the problem in (26) can be converted intowhere and denotes the Frobenius norm. Equation (30) can be solved by a MATLAB toolbox named CVX [20].

5. Range Estimation

In this section, the approach of L1-SVD [12] is exploited to estimate the range of the sources. Let denote the estimated DOAs from previous section. We define the potential source grid as to construct an overcomplete basis , where is the number of the potential ranges. The source locations are assumed to happen to be located at the grid. Then, the observed signals can be rewritten into a matrix form aswhere , , and is a row sparse matrix, the row of which is nonzero and equal to a vector if a source comes from for some and a zero vector otherwise. In order to reduce the computational cost and the influence of noise, we use the singular value decomposition (SVD) of the received signal matrix . Take the SVDto decompose the data matrix into signal and noise subspaces and keep a reduced dimensional matrix , which represents the signal subspace , where . Here, refers to a identity matrix and is a matrix of zeros. Furthermore, let and ; then we can obtainwhich can be written into a vector form asApparently, the two matrices and share the common row sparsity. However, the difference between the two matrices is that the column of the matrix is indexing by time samples while that of matrix is indexing by singular vector number. To solve the sparse signal recovery problem, the norm of all singular vector index of a particular spatial index of is calculated first; that is, ; then we impose norm penalty into all for . As a result, we can estimate the sparse matrix by minimizing the cost functionwhere . The ranges can be obtained by finding the largest peaks of once the matrix is acquired.

6. Simulation Results

In this section, some numerical experiments are given to show the effectiveness and efficiency of the proposed method. We make a comparison in terms of RMSE and resolution ability between the proposed method and the method in [16], both of which are based on the theory of sparse signal recovery. In the following simulations, the sources and noises are modeled as white Gaussian signals temporally and spatially, and 200 Monte Carlo trials are performed to calculate the average result for each experiment.

6.1. Spatial Spectra

Firstly, we present an experiment to compare the proposed method with the method in [16] in terms of spatial spectra. Consider that two closely spaced signals located at and impinge on a ULA with 15 sensors. The intersensor spacing of the ULA is assumed to be . The angular and range spatial spectra are depicted in Figures 2 and 3, respectively.

Figure 2: Angular spatial spectra for the two methods.
Figure 3: Range spatial spectra for the two methods.

According to Figures 1 and 2, it can be noted that the proposed method shows the same sharp peaks as the method in [16]. However the proposed method achieves lower errors for range and DOA estimation compared to the method in [16].

6.2. RMSE versus SNR

Subsequently, we investigate RMSE of DOA and range estimation versus SNR. To make a fair comparison, the two near-field sources are moved to and . When SNR varies from 0 dB to 14 dB with a step 2 dB, by averaging 200 snapshots, we depict the RMSE of DOA and range estimation in Figures 4 and 5, respectively. It can be clearly seen that the proposed method achieves a lower estimate error compared to the method in [16] for both DOA and range estimation.

Figure 4: RMSE of DOA estimation versus SNR.
Figure 5: RMSE of range estimation versus SNR.
6.3. RMSE versus the Number of Snapshots

In the second experiment, we evaluate RMSE of DOA and range estimation as a function of the number of snapshots. The parameters are kept the same as before except SNR = 10 dB; the RMSE of DOA and range estimation with respect to the number of snapshots are illustrated in Figures 6 and 7. According to the two figures, it can be discovered that the proposed method shows a lower RMSE than the method in [16] for different number of snapshots.

Figure 6: RMSE of DOA estimation with respect to the number of snapshots.
Figure 7: RMSE of range estimation with respect to the number of snapshots.
6.4. Resolution Ability versus SNR

In this subsection, the angular resolution ability regarding SNR is investigated. Two sources are defined to be resolved in a run if both and are smaller than , where and denote the estimate DOA and the real DOA, respectively. Consider a case in which two closely spaced signals located in and are imposed on a ULA with 15 elements and intersensor spacing . By varying SNR from 0 dB to 18 dB with a step 2 dB, the angular resolution ability for the above two methods is shown in Figure 8. It can be clearly noted that the proposed method achieves higher resolution than the method in [16].

Figure 8: Angular resolution ability as a function of SNR.
6.5. Resolution Ability versus the Number of Snapshots

Now, we assess the angular resolution ability for the above two methods as a function of the number of snapshots. The parameters used in this experiment are kept the same as the previous one except SNR = 10 dB. Figure 9 shows the resolution ability versus the number of snapshots. The results in Figure 9 indicates that the proposed method has higher resolution compared to the method in [16].

Figure 9: Angular resolution ability as a function of the number of snapshots.

According to the results from the above simulation experiments, it can be concluded that the proposed method shows a better performance compared to the method in [16] in terms of both RMSE and resolution ability, mainly because the idea of -regularized weighted least-squares is utilized in the proposed method.

7. Conclusions

In this paper, a novel near-field source localization approach is proposed for a uniform linear array. Firstly, just like the method in [16], we convert a two-dimensional source localization problem into a one-dimensional DOA estimation one by employing the correlations of symmetric sensors of the array. Then, the method of -regularized weighted least-squares is exploited to estimate the DOAs of the sources. Meanwhile, a theoretical guidance for selecting the regularization parameter is also presented. At length, the L1-SVD method is used to find the ranges of sources based on the estimated DOAs. Future research includes low computational complexity method for source localization based on sparse signal recovery since the computational cost of the proposed method is a little high.

Conflicts of Interest

The authors declare that there are no conflicts of interest regarding the publication of this paper.

Acknowledgments

This work was supported in part by Chongqing Research Program of Basic Research and Frontier Technology of China under Grant nos. cstc2015jcyjA40055 and cstc2016jcyjA0515 and in part by Chongqing Municipal Education Commission of China under Grant nos. KJ1500917 and KJ1600936.

References

  1. J. C. Chen, R. E. Hudson, and K. Yao, “Maximum-likelihood source localization and unknown sensor location estimation for wideband signals in the near-field,” IEEE Transactions on Signal Processing, vol. 50, no. 8, pp. 1843–1854, 2002. View at Publisher · View at Google Scholar · View at Scopus
  2. Y. D. Huang and M. Barkat, “Near-field multiple source localization by passive sensor array,” IEEE Transactions on Antennas and Propagation, vol. 39, no. 7, pp. 968–975, 1991. View at Publisher · View at Google Scholar · View at Scopus
  3. R. Challa and S. Shamsunder, “High-order subspace-based algorithms for passive localization of near-field sources,” in Proceedings of the 1995 Conference Record of the Twenty-Ninth Asilomar Conference on Signals, Systems and Computers, pp. 777–781, Pacific Grove, Calif, USA. View at Publisher · View at Google Scholar
  4. N. Yuen and B. Friedlander, “Performance analysis of higher order ESPRIT for localization of near-field sources,” IEEE Transactions on Signal Processing, vol. 46, no. 3, pp. 709–719, 1998. View at Publisher · View at Google Scholar · View at Scopus
  5. J. Liang and D. Liu, “Passive localization of mixed near-field and far-field sources using two-stage {MUSIC} algorithm,” IEEE Transactions on Signal Processing, vol. 58, no. 1, pp. 108–120, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  6. J. Liang and D. Liu, “Passive localization of near-field sources using cumulant,” IEEE Sensors Journal, vol. 9, no. 8, pp. 953–960, 2009. View at Publisher · View at Google Scholar · View at Scopus
  7. S. Li and D. Xie, “Compressed symmetric nested arrays and their application for direction-of-arrival estimation of near-field sources,” Sensors, vol. 16, article 1939, no. 11, 2016 pages.
  8. E. Grosicki, K. Abed-Meraim, and Y. Hua, “A weighted linear prediction method for near-field source localization,” IEEE Transactions on Signal Processing, vol. 53, no. 10, part 1, pp. 3651–3660, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  9. K. Abed-Meraim, Y. Hua, and A. Belouchrani, “Second-order near-field source localization: algorithm and performance analysis,” in Procceding of the Conference Record of the 30th Asilomar Conference on Signals, Systems and Computers, pp. 723–727, 1996.
  10. W. J. Zhi and M. Y. Chia, “Near-field source localization via symmetric subarrays,” in Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP '07), vol. 2, pp. II-1121–II-1124, Honolulu, Hawaii, USA, April 2007. View at Publisher · View at Google Scholar · View at Scopus
  11. J. Xie, H. Tao, X. Rao, and J. Su, “Comments on 'near-field source localization via symmetric subarrays',” IEEE Signal Processing Letters, vol. 22, no. 5, pp. 643-644, 2015. View at Publisher · View at Google Scholar · View at Scopus
  12. D. Malioutov, M. Çetin, and A. S. Willsky, “A sparse signal reconstruction perspective for source localization with sensor arrays,” IEEE Transactions on Signal Processing, vol. 53, no. 8, part 2, pp. 3010–3022, 2005. View at Publisher · View at Google Scholar · View at MathSciNet
  13. B. Wang, J. Liu, and X. Sun, “Mixed sources localization based on sparse signal reconstruction,” IEEE Signal Processing letters, vol. 19, no. 8, pp. 487–490, 2012. View at Publisher · View at Google Scholar · View at Scopus
  14. S. Qin, Y. D. Zhang, Q. Wu, and M. G. Amin, “Structure-aware bayesian compressive sensing for near-field source localization based on sensor-angle distributions,” International Journal of Antennas and Propagation, vol. 2015, Article ID 783467, 15 pages, 2015. View at Publisher · View at Google Scholar · View at Scopus
  15. Y. Tian and X. Sun, “Passive localization of mixed sources jointly using MUSIC and sparse signal reconstruction,” AEU—International Journal of Electronics and Communications, vol. 68, no. 6, pp. 534–539, 2014. View at Publisher · View at Google Scholar · View at Scopus
  16. K. Hu, S. P. Chepuri, and G. Leus, “Near-field source localization using sparse recovery techniques,” in Proceedings of the International Conference on Signal Processing and Communications (SPCOM '14), pp. 1–5, Bangalore, India, July 2014. View at Publisher · View at Google Scholar
  17. K. Hu, S. P. Chepuri, and G. Leus, “Near-field source localization: sparse recovery techniques and grid matching,” in Proceedings of the IEEE 8th Sensor Array and Multichannel Signal Processing Workshop (SAM '14), pp. 369–372, A Coruña, Spain, June 2014. View at Publisher · View at Google Scholar
  18. J. Yin and T. Chen, “Direction-of-arrival estimation using a sparse representation of array covariance vectors,” IEEE Transactions on Signal Processing, vol. 59, no. 9, pp. 4489–4493, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  19. B. Ottersten, P. Stoica, and R. Roy, “Covariance matching estimation techniques for array signal processing applications,” Digital Signal Processing, vol. 8, no. 3, pp. 185–210, 1998. View at Publisher · View at Google Scholar · View at Scopus
  20. M. Grant, S. Boyd, and Y. Ye, “CVX: Matlab software for disciplined convex programming,” http://cvxr.com/cvx/.