Higher rank Support Tensor Machines for visual recognition

  • Authors:
  • Irene Kotsia;Weiwei Guo;Ioannis Patras

  • Affiliations:
  • School of Electronic Engineering and Computer Science, Queen Mary, University of London, United Kingdom;College of Electronic Science and Engineering, National University of Defense Technology, Changsha;School of Electronic Engineering and Computer Science, Queen Mary, University of London, United Kingdom

  • Venue:
  • Pattern Recognition
  • Year:
  • 2012

Quantified Score

Hi-index 0.01

Visualization

Abstract

This work addresses the two class classification problem within the tensor-based large margin classification paradigm. To this end, we formulate the higher rank Support Tensor Machines (STMs), in which the parameters defining the separating hyperplane form a tensor (tensorplane) that is constrained to be the sum of rank one tensors. Subsequently, we propose two extensions in which the separating tensorplanes take into consideration the spread of the training data along the different tensor modes. More specifically, we first propose the higher rank @S/@S"w STMs that use the total or the within-class covariance matrix in order to whiten the data and thus provide invariance to affine transformations. Second, we propose the higher rank Relative Margin Support Tensor Machines (RMSTMs) that bound from above the distance of the data samples from the separating tensorplane while maximizing the margin from it. The corresponding optimization problem is solved in an iterative manner utilizing the CANDECOMP/PARAFAC (CP) decomposition, where at each iteration the parameters corresponding to the projections along a single tensor mode are estimated by solving a typical Support Vector Machine (SVM)-type optimization problem. The efficiency of the proposed method is illustrated on the problems of gait and action recognition where we report results that improve, in some cases considerably, the state of the art.