Orthogonal Nonnegative Tucker Decomposition

10/21/2019
by   Junjun Pan, et al.
0

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.

READ FULL TEXT
research
05/13/2023

Nonnegative Low-Rank Tensor Completion via Dual Formulation with Applications to Image and Video Completion

Recent approaches to the tensor completion problem have often overlooked...
research
02/10/2023

Fast Learnings of Coupled Nonnegative Tensor Decomposition Using Optimal Gradient and Low-rank Approximation

Nonnegative tensor decomposition has been widely applied in signal proce...
research
03/12/2021

Rank properties and computational methods for orthogonal tensor decompositions

The orthogonal decomposition factorizes a tensor into a sum of an orthog...
research
08/17/2022

Sparse Nonnegative Tucker Decomposition and Completion under Noisy Observations

Tensor decomposition is a powerful tool for extracting physically meanin...
research
09/20/2021

Accelerated Stochastic Gradient for Nonnegative Tensor Completion and Parallel Implementation

We consider the problem of nonnegative tensor completion. We adopt the a...
research
02/14/2018

Nonnegative PARAFAC2: a flexible coupling approach

Modeling variability in tensor decomposition methods is one of the chall...
research
05/15/2023

Accelerated Algorithms for Nonlinear Matrix Decomposition with the ReLU function

In this paper, we study the following nonlinear matrix decomposition (NM...

Please sign up or login with your details

Forgot password? Click here to reset