## Abstract

Particle filter is a powerful tool for state tracking using non-linear observations. We present a multiscale based method that accelerates the tracking computation by particle filters. Unlike the conventional way, which calculates weights over all particles in each cycle of the algorithm, we sample a small subset from the source particles using matrix decomposition methods. Then, we apply a function extension algorithm that uses a particle subset to recover the density function for all the rest of the particles not included in the chosen subset. The computational effort is substantial especially when multiple objects are tracked concurrently. The proposed algorithm significantly reduces the computational load. By using the Fast Gaussian Transform, the complexity of the particle selection step is reduced to a linear time in n and k, where n is the number of particles and k is the number of particles in the selected subset. We demonstrate our method on both simulated and on real data such as object tracking in video sequences.

Original language | English |
---|---|

Article number | 7010941 |

Pages (from-to) | 1396-1407 |

Number of pages | 12 |

Journal | IEEE Transactions on Pattern Analysis and Machine Intelligence |

Volume | 37 |

Issue number | 7 |

DOIs | |

State | Published - 1 Jul 2015 |

## Keywords

- Particle filter
- fast multipole method
- multiscale methods
- nonlinear tracking