- Research
- Open Access
2-D DOA tracking using variational sparse Bayesian learning embedded with Kalman filter
- Qinghua Huang^{1}Email author,
- Jingbiao Huang^{1},
- Kai Liu^{1} and
- Yong Fang^{1}
https://doi.org/10.1186/s13634-018-0541-0
© The Author(s). 2018
- Received: 24 May 2017
- Accepted: 15 March 2018
- Published: 13 April 2018
Abstract
In this paper, we consider the 2-D direction-of-arrival (DOA) tracking problem. The signals are captured by a uniform spherical array and therefore can be analyzed in the spherical harmonics domain. Exploiting the sparsity of source DOAs in the whole angular region, we propose a novel DOA tracking method to estimate the source locations and trace their trajectories by using the variational sparse Bayesian learning (VSBL) embedded with Kalman filter (KF). First, a transition probabilities (TP) model is used to build the state transition process, which assumes that each source moves to its adjacent grids with equal probability. Second, the states are estimated by KF in the variational E-step of the VSBL and the variances of the state noise and measurement noise are learned in the variational M-step of the VSBL. Finally, the proposed method is extended to deal with the off-grid tracking problem. Simulations show that the proposed method has higher accuracy than VSBL and KF methods.
Keywords
- 2-D direction-of-arrival (DOA) tracking
- Spherical array
- Transition probabilities (TP) model
- Variational sparse Bayesian learning (VSBL)
- Kalman filter (KF)
1 Introduction
Direction-of-arrival (DOA) estimation is an active research field of array signal processing and has been used in various applications, such as radar, channel modeling, tracking, and surveillance [1–3]. Among the estimation algorithms, multiple signal classification (MUSIC) and estimation of signal parameters via rotational invariance techniques (ESPRIT) are the most representative methods, which employ the signal and noise subspaces. Compared with the conventional beamforming algorithms, these methods enhance the estimation precision. However, the number of impinging signals must be the prior knowledge and the computational complexity of decomposing the covariance matrix increases when the number of array elements rises. Recently, sparse reconstruction methods have attracted substantial attention because the signals impinging on an array are intrinsically sparse in the spatial domain [4, 5]. In these methods, the whole angular domain is divided into some predefined grids and a measurement matrix is constructed by sampling these grids. Based on the singular value decomposition (SVD), an approach named as l_{1}-SVD was proposed to reduce the computational complexity and enforce sparsity using l_{1}-norm [6]. Compared with the l_{1}-SVD method, sparse Bayesian learning (SBL) can model the sparse signals more flexibly and give more accurate recovery results [7–9]. When SBL was used to estimate DOA, the sparse prior for the interested signals is Gaussian [10] or Laplacian distribution [11]. The SBL method can achieve good estimation results for static DOA estimation.
In the case of tracking moving targets, most methods assume that each source angle is constant during a time interval. However, it may differ from one interval to another because of the moving sources [12]. There are some different approaches to track the DOAs of moving sources, such as classical subspace optimization approach, sparsity recovery theory, and adaptive filter method. The subspace optimization approaches only optimize the signal or noise subspace without using the eigenvalue decomposition (EVD) so that they can reduce the computational complexity and storage requirements. Yang presented a new approach to track the signal subspace using an unconstrained minimization method [13]. The subspace method, which can be used to dynamic DOAs, was extended in L-shaped array [14] and two parallel linear arrays [15], respectively. The performance of the subspace method relies on the number of snapshots. This kind of method is inapplicable for the moving targets when the number of snapshots in each time interval is relatively small.
Vaswani et al. reviewed many algorithms on the analysis of dynamic sparse signal recovery. If the support change is highly correlated and the correlation model is known, we can get an accurate support estimation by using the previous estimation information [16–18]. In [19, 20], these methods combined the slow signal value change and slow support change to enhance the precision. Most of these methods are the deformation of basis pursuit denoising. A sequential Bayesian algorithm was introduced to estimate the moving DOAs in the time-varying circumstance [21]. It assumed that the sources move at a constant velocity and used this hypothesis to construct the signal-moving model. The locally competitive algorithm (LCA) was proposed to construct a dynamic system and track DOAs [22]. This method mainly introduced a thresholding function to enforce sparsity. A model was proposed to describe a time-varying array response in the frequency domain for each source [23]. The key of this paper is that it utilizes a hidden Markov model to describe the moving signal and uses the posterior inference to estimate the signal positions. It traps into the local optimum when the signals alias at high frequency.
The Kalman filter (KF) method is the most representative method for tracking sources in the adaptive filter theory, which means the value of the predicted state should equal to the value of the actual state by minimizing the Bayesian mean square error of the state vector. However, the variance of the noise and state can be seen as prior in the KF method. In [24], the time difference of arrival (TDOA) information was calculated by a pair of microphones and a distributed unscented KF method was used to track speakers in a nonlinear measurement model. The method combining KF with compression sensing was also used for dynamic DOA estimation [25, 26]. The state transition function was built under the assumption that the bearing change rate had been known [25]. This assumption is hard to be satisfied in real applications. A Bayesian compressive sensing Kalman filter (BCSKF) method [26] was proposed to track dynamic moving sources. This method used the constant DOA changes in the KF prediction, which meant that the source moved to the designated direction with a fixed step. The particle filter was utilized to track the trajectory of target. It adopted a series of particles to represent the posterior distribution of signal stochastic process. For example, an algorithm combining compressive sense and particle filter was introduced in [27]. However, it only used the compressive sense to estimate the original position and utilized particle filter to track the trajectory.
In this paper, a spherical array is used to track the moving sources in 3-D space because the array is 3D symmetric structure and can capture high-order sound field information [28–30]. Besides, comparing with linear array, spherical array can capture the two-dimension information of signal rather than single-angle information. In addition, due to the special construction of spherical array, the receiving signal can be unfolded in special harmonic domain, which can separate the signal position coordinates and sensor position coordinates conveniently.
A new method is proposed based on the spherical array to track the 2-D dynamic DOAs. It combines the variational Bayesian inference and KF to improve the tracking performance. First, a transition probabilities (TP) model is built to describe the state transition process of a signal. In this model, the source moves to an uncertain situation with an equal probability rather than a determining expected DOA change in [26]. In addition, TP model is convenient to build with a tracking framework and adopts sparse methods to estimate signal position. Based on this model, an alternating iterative method is developed to track DOAs. In the first step, we use the KF method to estimate the signal values. In the second step, we use variational sparse Bayesian learning (VSBL) to learn the variances of the measurement noise and state noise, which are useful to update the signal state in the KF method. This is an interdependent process.
There are three differences between the proposed approach and the method appeared in paper [26]. On the one hand, the proposed method constructs a real-valued steering matrix in signal model rather than splitting the complex value into several real-valued ones, which can reduce a half of the computational quantity approximately. On the other hand, the KF estimation values is used instead of the Bayesian estimation values. The main contribution of paper [26] is putting the estimation parameters of KF to optimize the low bound of relate vector machine. However, the KF estimation will be embedded in VSBL to improve the precision further in this paper. Finally, we introduce the off-grid model to overcome the mismatch problems.
The rest of the paper is organized as follows. The real-valued array signal model is given in Section 2. The variational Bayesian inference is briefly reviewed, and the proposed tracking method is introduced in Sections 3 and 4. Numerical examples and simulation results are given in Section 5. Section 6 concludes the paper.
(a, b, A, B, ⋯), scalar variable | arg(⋅), phase operator |
(A, B, ⋯), the matrix variable | |⋅|, the absolute value |
(a, b, ⋯), column vector | (⋅)^{+}, the Moore-Penrose pseudo inverse |
(⋅)^{ T }, transpose operator | (⋅)^{'}, the derivation operator |
(⋅)^{∗}, complex conjugation operator | ‖⋅‖, l_{2} norm |
(⋅)^{ H }, conjugate transpose operator | ‖⋅‖_{ F }, Frobenius norm |
diag(⋅), diagonal matrix | 〈⋅〉, expectation operator |
blkdiag(⋅), block diagonal matrix | A(n, :), the nth row of matrix A |
Re(⋅), the real parts of a complex value | A(:, n), the nth column of matrix A |
exp(⋅), the exponent signal | Im(⋅), the imaginary parts of a complex value |
k, the wavenumber | D, the number of signals |
(ϑ_{ l }, φ_{ l }), the elevation and azimuth of the sensor | \( \left({\overset{\smile }{\theta}}_{d,t},{\overset{\smile }{\phi}}_{d,t}\right) \), the elevation and azimuth of the dth signal at the tth time interval |
L, the number of sensors | t, time interval |
B, snapshots | R, the radius of sphere array |
G_{1}, G_{2}, the azimuth and elevation range | i, the imaginary unit \( \sqrt{-1} \) |
\( \left(\overset{\smile }{\mathbf{X}},\overline{\mathbf{X}},\mathbf{X}\right) \), the space domain, spherical domain and real-valued receiving signal | \( \left(\overset{\smile }{\mathbf{A}},\widehat{\mathbf{A}},\overline{\mathbf{A}},\mathbf{A}\right) \), the true steering, dictionary, the spherical and real-valued matrix |
\( \left(\overset{\smile }{\mathbf{S}},\overline{\mathbf{S}},\mathbf{S}\right) \), the space amplify, the sparse amplify signal and the real-valued amplify signal | \( \left(\overset{\smile }{\mathbf{V}},\overline{\mathbf{V}},\mathbf{V}\right) \), the space domain, the spherical and the real-valued noise |
h_{ n }, spherical Hankel function of order n | \( {Y}_n^m\left(\cdot \right) \), the spherical harmonic of order n and degree m |
I_{ n }, an n × n identity matrix | j_{ n }, the n-order spherical Bessel function |
J_{ n }, the exchange matrix with ones on its antidiagonal and zeros elsewhere | (⋅)^{'}, the derivation operators |
Γ(⋅), a Gamma function | 0_{ n }, a column vector containing n zeros |
(Ab), take the variables A except variable b |
2 Real-valued array signal model
where 0 ≤ n ≤ N, − n ≤ m ≤ n, and \( {P}_n^m\left(\cos \theta \right) \) are the associated Legendre polynomials [32].
where \( {\overline{\mathbf{X}}}_t={\mathbf{B}}^{-1}(k){\mathbf{Y}}^{+}\left(\boldsymbol{\Omega} \right){\overset{\smile }{\mathbf{X}}}_t \), \( \overline{\mathbf{A}}={\mathbf{Y}}^H\left(\boldsymbol{\Phi} \right) \), and \( {\overline{\mathbf{V}}}_t={\mathbf{B}}^{-1}(k){\mathbf{Y}}^{+}\left(\boldsymbol{\Omega} \right){\overset{\smile }{\mathbf{V}}}_t \). Owing to the special property of spherical harmonic function, the complex-valued model can be transformed into a real-valued one to reduce the computational complexity.
Now, the real-valued signal model (20) is obtained in the spherical harmonics domain.
3 Variational sparse Bayesian learning embedded with Kalman filter (VSBLKF) for 2-D DOA tracking
where E_{ t } is the state noise.
where μ indicates one of the parameter and 〈lnp(X, θ)〉_{ θ μ } is the expectation of the joint probability of the data and latent variables which take over all variables except μ.
where Γ(⋅) is a Gamma function [40]. The expectation of α_{g, t} in (34) is 〈α_{g, t}〉 = a_{g, t}/b_{g, t}. Note that the marginal distribution of S_{ t } can be obtained by integrating over α_{ t }. Note that if the prior distribution and likelihood function conjugate each other, it will make the posterior distribution to have the same form with prior distribution [36].
The variational framework introduces a factorial representation (27) approximating to the posterior distribution p(α_{ t }, S_{ t }, Δ_{ t }| X_{ t }) by Q(α_{ t }, S_{ t }, Δ_{ t }) = Q(S_{ t })Q(α_{ t })Q(Δ_{ t }). We propose the VSBLKF algorithm using the expectation maximization (EM) updates. In order to compute the E-step, it needs to know the posterior distribution of the unknown sparse state signal, which is Gaussian with mean U_{t ∣ t} and covariance Σ_{t ∣ t}. These parameters can be computed by using KF prediction and updating equations as follows:
Comparison of computational load in one iteration
Real multiplication | Real addition | ||
---|---|---|---|
Complex-valued model | \( {\mathbf{A}}_{t,c}^H{\boldsymbol{\Sigma}}_{t\mid t-1} \) | 4JG^{2} | (4J − 2)G^{2} |
\( {\mathbf{A}}_{t,c}^H{\mathbf{S}}_{t,c} \) | 4JG | (4G − 2)J | |
Real-valued model | \( {\mathbf{A}}_{t,r}^H{\boldsymbol{\Sigma}}_{t\mid t-1} \) | 2JG^{2} | 2(J − 1)G^{2} |
\( {\mathbf{A}}_{t,r}^H{\mathbf{S}}_{t,r} \) | 2JG | 2(G − 1)J |
4 Extension to off-grid problem
The initial value of β and γ are set as 0_{ G } (a column vector containing G zeros). The number of source signals is known a priori. Each signal current coarse location can be approximated by VSBLKF and the biases between the reference and estimation are gauged using (59) and (60), respectively. The concrete steps are summarized in Algorithm 2.
5 Results and discussion
In this section, we want to verify the robustness and performance of the proposed algorithm compared with the standard KF, SBL, and VSBL methods. We use a rigid spherical array, which has 32 sensors distributed in a uniform way and radius R = 0.1 m. The maximum order of the spherical harmonics is N = 4. In our experiments, the ranges of elevation and azimuth are defined from 0° to 180° and from 0° to 360°. We divide them into 31 and 62 grids with stationary angular interval respectively. Therefore, there are 1922 grids which are the possible angles for source signals. Note that we only choose the range of azimuth from 0° to 180° in our simulations to reduce the calculate complexity. In the moving process, assuming each source is likely to move to its adjacent grids or stay at current grid, which means a source can move to the different directions with 6° or be static with equal probability. The proposed method can track other trajectories as long as the trajectory can be described by the grids and obey the TP model. The trajectory used in this paper is randomly generated under the frame of TP model. In order to show a series of performance quantitatively, such as on-grid, off-grid, and RMSE vs SNR, we used one trajectory to explain these results. One random realization of this movement model is considered for T = 50 time interval. The number of Monte Carlo trials is 500. The hyperpriors \( {a}_{g,t},{b}_{g,t},{b}_{j,t}^{\left(\Delta \right)},{c}_{j,t} \) are set as 10^{‐3}.
5.1 Example 1: the performance of the proposed method with an on-grid model
5.2 Example 2: the RMSE versus SNR with an on-grid model
5.3 Example 3: the performance of the proposed method with an off-grid model
5.4 Example 4: the RMSE versus SNR with an off-grid model
5.5 Example 5: the RMSE versus different grids
5.6 Example 6: the performance of the proposed method for multiple signals
5.7 Example 7: the cost time versus different methods
Comparison of time cost for different methods
VSBL | VSBLKF (real) | OGVSBLKF (real) | VSBLKF (complex) | OGVSBLKF (complex) | |
---|---|---|---|---|---|
Time(s) | 4.51 | 21.23 | 28.51 | 44.31 | 55.36 |
6 Conclusions
In order to track the 2-D DOAs, we construct the state transition function according to the TP model based on a spherical array. The angular space is divided into grids to model a sparse signal. Through combining VSBL and KF methods, we propose an effective method called VSBLKF to track dynamic DOAs, where the KF estimation is embedded into the VSBL to estimate the signals. Besides, we extend our algorithm to the off-grid model. Simulations show that the proposed method achieves better tracking and anti-noise performance than VSBL and KF. In the future, we will extend the algorithm to wideband signals.
Declarations
Acknowledgements
The authors would like to thank the editor and anonymous reviewers for their valuable comments.
Funding
The work was supported by the National Natural Science Foundation (61571279, 61501288) and the Shanghai Science and Technology Commission Scientific Research Project (16010500100).
Authors’ contributions
QH and JH designed and implemented the proposed algorithm and wrote the paper. KL and YF scientifically supervised the work and contributed in implementing the proposed algorithm. All authors read and approved the final manuscript.
Competing interests
The authors declare that they have no competing interests.
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Open AccessThis article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
Authors’ Affiliations
References
- A Hassanien, SA Vorobyov, Transmit energy focusing for DOA estimation in MIMO radar with colocated antennas. IEEE Trans. Signal Process. 59(6), 2669–2682 (2011)MathSciNetView ArticleGoogle Scholar
- H Krim, M Viberg, Two decades of array signal processing research: the parametric approach. IEEE Signal Process. Mag. 13(4), 67–94 (1996)View ArticleGoogle Scholar
- A Boukerche, H Oliveira, E Nakamura, A Loureiro, Localization systems for wireless sensor networks. IEEE Trans. Wirel. Commun. 14(6), 6–12 (2007)View ArticleGoogle Scholar
- M Carlin, P Rocca, G Oliveri, Directions-of-arrival estimation through Bayesian compressive sensing strategies. IEEE Trans. Antennas Propag. 61(7), 3828–3838 (2013)MathSciNetView ArticleMATHGoogle Scholar
- B Wang, J Liu, X Sun, Mixed sources localization based on sparse signal reconstruction. IEEE Signal Process. Lett. 19(8), 487–490 (2012)View ArticleGoogle Scholar
- D Malioutov, M Cetin, A Willsky, A sparse signal reconstruction perspective for source localization with sensor arrays. IEEE Trans. Signal Process. 53(8), 3010–3022 (2005)MathSciNetView ArticleMATHGoogle Scholar
- D Wipf, B Rao, An empirical Bayesian strategy for solving the simultaneous sparse approximation problem. IEEE Trans. Signal Process. 55(7), 3704–3716 (2007)MathSciNetView ArticleGoogle Scholar
- S Ji, Y Xue, L Carin, Bayesian compressive sensing. IEEE Trans. Image Process. 56(6), 2346–2356 (2008)MathSciNetView ArticleGoogle Scholar
- S Babacan, R Molina, A Katsaggelos, Bayesian compressive sensing using Laplace priors. IEEE Trans. Image Process. 19(1), 53–63 (2010)MathSciNetView ArticleMATHGoogle Scholar
- DP Wipf, BD Rao, An empirical Bayesian strategy for solving the simultaneous sparse approximation problem. IEEE Trans. Signal Process 55(7), 3704–3716 (2007)Google Scholar
- SD Babacan, R Molina, AK Katsaggelos, Bayesian compressive sensing using Laplace priors. IEEE Trans. Image Process. 19(1), 53–63 (2010)MathSciNetView ArticleMATHGoogle Scholar
- JF Gu, SC Chan, WP Zhu, et al., Joint DOA estimation and source signal tracking with Kalman filtering and regularized QRD RLS algorithm. IEEE Trans Circuits. Syst. II, Exp Briefs 60(1), 46–50 (2013)View ArticleGoogle Scholar
- B Yang, Projection approximation subspace tracking. IEEE Trans. Signal Process. 43(1), 95–107 (Jan. 1995)View ArticleGoogle Scholar
- C Liu, G Wang, J Xin, et al., Low complexity subspace-based two-dimensional direction-of-arrivals tracking of multiple targets. Proc. ICSP, 1825–1829 (2012)Google Scholar
- J Wu, J Xin, G Wang, et al., Two-dimensional direction tracking of coherent signals with two parallel uniform linear arrays. Proc. ICSP, 183–187 (2012)Google Scholar
- N Vaswani, J Zhan, Recursive recovery of sparse signal sequences from compressive measurements: a review. IEEE Trans. Signal Process. 64(13), 3523–3549 (2016)MathSciNetView ArticleGoogle Scholar
- N Vaswani, LS-CS-residual (LS-CS): compressive sensing on least squares residual. IEEE Trans. Signal Process. 58(8), 4108–4120 (2010)MathSciNetView ArticleGoogle Scholar
- N Vaswani, W Lu, Modified-CS: modifying compressive sensing for problems with partially known support. IEEE Trans. Signal Process. 58(9), 4595–4607 (2010)MathSciNetView ArticleGoogle Scholar
- M Friedlander, H Mansour, et al., Recovering compressively sampled signals using partial support information. IEEE Trans. Inf. Theory 58(2), 1122–1134 (2012)MathSciNetView ArticleMATHGoogle Scholar
- W Lu, N Vaswani, Regularized modified BPDN for noisy sparse reconstruction with partial erroneous support and signal value knowledge. IEEE Trans. Signal Process. 60(1), 182–196 (2012)MathSciNetView ArticleGoogle Scholar
- XZ Gao et al., A sequential Bayesian algorithm for DOA tracking in time-varying environments. Chin. J. Electron. 24(1), 140–145 (2015)View ArticleGoogle Scholar
- J Jia, L Yu, H Sun, et al., Dynamic DOA estimation via locally competitive algorithm. Proc. ICSP, 336–340 (2014)Google Scholar
- Higuchi, Takuya, et al. Underdetermined blind separation and tracking of moving sources based on DOA-HMM. IEEE Int. Conf. Acoust, Speech and Signal Process, 3191-3195 (2014).Google Scholar
- Y Tian, Z Chen, F Yin, Distributed imm-unscented kalman filter for speaker tracking in microphone array networks. IEEE Trans. Audio Speech Language Process. 23(10), 1637–1647 (2015)View ArticleGoogle Scholar
- P Khomchuk, I Bilik, Dynamic direction-of-arrival estimation via spatial compressive sensing. Proc. Radar, 1191–1196 (2010)Google Scholar
- M Hawes, L Mihaylova, F Septier, et al., A Bayesian compressed sensing Kalman filter for direction of arrival estimation. Proc. IEEE Int. Conf. Inf. Fusion, 969–975 (2015)Google Scholar
- F Ning, L Ning, et al., Combining compressive sensing with particle filter for tracking moving wideband sound sources. IEEE Int. Conf. Signal Process, Commun and Comput, 1–6 (2015)Google Scholar
- B Rafaely, Analysis and design of spherical microphone arrays. IEEE Trans. Speech, Audio Process. 13(1), 135–143 (2005)View ArticleGoogle Scholar
- Q Huang, T Wang, Acoustic source localization in mixed field using spherical microphone arrays. EURASIP J. Adv. Sign. Process. 2014(1), 1–16 (2014)View ArticleGoogle Scholar
- R Goossens, H Rogier, 2-D angle estimation with spherical arrays for scalar fields. Signal Process., IET 3(3), 221–231 (2009)MathSciNetView ArticleGoogle Scholar
- H Sun, S Yan, U Svensson, Robust spherical microphone array beamforming with multi-beam-multi-null steering, and sidelobe control. in Proc. IEEE Workshop Appl. Signal Process. Audio Acoust, 113–116 (2009)Google Scholar
- B. Rafaely, Fundamentals of Spherical Array Processing, Springer, chapter 1, pp. 10, 2015.Google Scholar
- DA Linebarger, RD DeGroat, EM Dowling, Efficient direction-finding methods employing forward-backward averaging. IEEE Trans. Sign. Proc. 42, 2136–2145 (1994)View ArticleGoogle Scholar
- A Roda, C Micheloni, Tracking sound sources by means of HMM. IEEE Int. Conf. Adv. Video and Signal-Based Surveillance, 83-85 (2011) Google Scholar
- S Farahmand, GB Giannakis, G Leus, et al., Tracking target signal strengths on a grid using sparsity. Eurasip J. Adv. Sign. Proc. 2014(1), 1–17 (2011)Google Scholar
- C Bishop, Pattern recognition and machine learning (Springer-Verlag, New York, 2008), pp. 477–482Google Scholar
- MJ Wainwright, MI Jordan, Graphical models, exponential families, and variational inference. Now Publishers Inc, pp. 159–164, 2008Google Scholar
- EP Xing, MI Jordan, S Russell, A generalized mean field algorithm for variational inference in exponential families. Proceed. Conf. Uncertainty Artific. Intel, 583–591 (2012)Google Scholar
- DG Tzikas, AC Likas, NP Galatsanos, The variational approximation for Bayesian inference. IEEE Sign. Proc. Magazine. 25(6), 131–146 (2008)View ArticleGoogle Scholar
- P. Sebah, X. Gourdon, “Introduction to the Gamma Function,” [Online]. Available: http://www.csie.ntu.edu.tw/~b89089/link/gammaFunction.pdf.
- Z Yang, L Xie, C Zhang, Off-grid direction of arrival estimation using sparse Bayesian inference. IEEE Trans. Signal Process. 61(1), 38–43 (2013)MathSciNetView ArticleGoogle Scholar