SearcharxivSearch

arXiv subjects

Sitao Ling

Publications and source records attributed to Sitao Ling.

3 recordsLinked to original sources

Generalized Singular Value Decompositions of Dual Quaternion Matrix Triplets

In signal processing and identification, generalized singular value decomposition (GSVD), related to a sequence of matrices in product/quotient form are essential numerical linear algebra tools. On behalf of the growing demand for efficient processing of coupled rotation-translation signals in modern engineering, we introduce the restricted SVD of a dual quaternion matrix triplet $(\boldsymbol{A},\boldsymbol{B},\boldsymbol{C})$ with $\boldsymbol{A}\in {\bf \mathbb{DQ}}^{m \times n}$, $\boldsymbol{B} \in {\bf \mathbb{DQ}}^{m \times p}$, $\boldsymbol{C} \in {\bf \mathbb{DQ}}^{q\times n}$, and the product-product SVD of a dual quaternion matrix triplet $(\boldsymbol{A},\boldsymbol{B},\boldsymbol{C})$ with $\boldsymbol{A}\in {\bf \mathbb{DQ}}^{m \times n}$, $\boldsymbol{B} \in {\bf \mathbb{DQ}}^{n \times p}$, $\boldsymbol{C} \in {\bf \mathbb{DQ}}^{p\times q}$. The two types of GSVDs represent a sophisticated matrix factorization that accounts for a given dual quaternion matrix in conjunction with two additional dual quaternion matrices. The decompositions can be conceptualized as an adaptation of the standard SVD, where the distinctive feature lies in the application of distinct inner products to the row and column spaces. Two examples are outlined to illustrate the feasibility of the decompositions.

math.NA

Generalized singular value decompositions of dual quaternion matrices and beyond

In high-dimensional data processing and data analysis related to dual quaternion statistics, generalized singular value decomposition (GSVD) of a dual quaternion matrix pair is an essential numerical linear algebra tool for an elegant problem formulation and numerical implementation. In this paper, building upon the existing singular value decomposition (SVD) of a dual quaternion matrix, we put forward several types of GSVD of dual quaternion data matrices in accordance with their dimensions. Explicitly, for a given dual quaternion matrix pair $\{{\boldsymbol A}, {\boldsymbol B}\}$, if ${\boldsymbol A}$ and ${\boldsymbol B}$ have the same number of columns, we investigate two forms of their quotient-type SVD (DQGSVD) through different strategies, which can be selected to use in different scenarios. Three artificial examples are presented to illustrate the principle of the DQGSVD. Alternatively, if ${\boldsymbol A}$ and ${\boldsymbol B}$ have the same number of rows, we consider their canonical correlation decomposition (DQCCD). If ${\boldsymbol A}$ and ${\boldsymbol B}$ are consistent for dual quaternion matrix multiplication, we present their product-type SVD (DQPSVD). As a preparation, we also study the QR decomposition of a dual quaternion matrix based on the dual quaternion Householder transformation, and introduce the CS decomposition of an 2-by-2 blocked unitary dual quaternion matrix. Due to the peculiarity of containing dual part for dual quaternion matrices, the obtained series of GSVD of dual quaternion matrices dramatically distinguish from those in the real number field, the complex number field, and even the quaternion ring, but can be treated as an extension of them to some extent.

math.NA

Randomized Quaternion Singular Value Decomposition for Low-Rank Approximation

This paper presents a randomized quaternion singular value decomposition (QSVD) algorithm for low-rank matrix approximation problems, which are widely used in color face recognition, video compression, and signal processing problems. With quaternion normal distribution based random sampling, the randomized QSVD algorithm projects a high-dimensional data to a low-dimensional subspace and then identifies an approximate range subspace of the quaternion matrix. The key statistical properties of quaternion Wishart distribution are proposed and used to perform the approximation error analysis of the algorithm. Theoretical results show that the randomized QSVD algorithm can trace dominant singular value decomposition triplets of a quaternion matrix with acceptable accuracy. Numerical experiments also indicate the rationality of proposed theories. Applied to color face recognition problems, the randomized QSVD algorithm obtains higher recognition accuracies and behaves more efficient than the known Lanczos-based partial QSVD and a quaternion version of fast frequent directions algorithm.

math.NA