Results 41 to 50 of about 9,676 (259)
Accelerated non-negative tensor completion via integer programming
Frontiers in Applied Mathematics and Statistics, 2023 The problem of tensor completion has applications in healthcare, computer vision, and other domains. However, past approaches to tensor completion have faced a tension in that they either have polynomial-time computation but require exponentially more ...
Wenhao Pan +3 more
doaj +1 more source
Traffic Flow Prediction With Missing Data Imputed by Tensor Completion Methods
IEEE Access, 2020 Missing data is inevitable and ubiquitous in intelligent transportation systems (ITSs). A handful of completion methods have been proposed, among which the tensor-based models have been shown to be the most advantageous for missing traffic data ...
Qin Li +4 more
doaj +1 more source
Rank revealing‐based tensor completion using improved generalized tensor multi‐rank minimization
IET Signal Processing, 2021 The authors address the problem of tensor completion from limited samplings. An improved generalized tubal Kronecker decomposition is first proposed to reveal the tensor structure of the targeted data, and the improved generalized tensor tubal‐rank and ...
Wei Z. Sun, Peng Zhang, Bo Zhao
doaj +1 more source
Covariate-Assisted Sparse Tensor Completion
Journal of the American Statistical Association, 2022 To Appear in Journal of the American Statistical ...
Hilda S. Ibriga, Will Wei Sun
openaire +2 more sources
Matrix completion and tensor rank [PDF]
Linear and Multilinear Algebra, 2015 In this paper, we show that the low rank matrix completion problem can be reduced to the problem of finding the rank of a certain tensor.
openaire +2 more sources
Tensor Completion via Tensor Networks with a Tucker Wrapper
CoRR, 2020 In recent years, low-rank tensor completion (LRTC) has received considerable attention due to its applications in image/video inpainting, hyperspectral data recovery, etc. With different notions of tensor rank (e.g., CP, Tucker, tensor train/ring, etc.), various optimization based numerical methods are proposed to LRTC.
Yunfeng Cai, Ping Li 0001
openaire +2 more sources
Tensor Methods for Nonlinear Matrix Completion
SIAM Journal on Mathematics of Data Science, 2021 In the low-rank matrix completion (LRMC) problem, the low-rank assumption means that the columns (or rows) of the matrix to be completed are points on a low-dimensional linear algebraic variety. This paper extends this thinking to cases where the columns are points on a low-dimensional nonlinear algebraic variety, a problem we call Low Algebraic ...
Greg Ongie +4 more
openaire +3 more sources
The Geometry of Rank-One Tensor Completion [PDF]
SIAM Journal on Applied Algebra and Geometry, 2017 The geometry of the set of restrictions of rank-one tensors to some of their coordinates is studied. This gives insight into the problem of rank-one completion of partial tensors. Particular emphasis is put on the semialgebraic nature of the problem, which arises for real tensors with constraints on the parameters.
Kahle, Thomas +4 more
openaire +4 more sources
Riemannian preconditioning for tensor completion
CoRR, 2015 We propose a novel Riemannian preconditioning approach for the tensor completion problem with rank constraint. A Riemannian metric or inner product is proposed that exploits the least-squares structure of the cost function and takes into account the structured symmetry in Tucker decomposition.
Hiroyuki Kasai, Bamdev Mishra
openaire +2 more sources
IEEE Journal of Selected Topics in Applied Earth Observations and Remote SensingThe task of hyperspectral image completion generally involves random missing entries completion, stripes inpainting, and cloud removal, which can enhance the accuracy of subsequent image analysis.
Yao Li, Yujie Zhang, Hongwei Li
doaj +1 more source