1 May 2024 in The Journal of the Acoustical Society of America
This study presents a method for real-time capable localization of impulsive acoustic events in urban terrain, omitting the need for precomputation phases, such as in time matching or impulse response matching. Using ray casting, solutions of the wave equation are computed using a boundary discretization of intersected objects, forming a weighted graph using line of sight checks, and deploying an A* search graph traversal algorithm for the calculation of the propagation time. Subsequently, the wave amplitude along the identified eigenrays is computed. The study discusses the properties and suitability of cost functions based on time differences of arrival, amplitude differences of arrival, and a combined cost function for iterative ray-based localization. The method is validated using pressure data of the muzzle blasts of various firearms collected via unattended ground sensors during an experimental campaign at the military urban combat facility in Walenstadt, Switzerland.
5 December 2022 in Ocean Engineering
25 June 2025 in Aerospace Science and Technology
17 April 2026 in IEEE Transactions on Signal Processing
Multi-source localization from time difference of arrival measurements in sensor networks is challenging in the presence of clutter, timing uncertainty, missed detections, and an unknown number of sources. We propose a combinatorial framework that jointly addresses these challenges by evaluating feasible subsets of detections, referred to as coalitions. Each coalition is assigned an associated cost defined as the ℓ∞-norm of the time difference of arrival residuals. We retain coalitions whose residual lies below a user-specified pseudorange threshold, providing a physically interpretable control of coalition feasibility. Coalition selection is performed using a family of set packing algorithms, including greedy and binary integer linear programming formulations with cost-based and lexicographic objectives. The lexicographic variants maximize sensor consensus by prioritizing, from largest to smallest cardinality, the number of selected disjoint detection coalitions, and break ties by minimizing the sum of coalition costs. This provides a unified, geometrically consistent framework for joint data association based on maximized sensor consensus, clutter suppression, source counting, and localization. The methods are benchmarked using Monte Carlo simulations under varying levels of clutter, time jitter, and missed detections, as well as using an acoustic dataset recorded in an urban environment.
1 January 2026 in The Journal of the Acoustical Society of America
This study presents an iterative numerical scheme for Helmholtz scattering with Neumann boundary conditions, modeling scattering from bounded convex bodies as a sum over propagation paths. The solution is expressed as the sum of the incident wavefield, specular reflection, and edge diffraction contributions. Recasting the Neumann series representation of the nth-order solution into tensor form provides a path interpretation and formally connects iterative path-tracing approaches to the known diffraction operator solution of the scattering problem. The study applies Nyström discretization to the nested diffraction integral, yielding reusable path diffraction coefficients. An iterative scheme is proposed that efficiently explores this path-tensor structure through successive expansions. The absolute value of the wavefield associated with each path serves as the ordering key in a max heap prioritization scheme. Numerical scattering experiments on the unit cube demonstrate rapid convergence. Relative L2-norm differences in the Dirichlet trace drop below 5%, 3.5%, and 3% after 10 000 iteration steps for wavenumbers k=2,4,6 m−1, respectively, when compared to results from direct boundary element formulations. For the k=2 m−1 case, which shows the largest trace error after 10 000 iteration steps, relative L2-norm errors of <2.5% and relative L∞-norm errors of <4% in the domain are observed.
1 January 2026 in IEEE Signal Processing Letters