Results 231 to 240 of about 9,749 (261)

Tensor Factorization for Low-Rank Tensor Completion

IEEE Transactions on Image Processing, 2018
Recently, a tensor nuclear norm (TNN) based method was proposed to solve the tensor completion problem, which has achieved state-of-the-art performance on image and video inpainting tasks. However, it requires computing tensor singular value decomposition (t-SVD), which costs much computation and thus cannot efficiently handle tensor data, due to its ...
Pan Zhou, Canyi Lu, Zhouchen Lin
exaly   +4 more sources

Some of the next articles are maybe not open access.

Related searches:

Internet traffic tensor completion with tensor nuclear norm

Computational Optimization and Applications, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Can Li, Yannan Chen, Dong-Hui Li
openaire   +1 more source

Distributed Tensor Completion Over Networks

ICASSP 2020 - 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2020
The aim of this paper is to propose a novel distributed strategy for tensor completion, where (partial) data are collected over a network of agents with sparse, but connected, topology. The method hinges on the canonical polyadic decomposition, also known as PARAFAC, to complete the low-rank tensor in a distributed fashion.
Battiloro C., Di Lorenzo P.
openaire   +2 more sources

Smooth Tensor Product for Tensor Completion

IEEE Transactions on Image Processing
Low-rank tensor completion (LRTC) has shown promise in processing incomplete visual data, yet it often overlooks the inherent local smooth structures in images and videos. Recent advances in LRTC, integrating total variation regularization to capitalize on the local smoothness, have yielded notable improvements.
Tongle Wu, Jicong Fan 0001
openaire   +2 more sources

A Rank-One Tensor Updating Algorithm for Tensor Completion

IEEE Signal Processing Letters, 2015
In this letter, we propose a rank-one tensor updating algorithm for solving tensor completion problems. Unlike the existing methods which penalize the tensor by using the sum of nuclear norms of unfolding matrices, our optimization model directly employs the tensor nuclear norm which is studied recently.
Yuning Yang, Yunlong Feng, Johan A. K. Suykens   +2 more
openaire   +1 more source

Weighted tensor nuclear norm minimization for tensor completion using tensor-SVD

Pattern Recognition Letters, 2020
Abstract In this paper, we consider the tensor completion problem, which aims to estimate missing values from limited information. Our model is based on the recently proposed tensor-SVD, which uses the relationships among the color channels in an image or video recovery problem. To improve the availability of the model, we propose the weighted tensor
Liangfu Lu, Xuyun Zhang, Lianyong Qi
exaly   +2 more sources

Automorphisms of Tensor Completions of Algebras

Algebra and Logic, 2005
Summary: In the classical representation of different groups, frequent use is made of a linear automorphism group of various algebras. Since the linear automorphism group is only part of a full automorphism group, such an approach might seem to be too restrictive.
openaire   +2 more sources

An Adaptive Correction Approach for Tensor Completion

SIAM Journal on Imaging Sciences, 2016
Summary: In this paper, we study the tensor completion problem on recovery of the multilinear data under limited sampling. A popular convex relaxation of this problem is to minimize the nuclear norm of the more square matrix produced by matricizing a tensor. However, it may fail to produce a highly accurate solution under low sample ratio.
Minru Bai, Xiongjun Zhang, Guyan Ni, Chunfeng Cui   +3 more
openaire   +1 more source

Tensor rank is NP-complete

Journal of Algorithms, 1989
We prove that computing the rank of a three-dimensional tensor over any finite field is NP-complete. Over the rational numbers the problem is NP-hard.
openaire   +1 more source

TENSOR COMPLETION FOR A CERTAIN CLASS OF GROUPS

International Journal of Algebra and Computation, 1996
In this paper we construct the tensor A-completion over an arbitrary torsion-free ring A for groups whose maximal abelian subgroups are either conjugate separated or A-modules. As a corollary, this result gives us an explicit description of the structure of tensor completion for groups of the form F/N′, in particular, for free solvable groups. We also
openaire   +2 more sources