Sparse Image Coding Using a 3D Non-Negative Tensor Factorization
Abstract
We introduce an algorithm for a non-negative 3D tensor factorization for the purpose of establishing a local parts feature decomposition from an object class of images. In the past, such a decomposition was obtained using non-negative matrix factorization (NMF) where images were vectorized before being factored by NMF. A tensor factorization (NTF) on the other hand preserves the 2D representations of images and provides a unique factorization (unlike NMF which is not unique). The resulting "factors" from the NTF factorization are both sparse (like with NMF) but also separable allowing efficient convolution with the test image. Results show a superior decomposition to what an NMF can provide on all fronts - degree of sparsity, lack of ghost residue due to invariant parts and efficiency of coding of around an order of magnitude better. Experiments on using the local parts decomposition for face detection using SVM and Adaboost classifiers demonstrate that the recovered features are discriminatory and highly effective for classification.
Cite
Text
Hazan et al. "Sparse Image Coding Using a 3D Non-Negative Tensor Factorization." IEEE/CVF International Conference on Computer Vision, 2005. doi:10.1109/ICCV.2005.228Markdown
[Hazan et al. "Sparse Image Coding Using a 3D Non-Negative Tensor Factorization." IEEE/CVF International Conference on Computer Vision, 2005.](https://mlanthology.org/iccv/2005/hazan2005iccv-sparse/) doi:10.1109/ICCV.2005.228BibTeX
@inproceedings{hazan2005iccv-sparse,
title = {{Sparse Image Coding Using a 3D Non-Negative Tensor Factorization}},
author = {Hazan, Tamir and Polak, Simon and Shashua, Amnon},
booktitle = {IEEE/CVF International Conference on Computer Vision},
year = {2005},
pages = {50-57},
doi = {10.1109/ICCV.2005.228},
url = {https://mlanthology.org/iccv/2005/hazan2005iccv-sparse/}
}