Compressive tracking combined with sample weights and adaptive learning factor. (18th December 2017)

• Record Type: Journal Article
• Authors: Jin, Yong; Li, Hong‐ying; Zhang, Dan‐dan; Wu, Jing; Li, Maozhen
• Other Names: Barbosa Jorge G. guestEditor.; Jeannot Emmanuel guestEditor.; Li Maozhen guestEditor.
• Is Part Of: Concurrency and computation. Volume 30:Number 23(2018)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2017-12-18
• Subjects: adaptive -- Bhattacharyya coefficient -- compressive tracking -- learning factor -- robustness -- sample weights; Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.4398
• Languages: English
• ISSNs: 1532-0626

Abstract

Summary: The compressive tracking algorithm introduces a compressive sensing theory into the target tracking field and produces good real‐time performance. However, the original compressive tracking algorithm ignores the fact that individual samples make different contributions to the target and that the learning factor is an empirical value that remains constant when the template is updated. Therefore, adverse factors (such as noise) and errors can infiltrate into the parametric model during the updating of the model when the object is obscured or receives interference from external factors, which will lead to tracking drift. In view of these problems, the weights of samples are given according to the distance between the sample and the target when training the Naive Bayesian classifier; hence, the stability of the tracking is improved. While the introduction of the Bhattacharyya coefficient is utilized to adjust the learning factor, this can help parameters to self‐adapt effectively. Experimental results show that the improved tracking algorithm has a better adaption to the target appearance variations, illumination changes, occlusion, and so on, and has better robustness than the original algorithm.