Multi-target Tracking Based on δ-GLMB Filter with
Amplitude Information
Changshun Yuan , Jun Wang , Shaoming Wei , Hong Xiang
School of Electronic and Information Engineering
Beihang University
Beijing, China
Abstract—In many multi-targets tracking scenarios, the
amplitude returning from targets are typically stronger than
those from clutters. This information could be used to enhance
the tracking performance by establishing more accurate clutter
and target likelihoods. In this paper, we incorporate the
amplitude information into the δ-Generalized Labeled Multi-
Bernoulli (δ-GLMB) filter, which is based on the random finite
set (RFS), and can output target tracks. In addition, we present
the novel update equation of the δ-GLMB filter using amplitude
likelihood function. Simulation results demonstrate the better
performance via a linear multi-target scenario.
Keywords—random finite set; multi-target tracking; δ-GLMB
filter, amplitude information; Bayesian filtering
I.
I
NTRODUCTION
Multi-target tracking is to jointly estimate the unknown and
time-varying number of the targets and the corresponding
multi-target states from the rarely perfect measurements [1].
For many sensors such as sonars, lasers and radars,
measurements not only contain the targets’ positions, but also
come with the signal amplitude. The signal amplitude from a
target is usually stronger than that of clutter. So, it provides a
kind of valuable information to decide whether the
measurement is from a target or from clutter.
The amplitude information as a measurement has been used
in the traditional multi-target tracking to improve the tracking
performance, such as Viterbi data association [2] and multiple
hypotheses tracking (MHT) [3]. However, the computational
load of the aforementioned techniques increases exponentially
as the number of measurements and targets increases due to the
necessary process of associations.
In recent time, a RFS approach was proposed by Mahler,
which could avoid associations [1]. In particular, the
development of the probability hypothesis density (PHD) [4],
the cardinalized probability hypothesis density (CPHD) [5] and
multi-Bernoulli (MB) [6] filters have demonstrated the
efficiency and practicability of the RFS approach. Meanwhile,
many researchers have incorporated the amplitude information
into the PHD, CPHD and MB filters with Gaussian Mixture
(GM) and sequential Monte Carlo (SMC) implementations [7,
12]. But targets are indistinguishable in these filters, which in
principle, are not multi-target trackers.
Vo recently proposed a δ-GLMB filter based on the labeled
RFS to address target trajectories and their uniqueness [8, 9].
To data, all of the works on the δ-GLMB filter have not
considered the amplitude information. Inspired by the results in
[7,12], this paper proposes a GM-δ-GLMB filter using
amplitude information, which is called AI-GM-δ-GLMB filter.
We introduce the likelihood function with amplitude
information, and incorporate it into the update step of the GM-
δ-GLMB filter. Simulation results for a linear multi-target
scenario are presented to demonstrate the improvements in
performance of multi-target tracking.
This paper is organized as follows: The background on
labeled RFS and δ-GLMB RFS is provided in Section 2.
Section 3 describes the proposed AI-GM-δ-GLMB filter.
Section 4 shows the simulation results for a linear multi-target
scenario. Conclusions are finally given in Section 5.
II. B
ACKGROUND
This section provides a brief review of the labeled RFS
and δ-GLMB RFS. The details on intuitive interpretations and
mathematical proofs are given in [8].
A. Labeled RFS
To estimate each target track in the multi-target scenario,
each state
∈x
is augmented by a unique label
:
α
∈= ∈
i
i
, where
represents the set of positive
integers and all
i
α
are distinct [8]. Meanwhile, each target is
identified by an ordered pair of integers
()
,= ki
, where
k
is
the new-born time, and
∈i
is a unique index to distinguish
new-born targets at the same time [8].
The definition of labeled RFS is given in [8]. A labeled
RFS with state space
and label space
is an RFS
on
×
such that each realization has unique and distinct
labels. The labels of a labeled RFS
X
is defined as
() ()
=∈Xx:xX
, where
:
×→
is the projection
written as
()
()
=x,
.
() ()
()
δ
Δ=
X
XX
is called
distinct label indicator [8].
In the following, the conventions that single-target state is
given by lowercase letter (e.g.
,
x
), while multi-target states
are denoted by uppercase letters (e.g.
X ,X
), spaces are
denoted by blackboard bolds (e.g.
,,,
), and the finite
subset of a space
is represented by
()
, are the same as
978-2-87487-045-3 © 2016 EuMA 5–7 Oct 2016, London, UK
Proceedings of the 13th European Radar Conference
189