2012
DOI: 10.1016/j.isatra.2012.02.002
|View full text |Cite
|
Sign up to set email alerts
|

Applying mean shift, motion information and Kalman filtering approaches to object tracking

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
17
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
8
1
1

Relationship

0
10

Authors

Journals

citations
Cited by 56 publications
(18 citation statements)
references
References 13 publications
0
17
0
Order By: Relevance
“…In this model, hue and shape are used as complementary features. One of the main parts of particle filter is dissemination algorithm of conditional probability density function [21][22][23][24][25][26][27][28][29][30][31][32][33]. An improved factored sampling algorithm is also realized to resample and weight particles.…”
Section: A Review Of Most Important Applied Methodsmentioning
confidence: 99%
“…In this model, hue and shape are used as complementary features. One of the main parts of particle filter is dissemination algorithm of conditional probability density function [21][22][23][24][25][26][27][28][29][30][31][32][33]. An improved factored sampling algorithm is also realized to resample and weight particles.…”
Section: A Review Of Most Important Applied Methodsmentioning
confidence: 99%
“…The MIL, WMIL, and significance-MIL algorithms update their parameters with constant learning rate [5]. T17μk1=λμk1+1λμ1,σk1=λ|σknormal1normal2+()normal1λ|σnormal1normal2+λ()normal1λ|μknormal1μnormal1normal2,μk0=λμk0+1λμ0,σk0=λ|σknormal0normal2+()normal1λ|σnormal0normal2+λ()normal1λ|μknormal0μnormal0normal2,where 0 < λ < 1 is the learning rate.…”
Section: Patch Based Mil Algorithmmentioning
confidence: 99%
“…The mean-shift algorithm is a fast and accurate object tracking algorithm. It is a kind of non parametric algorithm, which was originally used in the pattern recognition as an cluster analysis, and is widely used in the field of object tracking [6][7][8][9][10]. Mean-shift algorithm is generally refers to an iterative steps, which calculates the mean shift, moving the point to the next mean shift, then taking this as the new starting point, and continue to move until it meets certain conditions.…”
Section: Tracking Algorithmmentioning
confidence: 99%