Adaptive Aggregation of Arbitrary Online Trackers with a Regret Bound

Heon Song, Daiki Suehiro, Seiichi Uchida; Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision (WACV), 2020, pp. 681-689

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.

Related Material


[pdf]
[bibtex]
@InProceedings{Song_2020_WACV,
author = {Song, Heon and Suehiro, Daiki and Uchida, Seiichi},
title = {Adaptive Aggregation of Arbitrary Online Trackers with a Regret Bound},
booktitle = {Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision (WACV)},
month = {March},
year = {2020}
}