Efficient dynamic programming in presence of nuisance parameters

The dynamic programming approach for maximum a posteriori (MAP) estimation of Markov sequences is frequently proposed for problems in control theory, communications, and signal processing. It is usually assumed that the observation sequence is a perfectly known function of the Markov sequence of interest, except for some additive noise with known statistics. However, often the observation is not only a function of the Markov sequence but also of a vector of unknown nuisance parameters. It is shown how the dynamic programming methodology can be extended to estimate both the nuisance parameters and the Markov sequence, using a combined maximum-likelihood and MAP framework. The technique is efficient relative to other possible solutions. The problem of detecting and tracking moving targets observed by imaging sensors is used to demonstrate the efficiency of the procedure.<
>