Particle swarm optimization–Markov Chain Monte Carlo for accurate visual tracking with adaptive template update

Citations

WEB OF SCIENCE

7
Citations

SCOPUS

9

초록

A novel tracking method is proposed, which infers a target state and appearance template simultaneously. With this simultaneous inference, the method accurately estimates the target state and robustly updates the target template. The joint inference is performed by using the proposed particle swarm optimization–Markov chain Monte Carlo (PSO–MCMC) sampling method. PSO–MCMC is a combination of the particle swarm optimization (PSO) and Markov chain Monte Carlo sampling (MCMC), in which the PSO evolutionary algorithm and MCMC aim to find the target state and appearance template, respectively. The PSO can handle multi-modality in the target state and is therefore superior to a standard particle filter. Thus, PSO–MCMC achieves better performance in terms of accuracy when compared to the recently proposed particle MCMC. Experimental results demonstrate that the proposed tracker adaptively updates the target template and outperforms state-of-the-art tracking methods on a benchmark dataset. © 2019 Elsevier B.V.

키워드

Adaptive template update; Markov chain Monte Carlo; Particle swarm optimization; Visual tracking; Markov processes; Monte Carlo methods; Target tracking; Adaptive template; Benchmark datasets; Markov chain monte carlo samplings; Markov Chain Monte-Carlo; Particle filter; Sampling method; State of the art; Visual Tracking; Particle swarm optimization (PSO)
제목
Particle swarm optimization–Markov Chain Monte Carlo for accurate visual tracking with adaptive template update
저자
Kwon, Junseok
DOI
10.1016/j.asoc.2019.04.014
발행일
2020-12
유형
Article
저널명
Applied Soft Computing
권
97