image processing and computer vision
algorithm analysis and problem complexity
Full recordShow full item record
AbstractRobust visual tracking requires constant update of the target appearance model, but without losing track of previous appearance information. One of the difficulties with the online learning approach to this problem has been a lack of flexibility in the modelling of the inevitable variations in target and scene appearance over time. The traditional online learning approach to the problem treats each example equally, which leads to previous appearances being forgotten too quickly and a lack of emphasis on the most current observations. Through analysis of the visual tracking problem, we develop instead a novel weighted form of online risk which allows more subtlety in its representation. However, the traditional online learning framework does not accommodate this weighted form. We thus also propose a principled approach to weighted online learning using weighted reservoir sampling and provide a weighted regret bound as a theoretical guarantee of performance. The proposed novel online learning framework can handle examples with different importance weights for binary, multiclass, and even structured output labels in both linear and non-linear kernels. Applying the method to tracking results in an algorithm which is both efficient and accurate even in the presence of severe appearance changes. Experimental results show that the proposed tracker outperforms the current state-of-the-art.
Rui Yao, Qinfeng Shi, Chunhua Shen, Yanning Zhang and Anton van den Hengel
Proceedings of the 12th European Conference on Computer Vision, held in Florence, Italy, 7-13 October, 2012 / A. Fitzgibbon, S. Lazebnik, P. Perona, Y. Sato and C. Schmid (eds.): pp.158-172