Efficient Nonnegative Tucker Decompositions: Algorithms and Uniqueness

DOI10.1109/TIP.2015.2478396zbMath1408.94841arXiv1404.4412OpenAlexW1878057855WikidataQ40518644 ScholiaQ40518644MaRDI QIDQ4613249

Qibin Zhao, Guoxu Zhou, Sheng-Li Xie, Andrzej Cichocki

Publication date: 31 January 2019

Published in: IEEE Transactions on Image Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.4412

Mathematics Subject Classification ID

Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Related Items (10)

Randomized algorithms for the approximations of Tucker and the tensor train decompositions ⋮ A video watermark algorithm based on tensor decomposition ⋮ Fast nonnegative tensor factorizations with tensor train model ⋮ Sketching for a low-rank nonnegative matrix approximation: numerical study ⋮ Multiplicative algorithms for symmetric nonnegative tensor factorizations and its applications ⋮ The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection ⋮ Randomized algorithms for the low multilinear rank approximations of tensors ⋮ Exploiting Efficient Representations in Large-Scale Tensor Decompositions ⋮ Best Nonnegative Rank-One Approximations of Tensors ⋮ Nonnegative tensor-based linear dynamical systems for recognizing human action from 3D skeletons

This page was built for publication: Efficient Nonnegative Tucker Decompositions: Algorithms and Uniqueness