Ba-Ngu Vo

Prof. Ba-Ngu Vo

Department of Electrical & Computer Engineering, Curtin University, Perth, Australia

Research Focus & Metrics

Academic Career Length

32Years (1995-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
16 October 2006 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
Ba-Ngu VoBa-Ngu Vo
Ba-Ngu Vo
WMW.-K. Ma
W.-K. Ma
A new recursive algorithm is proposed for jointly estimating the time-varying number of targets and their states from a sequence of observation sets in the presence of data association uncertainty, detection uncertainty, noise, and false alarms. The approach involves modelling the respective collections of targets and measurements as random finite sets and applying the probability hypothesis density (PHD) recursion to propagate the posterior intensity, which is a first-order statistic of the random finite set of targets, in time. At present, there is no closed-form solution to the PHD recursion. This paper shows that under linear, Gaussian assumptions on the target dynamics and birth process, the posterior intensity at any time step is a Gaussian mixture. More importantly, closed-form recursions for propagating the means, covariances, and weights of the constituent Gaussian components of the posterior intensity are derived. The proposed algorithm combines these recursions with a strategy for managing the number of Gaussian components to increase efficiency. This algorithm is extended to accommodate mildly nonlinear target dynamics using approximation strategies from the extended and unscented Kalman filters

1 October 2005 in IEEE Transactions on Aerospace and Electronic Systems
Verified
Journal Article
Closed access
Ba-Ngu VoBa-Ngu Vo
Ba-Ngu Vo
SSS. Singh
S. Singh
ABA. Boucet
A. Boucet
Random finite sets (RFSs) are natural representations of multi-target states and observations that allow multi-sensor multi-target filtering to fit in the unifying random set framework for data fusion. Although the foundation has been established in the form of finite set statistics (FISST), its relationship to conventional probability is not clear. Furthermore, optimal Bayesian multi-target filtering is not yet practical due to the inherent computational hurdle. Even the probability hypothesis density (PHD) filter, which propagates only the first moment (or PHD) instead of the full multi-target posterior, still involves multiple integrals with no closed forms in general. This article establishes the relationship between FISST and conventional probability that leads to the development of a sequential Monte Carlo (SMC) multi-target filter. In addition. an SMC implementation of the PHD filter is proposed and demonstrated on a number of simulated scenarios. Both of the proposed filters are suitable for problems involving nonlinear non-Gaussian dynamics. Convergence results for these filters are also established. © 2005 IEEE

16 July 2008 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
DSDominic Schuhmacher
Dominic Schuhmacher
BVBa-Tuong Vo
Ba-Tuong Vo
Ba-Ngu VoBa-Ngu Vo
Ba-Ngu Vo
The concept of a miss-distance, or error, between a reference quantity and its estimated/controlled value, plays a fundamental role in any filtering/control problem. Yet there is no satisfactory notion of a miss-distance in the well-established field of multi-object filtering. In this paper, we outline the inconsistencies of existing metrics in the context of multi-object miss-distances for performance evaluation. We then propose a new mathematically and intuitively consistent metric that addresses the drawbacks of current multi-object performance evaluation metrics.

24 April 2013 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
BVBa-Tuong Vo
Ba-Tuong Vo
Ba-Ngu VoBa-Ngu Vo
Ba-Ngu Vo
The objective of multi-object estimation is to simultaneously estimate the number of objects and their states from a set of observations in the presence of data association uncertainty, detection uncertainty, false observations, and noise. This estimation problem can be formulated in a Bayesian framework by modeling the (hidden) set of states and set of observations as random finite sets (RFSs) that covers thinning, Markov shifts, and superposition. A prior for the hidden RFS together with the likelihood of the realization of the observed RFS gives the posterior distribution via the application of Bayes rule. We propose a new class of RFS distributions that is conjugate with respect to the multiobject observation likelihood and closed under the Chapman-Kolmogorov equation. This result is tested on a Bayesian multi-target tracking algorithm.

12 May 2014 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
SRStephan Reuter
Stephan Reuter
BVBa-Tuong Vo
Ba-Tuong Vo
Ba-Ngu VoBa-Ngu Vo
Ba-Ngu Vo
KDKlaus Dietmayer
Klaus Dietmayer
This paper proposes a generalization of the multi- Bernoulli filter called the labeled multi-Bernoulli filter that outputs target tracks. Moreover, the labeled multi-Bernoulli filter does not exhibit a cardinality bias due to a more accurate update approximation compared to the multi-Bernoulli filter by exploiting the conjugate prior form for labeled Random Finite Sets. The proposed filter can be interpreted as an efficient approximation of the δ-Generalized Labeled Multi-Bernoulli filter. It inherits the advantages of the multi-Bernoulli filter in regards to particle implementation and state estimation. It also inherits advantages of the δ-Generalized Labeled Multi-Bernoulli filter in that it outputs (labeled) target tracks and achieves better performance.

31 October 2008 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
BVBa-Tuong Vo
Ba-Tuong Vo
Ba-Ngu VoBa-Ngu Vo
Ba-Ngu Vo
ACAntonio Cantoni
Antonio Cantoni
It is shown analytically that the multitarget multiBernoulli (MeMBer) recursion, proposed by Mahler, has a significant bias in the number of targets. To reduce the cardinality bias, a novel multiBernoulli approximation to the multi-target Bayes recursion is derived. Under the same assumptions as the MeMBer recursion, the proposed recursion is unbiased. In addition, a sequential Monte Carlo (SMC) implementation (for generic models) and a Gaussian mixture (GM) implementation (for linear Gaussian models) are proposed. The latter is also extended to accommodate mildly nonlinear models by linearization and the unscented transform.