2007 IEEE International Conference on Acoustics, Speech and Signal Processing - ICASSP '07 2007
DOI: 10.1109/icassp.2007.366104
|View full text |Cite
|
Sign up to set email alerts
|

Particle PHD Filtering for Multi-Target Visual Tracking

Abstract: We propose a multi-target tracking algorithm based on the Probability Hypothesis Density (PHD) filter and data association using graph matching. The PHD filter is used to compensate for miss-detections and to remove noise and clutter. This filter propagates the first order moment of the multi-target posterior (instead of the full posterior) to reduce the growth in complexity with the number of targets from exponential to linear. Next the filtered states are associated using graph matching. Experimental results… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
49
0
1

Year Published

2007
2007
2017
2017

Publication Types

Select...
5
3
2

Relationship

1
9

Authors

Journals

citations
Cited by 62 publications
(50 citation statements)
references
References 9 publications
0
49
0
1
Order By: Relevance
“…In the first video "motinas-multi-face-fast" [17], three males move quickly and occlude each other frequently. We take the second video of four objects with DV.…”
Section: Resultsmentioning
confidence: 99%
“…In the first video "motinas-multi-face-fast" [17], three males move quickly and occlude each other frequently. We take the second video of four objects with DV.…”
Section: Resultsmentioning
confidence: 99%
“…Данный подход представлен ал-горитмами на основе фильтра Калмана [10] и фильтров частиц (Particle Filters) [11,12].…”
Section: Introductionunclassified
“…For this reason, we filter the detections using a Probability Hypothesis Density filter (PHD filter) ( [14]), which helps eliminating temporally inconsistent false positives and smoothing the results of the detections (Figure 1). Once the objects are extracted, we associate objects across consecutive frames in order to establish the track X r t for object r up to time t. The trajectory X r t is estimated with a graph matching algorithm ( [21]).…”
Section: Object Extraction and Trackingmentioning
confidence: 99%