Multi-Target Tracking by Rank-1 Tensor Approximation

Abstract

In this paper we formulate multi-target tracking (MTT) as a rank-1 tensor approximation problem and propose an 1 norm tensor power iteration solution. In particular, a high order tensor is constructed based on trajectories in the time window, with each tensor element as the affinity of the corresponding trajectory candidate. The local assignment variables are the 1 normalized vectors, which are used to approximate the rank-1 tensor. Our approach provides a flexible and effective formulation where both pairwise and high-order association energies can be used expediently. We also show the close relation between our formulation and the multi-dimensional assignment (MDA) model. To solve the optimization in the rank-1 tensor approximation, we propose an algorithm that iteratively powers the intermediate solution followed by an 1 normalization. Aside from effectively capturing high-order motion information, the proposed solver runs efficiently with proved convergence. The experimental validations are conducted on two challenging datasets and our method demonstrates promising performances on both.

Cite

Text

Shi et al. "Multi-Target Tracking by Rank-1 Tensor Approximation." Conference on Computer Vision and Pattern Recognition, 2013. doi:10.1109/CVPR.2013.309

Markdown

[Shi et al. "Multi-Target Tracking by Rank-1 Tensor Approximation." Conference on Computer Vision and Pattern Recognition, 2013.](https://mlanthology.org/cvpr/2013/shi2013cvpr-multitarget/) doi:10.1109/CVPR.2013.309

BibTeX

@inproceedings{shi2013cvpr-multitarget,
  title     = {{Multi-Target Tracking by Rank-1 Tensor Approximation}},
  author    = {Shi, Xinchu and Ling, Haibin and Xing, Junling and Hu, Weiming},
  booktitle = {Conference on Computer Vision and Pattern Recognition},
  year      = {2013},
  doi       = {10.1109/CVPR.2013.309},
  url       = {https://mlanthology.org/cvpr/2013/shi2013cvpr-multitarget/}
}