Kronecker product approximation with multiple factor matrices via the tensor product algorithm

  title={Kronecker product approximation with multiple factor matrices via the tensor product algorithm},
  author={King Keung Wu and Yeung Yam and Helen M. Meng and Mehran Mesbahi},
  journal={2016 IEEE International Conference on Systems, Man, and Cybernetics (SMC)},
  • King Keung Wu, Y. Yam, M. Mesbahi
  • Published 1 October 2016
  • Computer Science, Mathematics
  • 2016 IEEE International Conference on Systems, Man, and Cybernetics (SMC)
Kronecker product (KP) approximation has recently been applied as a modeling and analysis tool on systems with hierarchical networked structure. In this paper, we propose a tensor product-based approach to the KP approximation problem with arbitrary number of factor matrices. The formulation involves a novel matrix-to-tensor transformation to convert the KP approximation problem to a best rank-(R1, …, RN) tensor product approximation problem. In addition, we develop an algorithm based on higher… 

Figures from this paper

Tensor methods for multisensor signal processing
This work proposes a comprehensive overview of tensor-based models and methods for multisensor signal processing, and gives synthetic descriptions of state-of-art estimators as the Alternating Least Square (ALS), the High-Order SVD (HOSVD), and of more advanced algorithms as the Rectified ALS, the TT-SVD/TT-HSVD and the Joint dImensionally Reduction And Factor retrieval Estimator (JIRAFE) scheme.
Rank-One Detector for Kronecker-Structured Constant Modulus Constellations
The proposed novel decoding strategy for Kronecker-RoD (rank-one detector) is based on a rank-one approximation of the “tensorized” received data block, has a built-in noise rejection capability and a smaller implementation complexity than state-of-the-art detectors.
Multi-Linear Encoding and Decoding for MIMO Systems
This work proposes multi-linear encoding and decoding strategies by exploiting Kronecker-structured constant modulus constellations for providing a low bit error ratio (BER) in multiple-inputmultiple-output (MIMO) systems.
SAR Image Matching Based on Local Feature Detection and Description Using Convolutional Neural Network
Feature detection is a vital step for the image registration process whose target is the misalignment correction among images to increase the convergency level. Deep learning (DL) in remote sensing


On the Tensor SVD and the Optimal Low Rank Orthogonal Approximation of Tensors
The existence of an optimal approximation is theoretically guaranteed under certain conditions, and this optimal approximation yields a tensor decomposition where the diagonal of the core is maximized.
On the Best Rank-1 and Rank-(R1 , R2, ... , RN) Approximation of Higher-Order Tensors
A multilinear generalization of the best rank-R approximation problem for matrices, namely, the approximation of a given higher-order tensor, in an optimal least-squares sense, by a tensor that has prespecified column rank value, rowRank value, etc.
Tensor Product Model Transformation in Polytopic Model-Based Control
Introduction Significant paradigm changes Current computational methods and Applications Role of the TP model transformation in control design Part I: Tensor-product Model Transformation of Linear
On the Best Rank-1 and Rank-(
In this paper we discuss a multilinear generalization of the best rank-R approximation problem for matrices, namely, the approximation of a given higher-order tensor, in an optimal leastsquares
Tensor Decompositions and Applications
This survey provides an overview of higher-order tensor decompositions, their applications, and available software. A tensor is a multidimensional or $N$-way array. Decompositions of higher-order
The ubiquitous Kronecker product
Algorithm 862: MATLAB tensor classes for fast algorithm prototyping
Four MATLAB classes for tensor manipulations that can be used for fast algorithm prototyping are described and their use is demonstrated by showing how to implement several tensor algorithms that have appeared in the literature.
Approximation with Kronecker Products
Let A be an m-by-n matrix with m=m1m2 and n=n1n2. We consider the problem of finding (mathematical formula omitted) so that (mathematical formula omitted) is minimized. This problem can be solved by
A Multilinear Singular Value Decomposition
There is a strong analogy between several properties of the matrix and the higher-order tensor decomposition; uniqueness, link with the matrix eigenvalue decomposition, first-order perturbation effects, etc., are analyzed.
Fuzzy approximation via grid point sampling and singular value decomposition
  • Y. Yam
  • Computer Science, Mathematics
    IEEE Trans. Syst. Man Cybern. Part B
  • 1997
The present approach yields a class of equivalent fuzzy approximator to a given function which approximates the given function to within an error which is dependent on the sampling intervals and the singular values discarded from the approximation process.