1998
DOI: 10.1002/0471224197
|View full text |Cite
|
Sign up to set email alerts
|

Tracking and Kalman Filtering Made Easy

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
213
0
6

Year Published

2005
2005
2016
2016

Publication Types

Select...
4
4
2

Relationship

0
10

Authors

Journals

citations
Cited by 318 publications
(221 citation statements)
references
References 37 publications
2
213
0
6
Order By: Relevance
“…The key property of the EKF is that it is applied to neural network training, it leads to faster convergence property than the gradient-based algorithm.The EKF algorithm provides first-order approximations to optimal nonlinear estimation through the linearization of the nonlinear system. However, these approximations can include large errors in the true posterior mean and covariance of the transformed (Gaussian ) random svariable, which may lead to suboptimal performance and sometimes divergence of the filter [12].…”
Section: Kalman Filter Techniquementioning
confidence: 99%
“…The key property of the EKF is that it is applied to neural network training, it leads to faster convergence property than the gradient-based algorithm.The EKF algorithm provides first-order approximations to optimal nonlinear estimation through the linearization of the nonlinear system. However, these approximations can include large errors in the true posterior mean and covariance of the transformed (Gaussian ) random svariable, which may lead to suboptimal performance and sometimes divergence of the filter [12].…”
Section: Kalman Filter Techniquementioning
confidence: 99%
“…In some cases, the algorithms to track mouse positions assume a constant speed movement model. This assumption is reasonable since that sample period is very small compared with the movement speeds, Brookner (1998), i.e., the sample period adopted was 20ms and the voluntary movement estimated occurs in a bandwidth lower than 2Hz (75% of the power spectral density, Raya et al (2011)). …”
Section: Adaptive Filtersmentioning
confidence: 99%
“…First, we build a background model to segment foreground objects. Then, the PTMS algorithm is used to achieve two goals, namely 1) predicting the position of the detected vehicles, by means of a KF [24] and 2) performing a time-consistent analysis (grouping) of the detected blobs, possibly merging and splitting detected blobs due to partial or complete occlusions. This process permits the identification of blobs composed of multiple vehicles that should not be used as input to the trajectory clustering algorithm, because the position estimation may be unreliable.…”
Section: Object Tracking With the Predictive Trajectory Merge-anmentioning
confidence: 99%