Grid-free algorithms for direction-of-arrival trajectory localization.

Direction-of-arrival (DOA) estimation algorithms are crucial in localizing acoustic sources. Traditional localization methods rely on block-level processing to extract the directional information from multiple measurements processed together. However, these methods assume that DOA remains constant throughout the block, which may not be true in practical scenarios. Also, the performance of localization methods is limited when the true parameters do not lie on the parameter search grid. In this paper, two trajectory models are proposed, namely the polynomial and harmonic trajectory models, to capture the DOA dynamics. To estimate trajectory parameters, two gridless algorithms are adopted: (i) Sliding Frank-Wolfe (SFW), which solves the Beurling LASSO problem, and (ii) Newtonized orthogonal matching pursuit (NOMP), which is improved over orthogonal matching pursuit (OMP) using cyclic refinement. Furthermore, our analysis is extended to include multi-frequency processing. The proposed models and algorithms are validated using both simulated and real-world data. The results indicate that the proposed trajectory localization algorithms exhibit improved performance compared to grid-based methods in terms of resolution, robustness to noise, and computational efficiency.

Sparse planar arrays for azimuth and elevation using experimental data.

Sparse arrays are special geometrical arrangements of sensors which overcome some of the drawbacks associated with dense uniform arrays and require fewer sensors. For direction finding applications, sparse arrays with the same number of sensors can resolve more sources while providing higher resolution than a dense uniform array. This has been verified numerically and with real data for one-dimensional microphone arrays. In this study the use of nested and co-prime arrays is examined with sparse Bayesian learning (SBL), which is a compressive sensing algorithm, for estimating sparse vectors and support. SBL is an iterative parameter estimation method and can process multiple snapshots as well as multiple frequency data within its Bayesian framework. A multi-frequency variant of SBL is proposed, which accounts for non-flat frequency spectra of the sources. Experimental validation of azimuth and elevation [two-dimensional (2D)] direction-of-arrival (DOA)estimation are provided using sparse arrays and real data acquired in an anechoic chamber with a rectangular array. Both co-prime and nested arrays are obtained by sampling this rectangular array. The SBL method is compared with conventional beamforming and multiple signal classification for 2D DOA estimation of experimental data.

Sparse Bayesian learning for beamforming using sparse linear arrays.

Sparse linear arrays such as co-prime and nested arrays can resolve more sources than the number of sensors. In contrast, uniform linear arrays (ULA) cannot resolve more sources than the number of sensors. This paper demonstrates this using Sparse Bayesian learning (SBL) and co-array MUSIC for single frequency beamforming. For approximately the same number of sensors, co-prime and nested arrays are shown to outperform ULA in root mean squared error. This paper shows that multi-frequency SBL can significantly reduce spatial aliasing. The effects of different sparse sub-arrays on SBL performance are compared qualitatively using the Noise Correlation 2009 experimental data set.

Multi-frequency sparse Bayesian learning for robust matched field processing.

The multi-snapshot, multi-frequency sparse Bayesian learning (SBL) processor is derived and its performance compared to the Bartlett, minimum variance distortionless response, and white noise constraint processors for the matched field processing application. The two-source model and data scenario of interest includes realistic mismatch implemented in the form of array tilt and data snapshots not exactly corresponding to the range-depth grid of the replica vectors. Results demonstrate that SBL behaves similar to an adaptive processor when localizing a weaker source in the presence of a stronger source, is robust to mismatch, and exhibits improved localization performance when compared to the other processors. Unlike the basis or matching pursuit methods, SBL automatically determines sparsity and its solution can be interpreted as an ambiguity surface. Because of its computational efficiency and performance, SBL is practical for applications requiring adaptive and robust processing.