Support Tucker Machines

Abstract

In this paper we address the two-class classification problem within the tensor-based framework, by formulating the Support Tucker Machines (STuMs). More precisely, in the proposed STuMs the weights parameters are regarded to be a tensor, calculated according to the Tucker tensor decomposition as the multiplication of a core tensor with a set of matrices, one along each mode. We further extend the proposed STuMs to the Σ/Σ <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">w</sub> STuMs, in order to fully exploit the information offered by the total or the within-class covariance matrix and whiten the data, thus providing in-variance to affine transformations in the feature space. We formulate the two above mentioned problems in such a way that they can be solved in an iterative manner, where at each iteration the parameters corresponding to the projections along a single tensor mode are estimated by solving a typical Support Vector Machine-type problem. The superiority of the proposed methods in terms of classification accuracy is illustrated on the problems of gait and action recognition.

Cite

Text

Kotsia and Patras. "Support Tucker Machines." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2011. doi:10.1109/CVPR.2011.5995663

Markdown

[Kotsia and Patras. "Support Tucker Machines." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2011.](https://mlanthology.org/cvpr/2011/kotsia2011cvpr-support/) doi:10.1109/CVPR.2011.5995663

BibTeX

@inproceedings{kotsia2011cvpr-support,
  title     = {{Support Tucker Machines}},
  author    = {Kotsia, Irene and Patras, Ioannis},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {2011},
  pages     = {633-640},
  doi       = {10.1109/CVPR.2011.5995663},
  url       = {https://mlanthology.org/cvpr/2011/kotsia2011cvpr-support/}
}