Efficient learning of linear predictors using dimensionality reduction

  • Authors:
  • Stefan Holzer;Slobodan Ilic;David Joseph Tan;Nassir Navab

  • Affiliations:
  • Department of Computer Science, Technische Universität München (TUM), Garching, Germany;Department of Computer Science, Technische Universität München (TUM), Garching, Germany;Department of Computer Science, Technische Universität München (TUM), Garching, Germany;Department of Computer Science, Technische Universität München (TUM), Garching, Germany

  • Venue:
  • ACCV'12 Proceedings of the 11th Asian conference on Computer Vision - Volume Part III
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Using Linear Predictors for template tracking enables fast and reliable real-time processing. However, not being able to learn new templates online limits their use in applications where the scene is not known a priori and multiple templates have to be added online, such as SLAM or SfM. This especially holds for applications running on low-end hardware such as mobile devices. Previous approaches either had to learn Linear Predictors offline [1], or start with a small template and iteratively grow it over time [2]. We propose a fast and simple learning procedure which reduces the necessary training time by up to two orders of magnitude while also slightly improving the tracking robustness with respect to large motions and image noise. This is illustrated in an exhaustive evaluation where we compare our approach with state-of-the-art approaches. Additionally, we show the learning and tracking in mobile phone applications which demonstrates the efficiency of the proposed approach.