Results 11 to 20 of about 2,754 (231)
IEEE Journal of Selected Topics in Applied Earth Observations and Remote SensingThe fusion of a low-spatial-resolution hyperspectral image (LR-HSI) and a high-spatial-resolution multispectral image (HR-MSI) is an effective way to generate a high-resolution hyperspectral image (HR-HSI).
Jun Zhang, Mengling He, Chengzhi Deng
doaj +2 more sources
Tensor-Ring Decomposition with Index-Splitting [PDF]
Journal of the Physical Society of Japan, 2020 Tensor-ring decomposition of tensors plays a key role in various applications of tensor network representation in physics as well as in other fields. In most heuristic algorithms for the tensor-ring decomposition, one encounters the problem of local-minima trapping.
Hyun-Yong Lee, Naoki Kawashima
openaire +2 more sources
Practical alternating least squares for tensor ring decomposition
Numerical Linear Algebra with Applications, 2023 AbstractTensor ring (TR) decomposition has been widely applied as an effective approach in a variety of applications to discover the hidden low‐rank patterns in multidimensional and higher‐order data. A well‐known method for TR decomposition is the alternating least squares (ALS). However, solving the ALS subproblems often suffers from high cost issue,
Yajie Yu, Hanyu Li
openaire +3 more sources
Higher-dimension Tensor Completion via Low-rank Tensor Ring Decomposition [PDF]
2018 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference (APSIPA ASC), 2018 The problem of incomplete data is common in signal processing and machine learning. Tensor completion algorithms aim to recover the incomplete data from its partially observed entries. In this paper, taking advantages of high compressibility and flexibility of recently proposed tensor ring (TR) decomposition, we propose a new tensor completion approach
Longhao Yuan +4 more
openaire +3 more sources
Representations of a non-pointed Hopf algebra
AIMS Mathematics, 2021 In this paper, we construct all the indecomposable modules of a class of non-pointed Hopf algebras, which are quotient Hopf algebras of a class of prime Hopf algebras of GK-dimension one.
Ruifang Yang, Shilin Yang
doaj +1 more source
Joint-Way Compression for LDPC Neural Decoding Algorithm With Tensor-Ring Decomposition
IEEE Access, 2023 In this paper, we propose low complexity joint-way compression algorithms with Tensor-Ring (TR) decomposition and weight sharing to further lower the storage and computational complexity requirements for low density parity check (LDPC) neural decoding ...
Yuanhui Liang +2 more
doaj +1 more source
Matrix and tensor completion using tensor ring decomposition with sparse representation
Machine Learning: Science and Technology, 2021 Abstract Completing a data tensor with structured missing components is a challenging task where the missing components are not distributed randomly but they admit some regular patterns, e.g. missing columns and rows or missing blocks/patches. Many of the existing tensor completion algorithms are not able to handle such scenarios.
Maame G Asante-Mensah +2 more
openaire +1 more source
An Efficient Tensor Completion Method Via New Latent Nuclear Norm
IEEE Access, 2020 In tensor completion, the latent nuclear norm is commonly used to induce low-rank structure, while substantially failing to capture the global information due to the utilization of unbalanced unfolding schemes.
Jinshi Yu +3 more
doaj +1 more source
IET Intelligent Transport Systems, 2023 Spatiotemporal traffic data usually suffers from missing entries in the data acquisition and transmission process. Existing imputation methods only consider the global/local structure of spatiotemporal traffic data, resulting in insufficient estimation ...
Peng‐Ling Wu +2 more
doaj +1 more source
On algorithms for and computing with the tensor ring decomposition
Numerical Linear Algebra with Applications, 2020 AbstractTensor decompositions such as the canonical format and the tensor train format have been widely utilized to reduce storage costs and operational complexities for high‐dimensional data, achieving linear scaling with the input dimension instead of exponential scaling.
Oscar Mickelin, Sertac Karaman
openaire +5 more sources