Papers › Graph-based sequential beamforming
Graph-based sequential beamforming
Yongsung Park, Florian Meyer, Peter Gerstoft
This paper presents a Bayesian estimation method for sequential direction finding. The proposed method estimates the number of directions of arrivals (DOAs) and their DOAs performing operations on the factor graph. The graph represents a statistical model for sequential beamforming. At each time step, belief propagation predicts the number of DOAs and their DOAs using posterior probability density functions (pdfs) from the previous time and a different Bernoulli-von Mises state transition model. Variational Bayesian inference then updates the number of DOAs and their DOAs. The method promotes sparse solutions through a Bernoulli-Gaussian amplitude model, is gridless, and provides marginal posterior pdfs from which DOA estimates and their uncertainties can be extracted. Compared to nonsequential approaches, the method can reduce DOA estimation errors in scenarios involving multiple time steps and time-varying DOAs. Simulation results demonstrate performance improvements compared to state-of-the-art methods. The proposed method is evaluated using ocean acoustic experimental data.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Tasks
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections