HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Other publications

Dictionary Learning and Sparse Coding for Third-order Super-symmetric Tensors

Abstract : Super-symmetric tensors – a higher-order extension of scatter matrices – are becoming increasingly popular in machine learning and computer vision for modelling data statistics, co-occurrences, or even as visual descriptors. However, the size of these tensors are exponential in the data dimensionality, which is a significant concern. In this paper, we study third-order super-symmetric tensor descriptors in the context of dictionary learning and sparse coding. Our goal is to approximate these tensors as sparse conic combinations of atoms from a learned dictionary, where each atom is a symmetric positive semi-definite matrix. Apart from the significant benefits to tensor compression that this framework provides, our experiments demonstrate that the sparse coefficients produced by the scheme lead to better aggregation of high-dimensional data, and showcases superior performance on two common computer vision tasks compared to the state-of-the-art.
Document type :
Other publications
Complete list of metadata

Cited literature [32 references]  Display  Hide  Download

Contributor : Piotr Koniusz Connect in order to contact the contributor
Submitted on : Friday, September 11, 2015 - 4:12:02 PM
Last modification on : Wednesday, November 4, 2020 - 2:44:58 PM
Long-term archiving on: : Tuesday, December 29, 2015 - 12:43:01 AM


Files produced by the author(s)


  • HAL Id : hal-01197410, version 1
  • ARXIV : 1509.02970



Piotr Koniusz, Anoop Cherian. Dictionary Learning and Sparse Coding for Third-order Super-symmetric Tensors. 2015, pp.13. ⟨hal-01197410⟩



Record views


Files downloads