Results 221 to 230 of about 10,455 (264)
State-Specific Segmental Abnormalities of White Matter Structure and Function in Pediatric Bipolar Disorders. [PDF]
Chen Z +10 more
europepmc +1 more source
Relation-aware context aggregation framework for sparse knowledge graph completion. [PDF]
Guan S, Han X.
europepmc +1 more source
Practical utility of ultrasound-guided brain shift correction during glioma: patient series. [PDF]
Sadhwani N, Moiyadi A.
europepmc +1 more source
Quantitative Muscle MRI Fat Fraction as a Biomarker of Disease Severity in Mitochondrial Myopathies. [PDF]
Bermejo-Moriñigo A +12 more
europepmc +1 more source
Tensor Factorization for Low-Rank Tensor Completion
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, Lin, Zhouchen
exaly +5 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Internet traffic tensor completion with tensor nuclear norm
Computational Optimization and Applications, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Can Li, Yannan Chen, Dong-Hui Li
openaire +1 more source
Smooth Tensor Product for Tensor Completion
IEEE Transactions on Image ProcessingLow-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 +3 more sources
Distributed Tensor Completion Over Networks
ICASSP 2020 - 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2020The 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

