Orthogonal Nonnegative Tucker Decomposition
Not on the map. Why?
Abstract (arXiv)
In this paper, we study the nonnegative tensor data and propose an orthogonal nonnegative Tucker decomposition (ONTD). We discuss some properties of ONTD and develop a convex relaxation algorithm of the augmented Lagrangian function to solve the optimization problem. The convergence of the algorithm is given. We employ ONTD on the image data sets from the real world applications including face recognition, image representation, hyperspectral unmixing. Numerical results are shown to illustrate the effectiveness of the proposed algorithm.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). First posted on arXiv 21 Oct 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 2; 2023: 0; 2024: 1.
3 papers.