Results 21 to 30 of about 1,077,071 (292)

Orthogonal Nonnegative Tucker Decomposition [PDF]

open access: yesSIAM Journal on Scientific Computing, 2021
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.
Junjun Pan   +4 more
openaire   +2 more sources

Optimization landscape of Tucker decomposition [PDF]

open access: yesMathematical Programming, 2020
Tucker decomposition is a popular technique for many data analysis and machine learning applications. Finding a Tucker decomposition is a nonconvex optimization problem. As the scale of the problems increases, local search algorithms such as stochastic gradient descent have become popular in practice.
Abraham Frandsen, Rong Ge
openaire   +2 more sources

Design and Implementation of Tucker Decomposition Module Based on CUDA and CUBLAS [PDF]

open access: yesJisuanji gongcheng, 2019
Because tensor Tucker decomposition is widely used in image processing,face recognition,signal processing and other fields,Tucker decomposition algorithm becomes a key research object.However,the current popular Tucker decomposition algorithm needs to ...
ZHOU Qi,CHAI Xiaoli,MA Kejie,YU Zeren
doaj   +1 more source

Dynamic L1-Norm Tucker Tensor Decomposition [PDF]

open access: yesIEEE Journal of Selected Topics in Signal Processing, 2020
<p>Tucker decomposition is a standard method for processing multi-way (tensor) measurements and finds many applications in machine learning and data mining, among other fields. When tensor measurements arrive in a streaming fashion or are too many to jointly decompose, incremental Tucker analysis is preferred.
Panos P. Markopoulos   +3 more
openaire   +1 more source

Robust Barron-Loss Tucker Tensor Decomposition [PDF]

open access: yes2021 55th Asilomar Conference on Signals, Systems, and Computers, 2021
<p>In this work, we propose a new formulation for low-rank tensor approximation, with tunable outlier-robustness, and present a unified algorithmic solution framework. This formulation relies on a new generalized robust loss function (Barron loss), which encompasses several well-known loss-functions with variable outlier resistance.
Panos P. Markopoulos, Mahsa Mozaffari
openaire   +1 more source

Tensor decomposition based networks for nuclei segmentation and classification

open access: yesElectronics Letters, 2022
Nuclei segmentation and classification for Haematoxylin & Eosin stained histology images is a challenging task because of many issues, large intra‐class variability among nuclei, overlapping nuclei etc.
Jinhao Chen, Zhao Chen
doaj   +1 more source

Discriminative Nonnegative Tucker Decomposition for Tensor Data Representation

open access: yesMathematics, 2022
Nonnegative Tucker decomposition (NTD) is an unsupervised method and has been extended in many applied fields. However, NTD does not make use of the label information of sample data, even though such label information is available.
Wenjing Jing, Linzhang Lu, Qilong Liu
doaj   +1 more source

Orthogonal tucker decomposition using factor priors for 2D+3D facial expression recognition

open access: yesIET Biometrics, 2021
In this article, an effective approach is proposed to recognise the 2D+3D facial expression automatically based on orthogonal Tucker decomposition using factor priors (OTDFPFER).
Yunfang Fu   +4 more
doaj   +1 more source

Application of Tucker Decomposition in Temperature Distribution Reconstruction

open access: yesApplied Sciences, 2022
Constrained by cost, measuring conditions and excessive calculation, it is difficult to reconstruct a 3D real-time temperature field. For the purpose of solving these problems, a three-dimensional temperature distribution reconstruction algorithm based ...
Zhaoyu Liu   +4 more
doaj   +1 more source

Orthogonal random projection for tensor completion

open access: yesIET Computer Vision, 2020
The low‐rank tensor completion problem, which aims to recover the missing data from partially observable data. However, most of the existing tensor completion algorithms based on Tucker decomposition cannot avoid using singular value decomposition (SVD ...
Yali Feng, Guoxu Zhou
doaj   +1 more source

Home - About - Disclaimer - Privacy