Orthogonal nonnegative Tucker decomposition
From MaRDI portal
Abstract: 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.
Recommendations
Cites work
- A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A Multilinear Singular Value Decomposition
- A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix
- A Singular Value Thresholding Algorithm for Matrix Completion
- Computing non-negative tensor factorizations
- Density matrix minimization with \({\ell}_1\) regularization
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Hierarchical ALS Algorithms for Nonnegative Matrix and 3D Tensor Factorization
- scientific article; zbMATH DE number 3579840 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- Learning the parts of objects by non-negative matrix factorization
- Merit functions for semi-definite complementarity problems
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- On the complexity of nonnegative matrix factorization
- Orthogonal nonnegative matrix factorization by sparsity and nuclear norm optimization
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Spectral Unmixing via Data-Guided Sparsity
- Tensor Decomposition for Signal Processing and Machine Learning
- Tensor Decompositions and Applications
- Tensor spaces and numerical tensor calculus
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
Cited in
(13)- Nonnegative non-redundant tensor decomposition
- Alternating proximal gradient method for sparse nonnegative Tucker decomposition
- Algorithms for Sparse Nonnegative Tucker Decompositions
- Low rank non-negative triple decomposition and non-negative tensor completion
- Nonnegative tensor decomposition
- Legendre decomposition for tensors
- Unilateral Orthogonal Nonnegative Matrix Factorization
- Provable stochastic algorithm for large-scale fully-connected tensor network decomposition
- Stochastic nested primal-dual method for nonconvex constrained composition optimization
- Joint randomized algorithms for the federated low-multilinear-rank approximation of modified Tucker decomposition
- Orthogonal constrained minimization with tensor \(\ell_{2,p}\) regularization for HSI denoising and destriping
- RTSMS: randomized Tucker with single-mode sketching
- Functional tensor singular value decomposition
This page was built for publication: Orthogonal nonnegative Tucker decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5147984)
