Time difference of arrival (TDOA) measurements, which are contaminated by large values of error, known as outliers, would have a significant impact on the accuracy of sound source localization (SSL) in wireless acoustic sensor networks (WASNs). Few techniques are reported in the literature to tackle SSL in WASNs by taking TDOA outliers into consideration. To mitigate the effect of outliers on the accuracy of SSL, we propose outlier-resistant robust sound source localization (RSSL) algorithms based on sparse regularization using an unsynchronized network of microphone arrays. The TDOA errors are divided into two components: a) energy-bounded inliers and b) outliers. Assuming that outliers are sparse in the measurement set, we formulate the RSSL problem as that of minimizing the number of outliers, mathematically, a $\ell _{0}$ (pseudo)-norm optimization problem with non-convex constraints. Five sub-optimal RSSL solvers are derived, among which the first two solvers are applicable to the scenario involving only outliers while the last three solvers concentrate on the scenario incorporating both outliers and inliers. In common, these solvers exploit a convex approximation technique called Concave Convex Procedure to dispose of the non-convex constraints. Differently, the first solver approximates the original $\ell _{0}$ (pseudo)-norm cost function with the $\ell _{1}$ norm while a concave surrogate function is adopted in the second solver to yield a tighter approximation to the $\ell _{0}$ (pseudo)-norm. Apart from the application of these two approximation techniques, the third and fourth solvers relax the non-convex $\ell _{2}$ norm constraint with the $\ell _{\infty }$ norm. The fifth solver is dedicated to the $\ell _{1}$ norm regularization problem with the Lasso formulation, which is equivalent to the M-estimator of Huber’s function solved via the iteratively reweighted least squares paradigm. Experimental results validate the effectiveness and robustness of the proposed algorithms.
19 August 2019 in IEEE/ACM Transactions on Audio, Speech, and Language Processing
In this paper, we address the multiple sound source localization problem by associating and fusing the direction of arrival (DOA) estimates from multiple microphone arrays. For multi-source scenarios especially in indoor environments, a critical issue is to tell the correspondence among DOA estimates across different arrays, which is known as the data association problem. We propose a multi-dimensional assignment-based data association approach to find the optimal associations of DOA estimates from the same source. First, in the sense of maximum likelihood, the data association problem is formulated by finding the most likely partition of the measurement set into the source-originated and false alarm-originated subsets. Next, by defining the association costs appropriately, the problem of finding the most likely measurement partition is transformed into a generalized multi-dimensional assignment problem which can be solved efficiently by a Lagrangian relaxation algorithm. After the optimal associations of DOA estimates across different arrays are obtained, the locations of sources can be estimated by fusing the same source-originated DOA estimates. In the presence of missed detections, false alarms and the unknown number of sources, the proposed method achieves high accuracy in data association and localization, and outperforms the competing method in reverberant and noisy environments. In addition, since our method does not require additional features and uses DOA estimates only, it is more computationally efficient than the competing method.
1 January 2021 in The Journal of the Acoustical Society of America
Multisource localization using time difference of arrival (TDOA) is challenging because the correct combination of TDOA estimates across different microphone pairs, corresponding to the same source, is usually unknown, which is termed as the data association problem. Moreover, many existing multisource localization techniques are originally demonstrated in two dimensions, and their extensions to three dimensions (3D) are not straightforward and would lead to much higher computational complexity. In this paper, we propose an efficient, feature-based approach to tackle the data association problem and achieve multisource localization in 3D in a distributed microphone array. The features are generated by using interchannel phase difference (IPD) information, which indicates the number of times each frequency bin across all time frames has been assigned to sources. Based on such features, the data association problem is addressed by correlating most similar features across different microphone pairs, which is executed by solving a two-dimensional assignment problem successively. Thereafter, the locations of multiple sources can be obtained by imposing a single-source location estimator on the resulting TDOA combinations. The proposed approach is evaluated using both simulated data and real-world recordings.
11 September 2023 in IEEE Transactions on Aerospace and Electronic Systems
In many applications of wireless sensor networks (WSNs), sensor positions are often not known exactly. The existence of sensor position error (SPE) may significantly impact system per-formance if not appropriately modeled or considered. In this paper, we address the important sensor selection problem in the presence of SPE for general non-linear measurement models considering independent and correlated measurement noise cases. The sensor selection problem is formulated in the framework of sparse sensing, in which the number of activated sensors is minimized subject to certain predetermined performance constraints. To facilitate challenging convex relaxation of non-convex constraints for the case with independent measurement noise, we prove that the Fisher Information Matrix (FIM) remains additive even in the presence of SPE. For correlated measurement noise, quadratic inequality constraints are introduced and two sub-optimal solvers are pro-posed. The first solver uses matrix decomposition to transform the quadratic constraint into linear matrix inequalities (LMI), while the second solver iteratively performs a linearization procedure on the quadratic constraint to obtain a reduced dimension of LMI, thus decreasing the computational complexity significantly. The proposed algorithms are compared in terms of their computational complexity quantitatively and experimentally with sub-optimal greedy approaches and existing algorithms ignoring SPE. The results show the importance and necessity of considering SPE when implementing sensor selection and demonstrate the effectiveness of the proposed three sensor selection solvers.
1 February 2024 in The Journal of the Acoustical Society of America
The steered response power (SRP) with phase transform algorithm has been demonstrated to be robust against reverberation and noise for single-source localization. However, when this algorithm is applied to multisource localization (MSL), the “peak missing problem” can occur, namely, that some sources dominate over others over short time intervals, resulting in fewer significant SRP peaks being found than the true number of sources. This problem makes it difficult to detect all the sources among the available SRP peaks. We propose an iteratively reweighted steered response power (IR-SRP) approach that effectively solves the “peak missing problem” and achieves robust MSL in reverberant noisy environments. The initial IR-SRP localization function is computed over the time-frequency (T-F) bins selected by a combination of two weighting schemes, one using coherence, and the other using signal-to-noise ratio. When iterating, our method finds the significant SRP peaks for the dominant sources and eliminates the T-F bins contributed by these sources using inter-channel phase difference information. As a result, the remaining sources can be found in subsequent iterations among the remaining T-F bins. The proposed IR-SRP method is demonstrated using both simulated and measured experiment data.