[Proceedings] ICASSP-92: 1992 IEEE International Conference on Acoustics, Speech, and Signal Processing 1992
DOI: 10.1109/icassp.1992.226023
|View full text |Cite
|
Sign up to set email alerts
|

Data association and tracking using hidden Markov models and dynamic programming

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

1998
1998
2021
2021

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 13 publications
(5 citation statements)
references
References 0 publications
0
5
0
Order By: Relevance
“…Hidden Markov model (HMM) filters [30], [35], [36], [39] are an application of such approximate grid-based methods in a fixed-interval smoothing context and have been used extensively in speech processing. In HMM-based tracking, a common approach is to use the Viterbi algorithm [18] to calculate the maximum a posteriori estimate of the path through the trellis, that is, the sequence of discrete states that maximizes the probability of the state sequence given the data.…”
Section: B Approximate Grid-based Methodsmentioning
confidence: 99%
“…Hidden Markov model (HMM) filters [30], [35], [36], [39] are an application of such approximate grid-based methods in a fixed-interval smoothing context and have been used extensively in speech processing. In HMM-based tracking, a common approach is to use the Viterbi algorithm [18] to calculate the maximum a posteriori estimate of the path through the trellis, that is, the sequence of discrete states that maximizes the probability of the state sequence given the data.…”
Section: B Approximate Grid-based Methodsmentioning
confidence: 99%
“…This is particularly problematic in the case of small process noise where all particles would collapse to a single point within a few iterations. Some methods to solve this issue can be named as resample-move algorithm [150] and regularization algorithm [151]. 3.…”
Section: Resamplingmentioning
confidence: 99%
“…For the expanded state-space model (20) and (21), the EKF can be applied straightforwardly. Unlike the recursive EKF, the iterative EFIR filter [24] utilizes measurements z n available on an interval of N past neighboring points from m = n − N + 1 to n. The EFIR filtering algorithm listed in Table I has the following specifics.…”
Section: Extended Ufir Filteringmentioning
confidence: 99%
“…The unscented Kalman filter (UKF) [19] demonstrates better performance when the state-space models is highly nonlinear. The hidden Markov model (HMM) filters [20] have appeared to be more useful for tracking [21]. A sequential Monte Carlo (SMC) method also known as a particle filter (PF) [22] was developed to estimate Bayesian models associated with Markov chains in discrete-time domain be especially useful for robot self-localization [23].…”
Section: Introductionmentioning
confidence: 99%