Linear Image Coding for Regression and Classification Using the Tensor-Rank Principle
Abstract
Given a collection of images (matrices) representing a "class" of objects we present a method for extracting the commonalities of the image space directly from the matrix representations (rather than from the vectorized representation which one would normally do in a PCA approach, for example). The general idea is to consider the collection of matrices as a tensor and to look for an approximation of its tensor-rank. The tensor-rank approximation is designed such that the SVD decomposition emerges in the special case where all the input matrices are the repeatition of a single matrix. We evaluate the coding technique both in terms of regression, i.e., the efficiency of the technique for functional approximation, and classification. We find that for regression the tensor-rank coding, as a dimensionality reduction technique, significantly outperforms other techniques like PCA. As for classification, the tensor-rank coding is at is best when the number of training examples is very small.
Cite
Text
Shashua and Levin. "Linear Image Coding for Regression and Classification Using the Tensor-Rank Principle." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2001. doi:10.1109/CVPR.2001.990454Markdown
[Shashua and Levin. "Linear Image Coding for Regression and Classification Using the Tensor-Rank Principle." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2001.](https://mlanthology.org/cvpr/2001/shashua2001cvpr-linear/) doi:10.1109/CVPR.2001.990454BibTeX
@inproceedings{shashua2001cvpr-linear,
title = {{Linear Image Coding for Regression and Classification Using the Tensor-Rank Principle}},
author = {Shashua, Amnon and Levin, Anat},
booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
year = {2001},
pages = {I:42-49},
doi = {10.1109/CVPR.2001.990454},
url = {https://mlanthology.org/cvpr/2001/shashua2001cvpr-linear/}
}