A Sparse Probabilistic Learning Algorithm for Real-Time Tracking

  • Authors:
  • Oliver Williams;Andrew Blake;Roberto Cipolla

  • Affiliations:
  • -;-;-

  • Venue:
  • ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper addresses the problem of applying powerful patternrecognition algorithms based on kernels to efficient visualtracking. Recently Avidan [1] has shown that object recognizersusing kernel-SVMs can be elegantly adapted to localization by meansof spatial perturbation of the SVM, using optic flow. WhereasAvidan's SVM applies to each frame of a video independently ofother frames, the benefits of temporal fusion of data are wellknown. This issue is addressed here by using a fully probabilistic'Relevance Vector Machine' (RVM) to generate observations withGaussian distributions that can be fused over time. To improveperformance further, rather than adapting a recognizer, webuild alocalizer directly using the regression form of the RVM. Aclassification SVM is used in tandem, for object verification, andthis provides the capability of automatic initialization andrecovery. The approach is demonstrated in real-time face andvehicle tracking systems. The 'sparsity' of the RVMs means thatonly a fraction of CPU time is required to track at frame rate.Tracker output is demonstrated in a camera management task in whichzoom and pan are controlled inresponse to speaker/vehicle positionand orientation, over an extended period. The advantages oftemporal fusion inthis system are demonstrated.