Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2014, Article ID 315908, 12 pages
Research Article

Closed-Loop Estimation for Randomly Sampled Measurements in Target Tracking System

College of Computer and Information Engineering, Beijing Technology and Business University, Beijing 100048, China

Received 24 October 2013; Revised 30 December 2013; Accepted 30 December 2013; Published 26 February 2014

Academic Editor: Hamid Reza Karimi

Copyright © 2014 Jin Xue-bo et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


Many tracking applications need to deal with the randomly sampled measurements, for which the traditional recursive estimation method may fail. Moreover, getting the accurate dynamic model of the target becomes more difficult. Therefore, it is necessary to update the dynamic model with the real-time information of the tracking system. This paper provides a solution for the target tracking system with randomly sampling measurement. Here, the irregular sampling interval is transformed to a time-varying parameter by calculating the matrix exponential, and the dynamic parameter is estimated by the online estimated state with Yule-Walker method, which is called the closed-loop estimation. The convergence condition of the closed-loop estimation is proved. Simulations and experiments show that the closed-loop estimation method can obtain good estimation performance, even with very high irregular rate of sampling interval, and the developed model has a strong advantage for the long trajectory tracking comparing the other models.

1. Introduction

Target tracking is the most important preliminary step for many higher-level analysis applications. Nowadays, some new sensors have been used in the tracking systems, such as the radio frequency identification (RFID) readers. The RFID stores and retrieves data through the electromagnetic transmission to an RF compatible integrated circuit. Once the tag gets close to the readers, the distance between the readers and tags can be got and sent to the data processing center. The measurements of RFID are randomly sampled [1] because of the data-driven measurement mechanisms. Data-driven approach has been used in many applications [2], and the irregular sampling is one of the important issues in this approach.

In general, the video tracking system has to extract the visual information at each frame [3], which costs much computing amount. In [4], the target is tracked by some selected frames to reduce the calculation cost and achieve the real-time tracking, which also results in the randomly sampled tracking problem. If the output measurements are obtained at a set of irregular sampling times, the traditional recursive estimation from to may fail in general [5]. Both the model and the estimation method should be reconsidered.

Reference [6] transformed the randomly sampled measurement tracking to some time-varying parameters and used the current model to describe the processing model [711], which assumes a priori probability density of the acceleration as Rayleigh density. Due to the randomly sampled measurement, this assumption is no longer satisfied.

Except the current model, there were several other models used in the tracking, such as constant-velocity (CV) model, constant acceleration model (CA), and Singer model (zero mean first-order Markov model) [12, 13]. The CV models [1] emphasize that the accelerations are small. In maneuvering target tracking, the inclusion of acceleration in the state vector would degrade tracking performance. The main attractive feature of this model is its simplicity. It is sometimes used in the maneuvering target tracking techniques, such as the so-called noise-level adjustment, when the maneuver is quite small or random. It is also simply referred to as the CA model or more precisely the nearly CA model. The Singer model regards the target acceleration as a first-order semi-Markov process with zero mean, which is in essence a priori model since it does not use online information on the target maneuver. Again because of the irregular sampling time, the priori model does not meet the actual dynamic model of the target.

The approach to update the system model online has attracted great interest of the researchers. For example, the interacting multiple model (IMM) [14, 15] method considers the change of the system dynamics as a Markovian parameter, whose transition probability is set based on the online estimation and then fusions several models for the tracking, while IMM suffers heavy computational burden on condition that the maneuvering target has complex motion. Moreover, the complex movement can also lead to frequent switch between different models, which can cause the tracking performance to decline. Another model [16, 17] estimated the state of a power system, where the bus voltages are transformed to a system parameter. But the works of this closed-loop estimation have not yet been involved in the randomly sampled tracking system.

This paper will develop a joint state-and-parameter estimation method for the target tracking system with randomly sampled measurements, where the estimation problem is reformulated as two loosely coupled linear subproblems. This paper is organized as follows. Section 2 derives the system dynamic model under the random sampling time and gives the estimation method based on Kalman filter. The convergence of the algorithm is proved in Section 3. The simulations and experiments are provided in Section 4. Finally, some concluding remarks are given in Section 5.

2. System Model and Closed-Loop Estimation Method

We begin with the continuous dynamic model of the moving target. Let ,, and be the target location, velocity, and acceleration along a generic direction, and the state is expressed as . Assume the nonzero mean acceleration satisfies , where is the mean of acceleration in the interval and is a zero mean first-order stationary Markov process with variance . We have ; is maneuver frequency and is zero mean processing white noise with variance . The parameter is the reciprocal of the maneuver time constant and thus depends on how long the maneuver lasts. For example, for an aircraft for a lazy turn and for an evasive maneuver. The parameter is the “instantaneous variance” of the acceleration.

Then, we can obtain the acceleration satisfying and the following state-space representation of the continuous time model can be obtained: where and is process noise with the covariance matrix given by . Assume the measurement data is obtained at the sampling time and the measurement equation is as follows: where is measurement matrix and is measurement noise with the known variance ; that is, .

2.1. Model Discretization

We can get the following by the differential equation (1):

We can see that for any known integration interval [], can be gotten at any time if the initial state , the parameters, , , , and in [] are known.

Consider the time interval from to and assume we can have

Set ; we have the system matrix as , and the noise with the covariance .

Because the process matrix in (2) is not a full-rank matrix, we cannot calculate the matrix exponential by the Lagrange-Hermite interpolation. Here, we use Laplace transform and have

The matrix exponential can be gotten by the inverse Laplace transform as and by the similar approach, we can get the system parameter and the variance of as with the parameters described as

Then, we get the discrete state-space model of the tracking system as where is the state of the system to be estimated and whose initial mean and covariance are known as and , and are white noise with zero mean and independent of the initial state , is the measurement vector, is measurement matrices, and is measurement noise with known variance . Until now, the irregular sampling is turned to the varying-parameter system. We can see the same sampling interval is just a particular case of the random sampling problem. Therefore, the model of the randomly sampling tracking is a general one.

2.2. System Parameters Estimation

Here, we assume the maneuver frequency and the variance of the acceleration are not constant but variable and expressed as and . From the processing model of (12), we have the discrete time equation of the acceleration as where and is a zero mean white noise sequence with the variance is the maneuver frequency at the sampling time . is the mean of one interval, so we have . Set ; then we can obtain

Consider the estimation of acceleration is a random process; we have where is the number of data. For a first-order stationary Markov process (15), we have the statistics relation between the autocorrelation functions , with the parameters and by the Yule-Walker method [18]

Next, we can get and by , and then get the system parameters , , and in process function (12).

2.3. Algorithm Summary

Now we summarize the closed-loop estimation algorithm for the randomly sampled measurements as follows.

   Initialization . Consider

  Recursion(a)System update: set and the system parameter as and the variance of the as with parameters described as (b)State prediction: consider (c)State update: consider (d)Parameter adaptation: the mean of the acceleration

When , the maneuver frequency is set to and the covariance of the noise is gotten by the following:

When , the parameter is updated by the following

The irregular sampling time , and the interval reflect in the time-varying parameters of the system, so we can conclude that the Kalman filter shown in (23)–(33) based on system (12) with system parameters (19)–(22) can obtain the same estimation performance as regular sampling Kalman filter.

3. Proof of the Convergence

Based on the closed-loop estimation algorithm (18)–(33), we can see that the parameter used to estimate state is an estimated one and similarly the estimated states to calculate parameters and have estimation errors too. Therefore, it is important to guarantee the convergence of the estimation of the states and parameters.

From (27), (29), and (33), we know if the estimation increased suddenly, will increase greatly because the mean changes less than , and becomes large too. Then, a very large positive will be obtained, and will also contain a large number of elements (here, we call it a big matrix). From the Riccati equation of Kalman filter we find that will be a big matrix if is a big one, and will increase greatly. As a result, the estimation state will be a big matrix too. This trend results in positive feedback loops, which means will become larger and larger, and finally, divergence. We give the following theorem to guarantee the algorithm convergence.

Theorem 1. The estimation is bounded if the variance of the target acceleration has an upper bound; that is, there is a positive satisfying .

Proof. We firstly consider maneuvering frequency . From (19), (21), and (22), we know if and , the target has the constant acceleration maneuvering, and the system model is the constant acceleration model with the parameter as follows
If and , we can get the system parameter matrix such as and . Therefore, we can see that and are the monotonic matrix with finite value elements.
Then, we consider the solution of Riccati equation (34) on the condition that the system parameter matrix has errors, such as and , where and are the actual system parameters and and are the errors of the system parameter. Unlike the research about the uncertainty system, here we do not know the actual system matrices and , but we can know the upper bound of the system parameters and , when , such as
The perturbed discrete algebraic Riccati equation is as follows:
We know that (37) is equal to
Then, for any vector , we have where is the maximum eigenvalue. By the relation of vector eigenvalue , where , we have
That is,
We have
Then, by (41) and (42), we have
Next, by the relation of Hermite matrix and its eigenvalue, we have
Then, we have
Assume that and set
We have the following solution of (45):
Therefore, we can conclude that the maximum eigenvalue of estimation covariance has the upper bound shown as (47) if .
If one step predictive covariance is bounded, that is, , then we know must be bounded by (47) with the fact that . And based on (25), we know must be a bounded matrix and must be bounded too.

4. Simulations and Experiments

4.1. The Estimation by Different Extraction Rate and Irregular Rate

The method here is applied to a two-dimensional planar video tracking. Here, as a tracking problem, we just use the simple background and one target. The video gotten by the Image Capture Test Bed is shown in Figure 1.

Figure 1: The video with simple background and one target.

We control the car maneuvering on the test bed and catch the images of target movement by a stationary camera. For every image of the video, the target is extracted based on the color and then we get the measurement data of maneuvering target on the Image Capture Test Bed like Figure 2.

Figure 2: The measurement of maneuvering target got from the video.

We know that the camera catches the image under the same interval, and that will produce large amounts of image data. If we can use some of images in the video for tracking, the image storage and computation cost will greatly reduce. But “using some of images” means that the measurements no longer have the same sampling interval. Here, define the Extraction Rate as to describe the image compression rate. And define the Irregular Rate to measure the sampling interval as

The state for the target in the 2D space is . The initial state estimate and covariance are assumed to be and .

We extract 243 images from a video with 491 images where EXrate = 49.49% and IRrate = 0.1043 and by the algorithm developed with the initial parameters , , , , , we get the estimation of trajectory with estimation covariance 10.0881 along the horizontal axis and 8.1660 along the vertical axis, shown in Figure 3. The estimation trajectories of horizontal and longitudinal axis is shown in Figure 4 and the estimation error are shown in Figure 5.

Figure 3: The real trajectory and the estimation trajectory.
Figure 4: The estimations of horizontal and longitudinal axis.
Figure 5: The location estimation errors.

To illustrate how the irregular rate affects estimation performance, the algorithm is used to estimate the target trajectory under different Irregular Rate (shown in Table 1) with the same Extraction Rate, . The RMSE position is defined as , where and are the root-mean square errors (RMSE) of position for horizontal and longitudinal axis, respectively. The relation between and is shown in Figure 6. We can see that the Irregular Rate affects the estimation performance very little. The Irregular Rate changes 21 times almost from 0.0088 in Case 1 to 0.1928 in Case 10, but is about 14 for all . We can conclude that does not affect the tracking performance, when with the same .

Table 1: The different irregular rate for 10 cases.
Figure 6: The relation between and .
4.2. The Performance with Different Models

Next, we compare the model developed here with other dynamics model, such as CV model [12], CA model [12], Singer model [13], current model [8], and IMM [14]. We set the process noise covariance as for the CV and CA model and and for Singer model. Because the current model is very sensitive to the priori parameters, we give several system parameters such as , (current model I), , (current model II), and , (current model III). After 100 Monte Carlo simulation runs, are calculated. For different trajectory with different and , the estimation results are shown in Figures 7(a)7(f), where in order to show clearly, we use the black “O” to describe the actual trajectory at the sampling time in Figures 7(e) and 7(f).

Figure 7: The tracking results for videos.

Table 2 and Figure 8 show under the different and . We can see that the model here can get the better estimation performance than CV, CA, Singer model, current model, and IMM for almost all and . We also note that the current model needs the right parameter, or else the performance will become worse.

Table 2: The estimation covariance and irregular rate in Figure 7.
Figure 8: under different and .

We note that in Figure 7(f), the tracking error of the developed model is larger than current models II, III, and IMM, even CA. We find that there is a big estimation error at 5th second. The reason is that there are not enough data gotten to update the parameter at . Therefore, the estimation error is bigger. But we also note that the estimation error declined quickly, so the developed model has a strong advantage for the long trajectory tracking comparing the other models.

Another fact we also noticed is that though almost does not affect the tracking performance, it is obvious that low can decline the tracking performance. This is because the lower means less measured data gotten and less useful information that can be provided; therefore, the estimate is more inaccurate.

As to the sampling interval , the lower means larger . If the sampling interval is large enough to break Shannon Sampling Theorem, the estimation performance will decline.

4.3. The Estimation of Video Target

At last, we use the developed method to track a target in real scene. In order to decrease the calculation cost, we select some frames from the video according to the characteristics of the movement. That is, if we find that the target is stationary or moves slowly, then we discard these frames. We use a threshold to test whether a target makes a big maneuver or not. Obviously, a large threshold can make the calculation cost lower, but lower will make the performance decrease too.

So the threshold should be carefully selected to balance the calculation cost and performance. Here, we select 95 frames from 245 frames; and are 38.77% and 0.1367, respectively. Figure 9 gives the tracking results of number 1, 27, 40, 65, 74, 97, 128, 129, 158, 181, 189, and 226 frames in the video. The estimation of target is marked by “black” dot. The estimation covariance of as 1.034 mm is obtained (the tracking area is 300 * 300 mm2).

Figure 9: The tracking results in number 1, 27, 40, 65, 74, 97, 128, 129, 158, 181, 189, and 226 frames.

5. Conclusions

The main contribution of this paper is to model the real-time system dynamics at the random sampling points. By calculating the matrix exponential with inverse Laplace transform, the irregular sampling interval is transformed to time-varying parameters matrix of the system. Based on the statistics relation between the autocorrelation function and the covariance of Markov random processing, the system model with online parameter is developed. The proof and the experimental results show that the developed method can get good tracking performance.

As an example, the developed method is used for the video tracking problem. According to the motion characteristics of the target, some frames are selected for the tracking purpose. The tracking results show that good tracking performance is obtained by a smaller amount of calculation.


The authors declare that they have no financial or personal relationships with other people or organizations that can inappropriately influence their work and there is no professional or other personal interest of any nature in any product, service, and/or company that could be construed as influencing the position presented in this paper.

Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.


This work is partially supported by NSFC under Grant nos. 61273002 and 60971119 and the Importation and Development of High-Caliber Talents Project of Beijing Municipal Institutions no. CIT&TCD201304025.


  1. S. Srinivasan and H. Ranganathan, “RFID sensor network-based automation system for monitoring and tracking of sandalwood trees,” International Journal of Computational Science and Engineering, vol. 8, no. 2, pp. 154–161, 2013. View at Google Scholar
  2. S. Yin, S. X. Ding, A. H. A. Sari, and H. Hao, “Data-driven monitoring for stochastic systems and its application on batch process,” International Journal of Systems Science, vol. 44, no. 7, pp. 1366–1376, 2013. View at Publisher · View at Google Scholar · View at MathSciNet
  3. F. Dornaika and F. Chakik, “Efficient object detection and tracking in video sequences,” Journal of the Optical Society of America A, vol. 29, no. 6, pp. 928–935, 2012. View at Google Scholar
  4. J. Xue-Bo, D. Jing-Jing, and B. Jia, “Fast tracking for video target tracking,” Applied Mechanics and Materials, vol. 303-306, pp. 2245–2248, 2013. View at Google Scholar
  5. H. Zhang, M. V. Basin, and M. Skliar, “Itô-Volterra optimal state estimation with continuous, multirate, randomly sampled, and delayed measurements,” Institute of Electrical and Electronics Engineers, vol. 52, no. 3, pp. 401–416, 2007. View at Publisher · View at Google Scholar · View at MathSciNet
  6. J. Xue-Bo, D. Jing-Jing, and B. Jia, “Target tracking of a linear time invariant system under irregular sampling,” International Journal of Advanced Robotic Systems, vol. 9, no. 11, pp. 1–12, 2012. View at Google Scholar
  7. S. Vasuhi, V. Vaidehi, and T. Rincy, “IMM estimator for maneuvering target tracking with Improved current statistical model,” in Proceedings of the International Conference on Recent Trends in Information Technology (ICRTIT '11), pp. 286–290, June 2011. View at Publisher · View at Google Scholar · View at Scopus
  8. W.-S. Liu, Y.-A. Li, and L. Cui, “Adaptive strong tracking algorithm for maneuvering targets based on current statistical model,” Systems Engineering and Electronics, vol. 33, no. 9, pp. 1937–1940, 2011. View at Publisher · View at Google Scholar · View at Scopus
  9. W. Wang and H.-L. Hou, “An improved current statistical model for maneuvering target tracking,” in Proceedings of the4th IEEE Conference on Industrial Electronics and Applications (ICIEA '09), pp. 4017–4020, May 2009. View at Publisher · View at Google Scholar · View at Scopus
  10. H. Li and C. Li, “Missile-borne radar data filtering algorithm based on the “current” statistical model,” Advanced Materials Research, vol. 433-440, pp. 6965–6973, 2012. View at Publisher · View at Google Scholar · View at Scopus
  11. Y.-L. Liu and X.-H. Gu, “Current statistical model tracking algorithm based on improved auxiliary particle filter,” Systems Engineering and Electronics, vol. 32, no. 6, pp. 1206–1209, 2010. View at Publisher · View at Google Scholar · View at Scopus
  12. X. R. Li and V. P. Jilkov, “Survey of maneuvering target tracking. Part I: dynamic models,” IEEE Transactions on Aerospace and Electronic Systems, vol. 39, no. 4, pp. 1333–1364, 2003. View at Publisher · View at Google Scholar · View at Scopus
  13. X. Chen, Y. Pang, Y. Li, and D. Li, “AUV sensor fault diagnosis based on STF-Singer model,” Chinese Journal of Scientific Instrument, vol. 31, no. 7, pp. 1502–1508, 2010. View at Google Scholar · View at Scopus
  14. T.-J. Ho, “A switched IMM-extended Viterbi estimator-based algorithm for maneuvering target tracking,” Automatica, vol. 47, no. 1, pp. 92–98, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  15. R. W. Osborne and W. D. Blair, “Update to the hybrid conditional averaging performance prediction of the IMM algorithm,” IEEE Transactions on Aerospace and Electronic Systems, vol. 47, no. 4, pp. 2967–2974, 2011. View at Publisher · View at Google Scholar · View at Scopus
  16. X. Bian, X. R. Li, H. Chen, D. Gan, and J. Qiu, “Joint estimation of state and parameter with synchrophasors-Part I: state tracking,” IEEE Transactions on Power Systems, vol. 26, no. 3, pp. 1196–1208, 2011. View at Publisher · View at Google Scholar · View at Scopus
  17. X. Bian, X. R. Li, H. Chen, D. Gan, and J. Qiu, “Joint estimation of state and parameter with synchrophasors-Part II: parameter tracking,” IEEE Transactions on Power Systems, vol. 26, no. 3, pp. 1209–1220, 2011. View at Publisher · View at Google Scholar · View at Scopus
  18. E. Wensink and W. J. Dijkhof, “On finite sample statistics for Yule-Walker estimates,” Institute of Electrical and Electronics Engineers, vol. 49, no. 2, pp. 509–516, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet