Adaptive Aggregation of Arbitrary Online Trackers with a Regret Bound
Abstract
We propose an online visual-object tracking method that is robust even in an adversarial environment, where various disturbances may occur on the target appearance, etc. The proposed method is based on a delayed-Hedge algorithm for aggregating multiple arbitrary online trackers with adaptive weights. The robustness in the tracking performance is guaranteed theoretically in term of "regret" by the property of the delayed-Hedge algorithm. Roughly speaking, the proposed method can achieve a similar tracking performance as the best one among all the trackers to be aggregated in an adversarial environment. The experimental study on various tracking tasks shows that the proposed method could achieve state-of-the-art performance by aggregating various online trackers.
Cite
Text
Song et al. "Adaptive Aggregation of Arbitrary Online Trackers with a Regret Bound." Winter Conference on Applications of Computer Vision, 2020.Markdown
[Song et al. "Adaptive Aggregation of Arbitrary Online Trackers with a Regret Bound." Winter Conference on Applications of Computer Vision, 2020.](https://mlanthology.org/wacv/2020/song2020wacv-adaptive/)BibTeX
@inproceedings{song2020wacv-adaptive,
title = {{Adaptive Aggregation of Arbitrary Online Trackers with a Regret Bound}},
author = {Song, Heon and Suehiro, Daiki and Uchida, Seiichi},
booktitle = {Winter Conference on Applications of Computer Vision},
year = {2020},
url = {https://mlanthology.org/wacv/2020/song2020wacv-adaptive/}
}