1996
DOI: 10.1109/map.1996.491294
|View full text |Cite
|
Sign up to set email alerts
|

Estimation and Tracking: Principles, Techniques, and Software [Reviews and Abstracts]

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

3
969
0
14

Year Published

2001
2001
2017
2017

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 555 publications
(986 citation statements)
references
References 0 publications
3
969
0
14
Order By: Relevance
“…Alauddin Al-Omary is with Information Technology, University of Bahrain (UOB), Al-Sukhir, Kingdom of Bahrain (e-mail: aalomary@uob.edu.bh) been extensively studied for several decades [1], [2].…”
Section: Related Workmentioning
confidence: 99%
“…Alauddin Al-Omary is with Information Technology, University of Bahrain (UOB), Al-Sukhir, Kingdom of Bahrain (e-mail: aalomary@uob.edu.bh) been extensively studied for several decades [1], [2].…”
Section: Related Workmentioning
confidence: 99%
“…The dynamics of each tracked object are modeled by means of a linear dynamical system which is tracked using the Kalman filter [15,16]. The state vector x(t) at time t is given as x(t) = (c x (t), c y (t), u x (t), u y (t)) T where c x (t), c y (t) are the horizontal and vertical coordinates of the tracked object's centroid, and u x (t), u y (t) are the corresponding components of the tracked object's speed.…”
Section: Tracking Blob Position and Speedmentioning
confidence: 99%
“…For instance, adaptive vector quantization (Gray, 1984) algorithms may be used if parameter values vary slowly. More sophisticated tracking algorithms (Bar-Shalom and Li, 1993;Blackman, 1986) arc needed to update tracks for parameters that exhibit rapid linear or nonlinear variations. In this section, on-line clustering of Brg and PA parameters is implemented by combining nearest-neighbor matching with linear Kalman filtering.…”
Section: Pattern Clusteringmentioning
confidence: 99%
“…The three basic functions -data association, track maintenance, and filtering and prediction -are now examined. Then, the match can be taken to be a probability, and written: (5) where M is the number of dimensions in the Where space, and x 11 and A 11 are, respectively, the Kalman filtering (Bar-Shalom and Li, 1993;Blackman, 1986) is employed to predict the next position Xiz, and covariance matrix A 11 of each track h. Recall from Section 3 that the usual clustering is bypassed when b corresponds to a PDW that has been assigned a previouslyestablished track through TOA deinterleaving. In this case, b retains its track, and does not perform data association, nor track maintenance.…”
Section: Pattern Clusteringmentioning
confidence: 99%
See 1 more Smart Citation