A New Approach to Enhanced Swarm Intelligence Applied to Video Target Tracking

被引:7
作者
de Castro, Edwards Cerqueira [1 ]
Salles, Evandro Ottoni Teatini [1 ]
Ciarelli, Patrick Marques [1 ]
机构
[1] Univ Fed Espirito Santo, Programa Posgrad Engn Eletr, Ctr Tecnol, BR-29075910 Vitoria, ES, Brazil
关键词
swarm intelligence; meta-heuristic; dynamic optimization problems; video target tracking; time series forecasts; OBJECT TRACKING; VISUAL TRACKING; ALGORITHM; STATE;
D O I
10.3390/s21051903
中图分类号
O65 [分析化学];
学科分类号
070302 ; 081704 ;
摘要
This work proposes a new approach to improve swarm intelligence algorithms for dynamic optimization problems by promoting a balance between the transfer of knowledge and the diversity of particles. The proposed method was designed to be applied to the problem of video tracking targets in environments with almost constant lighting. This approach also delimits the solution space for a more efficient search. A robust version to outliers of the double exponential smoothing (DES) model is used to predict the target position in the frame delimiting the solution space in a more promising region for target tracking. To assess the quality of the proposed approach, an appropriate tracker for a discrete solution space was implemented using the meta-heuristic Shuffled Frog Leaping Algorithm (SFLA) adapted to dynamic optimization problems, named the Dynamic Shuffled Frog Leaping Algorithm (DSFLA). The DSFLA was compared with other classic and current trackers whose algorithms are based on swarm intelligence. The trackers were compared in terms of the average processing time per frame and the area under curve of the success rate per Pascal metric. For the experiment, we used a random sample of videos obtained from the public Hanyang visual tracker benchmark. The experimental results suggest that the DSFLA has an efficient processing time and higher quality of tracking compared with the other competing trackers analyzed in this work. The success rate of the DSFLA tracker is about 7.2 to 76.6% higher on average when comparing the success rate of its competitors. The average processing time per frame is about at least 10% faster than competing trackers, except one that was about 26% faster than the DSFLA tracker. The results also show that the predictions of the robust DES model are quite accurate.
引用
收藏
页码:1 / 21
页数:21
相关论文
共 47 条
[1]  
[Anonymous], 2005, P IEEE INT WORKSH PE
[2]   A tutorial on particle filters for online nonlinear/non-Gaussian Bayesian tracking [J].
Arulampalam, MS ;
Maskell, S ;
Gordon, N ;
Clapp, T .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2002, 50 (02) :174-188
[3]   A novel real time video tracking framework using adaptive discrete swarm optimization [J].
Bae, Changseok ;
Kang, Kyuchang ;
Liu, Guang ;
Chung, Yuk Ying .
EXPERT SYSTEMS WITH APPLICATIONS, 2016, 64 :385-399
[4]  
BROWN RG, 1961, OPER RES, V9, P672
[5]   Kernel-based object tracking [J].
Comaniciu, D ;
Ramesh, V ;
Meer, P .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2003, 25 (05) :564-577
[6]   Histograms of oriented gradients for human detection [J].
Dalal, N ;
Triggs, B .
2005 IEEE COMPUTER SOCIETY CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, VOL 1, PROCEEDINGS, 2005, :886-893
[7]   A PSO-Lyapunov Hybrid Stable Adaptive Fuzzy Tracking Control Approach for Vision-Based Robot Navigation [J].
Das Sharma, Kaushik ;
Chatterjee, Amitava ;
Rakshit, Anjan .
IEEE TRANSACTIONS ON INSTRUMENTATION AND MEASUREMENT, 2012, 61 (07) :1908-1914
[8]   Ant colony optimization -: Artificial ants as a computational intelligence technique [J].
Dorigo, Marco ;
Birattari, Mauro ;
Stuetzle, Thomas .
IEEE COMPUTATIONAL INTELLIGENCE MAGAZINE, 2006, 1 (04) :28-39
[9]   Shuffled frog-leaping algorithm: a memetic meta-heuristic for discrete optimization [J].
Eusuff, M ;
Lansey, K ;
Pasha, F .
ENGINEERING OPTIMIZATION, 2006, 38 (02) :129-154
[10]   The Pascal Visual Object Classes (VOC) Challenge [J].
Everingham, Mark ;
Van Gool, Luc ;
Williams, Christopher K. I. ;
Winn, John ;
Zisserman, Andrew .
INTERNATIONAL JOURNAL OF COMPUTER VISION, 2010, 88 (02) :303-338