tenSVD algorithm for compression

Michele Gallo
5/27/2025
stat.COcs.CVcs.LG

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

Tensors provide a robust framework for managing high-dimensional data. Consequently, tensor analysis has emerged as an active research area in various domains, including machine learning, signal processing, computer vision, graph analysis, and data mining. This study introduces an efficient image storage approach utilizing tensors, aiming to minimize memory to store, bandwidth to transmit and energy to processing. The proposed method organizes original data into a higher-order tensor and applies the Tucker model for compression. Implemented in R, this method is compared to a baseline algorithm. The evaluation focuses on efficient of algorithm measured in term of computational time and the quality of information preserved, using both simulated and real datasets. A detailed analysis of the results is conducted, employing established quantitative metrics, with significant attention paid to sustainability in terms of energy consumption across algorithms.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{gallo2025tensvd,
  title  = {tenSVD algorithm for compression},
  author = {Michele Gallo},
  year   = {2025},
  eprint = {2505.21686},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2505.21686v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2505.21686.svg)](https://codeofpaper.com/paper/2505.21686)

Discussion