paper-with-me

홈 › Papers

Generalized Visual Information Analysis via Tensorial Algebra

2020-01-31 · Liang Liao, Stephen John Maybank

Higher order data is modeled using matrices whose entries are numerical arrays of a fixed size. These arrays, called t-scalars, form a commutative ring under the convolution product. Matrices with elements in the ring of t-scalars are referred to as t-matrices. The t-matrices can be scaled, added and multiplied in the usual way. There are t-matrix generalizations of positive matrices, orthogonal matrices and Hermitian symmetric matrices. With the t-matrix model, it is possible to generalize many well-known matrix algorithms. In particular, the t-matrices are used to generalize the SVD (Singular Value Decomposition), HOSVD (High Order SVD), PCA (Principal Component Analysis), 2DPCA (Two Dimensional PCA) and GCA (Grassmannian Component Analysis). The generalized t-matrix algorithms, namely TSVD, THOSVD,TPCA, T2DPCA and TGCA, are applied to low-rank approximation, reconstruction,and supervised classification of images. Experiments show that the t-matrix algorithms compare favorably with standard matrix algorithms.

📄 PDF Abstract BibTeX arXiv:2001.11708

Code (1)

liaoliang2020/talgebra 공식 구현

Methods 이 논문이 사용한 방법론

PCA Principle Components Analysis (PCA) is an unsupervised method primary used for dimensionality reduction within machine learning. PCA is calculated via a singular value…
Convolution A convolution is a type of matrix operation, consisting of a kernel, a small matrix of weights, that slides over input data performing element-wise multiplication with the…

Similar Papers 제목 키워드 기반

Generalized Image Reconstruction over T-Algebra

2021-01-17 · Liang Liao, Xuechun Zhang, Xinqiang Wang, Sen Lin 외

Principal Component Analysis (PCA) is well known for its capability of dimension reduction and data compression. However, when using PCA for compressing/reconstructing images, images need to be recast to vectors. The vec…

Data CompressionDimensionality ReductionImage Reconstruction

Fully tensorial approach to hypercomplex neural networks

2024-06-29 · Agnieszka Niemczynowicz, Radosław Antoni Kycia

Fully tensorial theory of hypercomplex neural networks is given. It allows neural networks to use arithmetic based on arbitrary algebras. The key point is to observe that algebra multiplication can be represented as a ra…

General Data Analytics with Applications to Visual Information Analysis: A Provable Backward-Compatible Semisimple Paradigm over T-Algebra

2020-10-31 · Liang Liao, Stephen John Maybank

We consider a novel backward-compatible paradigm of general data analytics over a recently-reported semisimple algebra (called t-algebra). We study the abstract algebraic framework over the t-algebra by representing the …

Double Coupled Canonical Polyadic Decomposition for Joint Blind Source Separation

2016-12-30 · Xiao-Feng Gong, Qiu-Hua Lin, Feng-Yu Cong, Lieven De Lathauwer

Joint blind source separation (J-BSS) is an emerging data-driven technique for multi-set data-fusion. In this paper, J-BSS is addressed from a tensorial perspective. We show how, by using second-order multi-set statistic…

blind source separation

Tensorial Recurrent Neural Networks for Longitudinal Data Analysis

2017-08-01 · Mingyuan Bai, Boyan Zhang, Junbin Gao

Traditional Recurrent Neural Networks assume vectorized data as inputs. However many data from modern science and technology come in certain structures such as tensorial time series data. To apply the recurrent neural ne…

Time SeriesTime Series Analysis