Robust quaternion matrix completion with applications to image inpainting

In this paper, we study robust quaternion matrix completion and provide a rigorous analysis for provable estimation of quaternion matrix from a random subset of their corrupted entries. In order to generalize the results from real matrix completion to quaternion matrix completion, we derive some new formulas to handle noncommutativity of quaternions. We solve a convex optimization problem, which minimizes a nuclear norm of quaternion matrix that is a convex surrogate for the quaternion matrix rank, and the ?₁‐norm of sparse quaternion matrix entries. We show that, under incoherence conditions, a quaternion matrix can be recovered exactly with overwhelming probability, provided that its rank is sufficiently small and that the corrupted entries are sparsely located. The quaternion framework can be used to represent red, green, and blue channels of color images. The results of missing/noisy color image pixels as a robust quaternion matrix completion problem are given to show that the performance of the proposed approach is better than that of the testing methods, including image inpainting methods, the tensor‐based completion method, and the quaternion completion method using semidefinite programming.     

Lanczos method for large-scale quaternion singular value decomposition

In many color image processing and recognition applications, one of the most important targets is to compute the optimal low-rank approximations to color images, which can be reconstructed with a small number of dominant singular value decomposition (SVD) triplets of quaternion matrices. All existing methods are designed to compute all SVD triplets of quaternion matrices at first and then to select the necessary dominant ones for reconstruction. This way costs quite a lot of operational flops and CPU times to compute many superfluous SVD triplets. In this paper, we propose a Lanczos-based method of computing partial (several dominant) SVD triplets of the large-scale quaternion matrices. The partial bidiagonalization of large-scale quaternion matrices is derived by using the Lanczos iteration, and the reorthogonalization and thick-restart techniques are also utilized in the implementation. An algorithm is presented to compute the partial quaternion singular value decomposition. Numerical examples, including principal component analysis, color face recognition, video compression and color image completion, illustrate that the performance of the developed Lanczos-based method for low-rank quaternion approximation is better than that of the state-of-the-art methods.

     

Some general constructions of geodetic blocks

A general construction procedure for geodetic blocks, starting from an arbitrary geodetic block is given, which unifies and generalizes many of the known general procedures. The construction of geodetic blocks homeomorphic to a given one is also analysed and the problem of Bosák on the existence of such a graph for the Hoffman-Singleton graph is settled in the affirmative. A simple characterization theorem for geodetic blocks is given and the existence of geodetic blocks with given girth and diameter is investigated.     

由两个右特征对构造三对角四元数矩阵

讨论由两个右特征对构造三对角四元数矩阵的数值求解问题,给出了该问题有解的充要条件,以及解的具体表达式.在已知两个特征对的条件下,进一步给出了三对角自共轭、三对角正定四元数矩阵的存在条件及计算方法.     

Algebraic techniques for least squares problem over generalized quaternion algebras: A unified approach in quaternionic and split quaternionic theory

This paper aims to present, in a unified manner, algebraic techniques for least squares problem in quaternionic and split quaternionic mechanics. This paper, by means of a complex representation and a real representation of a generalized quaternion matrix, studies generalized quaternion least squares (GQLS) problem, and derives two algebraic methods for solving the GQLS problem. This paper gives not only algebraic techniques for least squares problem over generalized quaternion algebras, but also a unification of algebraic techniques for least squares problem in quaternionic and split quaternionic theory.     

The isometry classification of hermitian forms over division algebras

The isometry classification problem occupies a central role in the theory of quadratic and hermitian forms. This article is a survey of results on the problem for quadratic and hermitian forms over a field and also for hermitian and skew-hermitian forms over a noncommutative division algebra with involution. Rather than adopting a very abstract approach, the problems are stated in matrix or linear-algebraic terms. The known solutions depend crucially on the particular field considered, although there are some general results which are mentioned. While many of the results date back a long time, some recent results, especially those on skew-hermitian forms over a quaternion algebra over a number field, are included.     

Involutions of Complexified Quaternions and Split Quaternions

An involution or anti-involution is a self-inverse linear mapping. Involutions and anti-involutions of real quaternions were studied by Ell and Sangwine [15]. In this paper we present involutions and antiinvolutions of biquaternions (complexified quaternions) and split quaternions. In addition, while only quaternion conjugate can be defined for a real quaternion and split quaternion, also complex conjugate can be defined for a biquaternion. Therefore, complex conjugate of a biquaternion is used in some transformations beside quaternion conjugate in order to check whether involution or anti-involution axioms are being satisfied or not by these transformations. Finally, geometric interpretations of real quaternion, biquaternion and split quaternion involutions and anti-involutions are given.     

Schmidt Decomposition of Quaternion Matrix and the Orthonormalization of Vectors in a Generalized Unitary Space

ＳｃｈｍｉｄｔＤｅｃｏｍｐｏｓｉｔｉｏｎｏｆＱｕａｔｅｒｎｉｏｎＭａｔｒｉｘａｎｄｔｈｅＯｒｔｈｏｎｏｒｍａｌｉｚａｔｉｏｎｏｆＶｅｃｔｏｒｓｉｎａＧｅｎｅｒａｌｉｚｅｄＵｎｉｔａｒｙＳｐａｃｅＷａｎｇＱｉｎｇｗｅｎ（Ｄｅｐｔ．ｏｆＭａｔｈ．，Ｃｈａ...     

Comparative study of Mixed product and quaternion product

Mixed number is the sum of a scalar and a vector. The quaternion can also be written as the sum of a scalar and a vector but the product of mixed numbers and the product of quaternions are different. Here we studied the Mixed product which is derived from the product of mixed numbers and the quaternion product which is derived from the product of quaternions. It was observed that Mixed product is more consistent with Physics than that of quaternion product.     

Algebraic Method for Inequality Constrained Quaternion Least Squares Problem

In this paper, we introduce a kind of complex representation of quaternion matrices (or quaternion vectors) and quaternion matrix norms, study quaternionic least squares problem with quadratic inequality constraints (LSQI) by means of generalized singular value decomposition of quaternion matrices (GSVD), and derive a practical algorithm for finding solutions of the quaternionic LSQI problem in quaternionic quantum theory.     

An extremal problem in geodetic graphs

An upper bound for the number of lines in a geodetic block of diameter d on p points is obtained, using some new general properties of geodetic blocks which are also of independent interest.     

基于四元数方法的绳系机器人姿态控制

为进一步提升空间绳系机器人在轨服务能力，研究了空间绳系机器人抓捕目标后的复合体姿态控制问题.首先，基于四元数原理，描述了空间绳系机器人在抓捕目标后组成的复合体姿态，建立了空间绳系机器人系统的动力学方程；其次，针对带约束的动力学控制方程，结合投影技术和Runge Kutta方法，构造了一种保四元数范数的显式投影方法；最后，通过数值实验，验证了所提出数值方法的有效性，同时分析了采用系绳和推力器同时控制，采用系绳、推力器相互切换控制，以及单独采用推力器进行控制这3种方式对空间绳系机器人抓捕目标后的复合体姿态的控制效果和能量消耗.     

Attitude control of rigid spacecraft with disturbance generated by time varying exosystems

This paper is concerned with the problem of attitude control and disturbance rejection of rigid spacecraft in the presence of parameter uncertainty. It is assumed that the external disturbance is generated by some time varying exosystems. The unit quaternion is used as the kinematic variables since it is free of singularity. An internal model and an adaptive control law are proposed. The parameter uncertainty caused by the unknown inertia matrix is handled by combining the semi-tensor product and adaptive control method. The asymptotical stability of the closed-loop system is given via backstepping and Lyapunov analysis. Finally, an illustrative example is provided to show the effectiveness of the proposed approach.     

A new technique of quaternion equality constrained least squares problem

By means of complex representation of a quaternion matrix, we study the relationship between the solutions of the quaternion equality constrained least squares problem and that of complex equality constrained least squares problem, and obtain a new technique of finding a solution of the quaternion equality constrained least squares problem.     

Equality constrained least squares problem over quaternion field

By using complex representation and GSVD of quaternion matrices, we define the norm of quaternion matrices, study the equality constrained least squares problem of quaternion matrices, give the necessary and sufficient conditions for the quaternion equality constrained least squares problem to have solutions, and finally derive a practical algorithm.     

State-space modeling for seismic signal analysis

The time series utilized for geodetic signal analysis, such as strain and groundwater level data, usually is largely affected by barometric pressure, earth tide and precipitation, and also suffer from missing observations due to instrument maintenance or breakdown. To detect informative geodetic signal from heavily noise-affected data, one must build a time series model for decomposition of the data taking into account the characteristics of effects from these covariates. This paper proposes a new modeling method for detecting geodetic signal from earthquake-related time series data by introducing pole-restricted precipitation model, jump component and pre-processing with AR model for interpolating missing observations. Using the proposed method, a geodetic sample data can be decomposed stably into several components including geodetic trend signal, barometric pressure response, earth tidal response, precipitation response and data level shift due to mechanical maintenance or breakdown. The decomposition of the time series and the interpolation of the missing observations are performed very efficiently by using the state-space representation and the Kalman filter/smoother. Finally, case studies of real geodetic sample data demonstrate the effectiveness of the proposed modeling method that lead to some important findings in seismology.     

Geodetic orientations of complete k-partite graphs

Ore defined a graph to be geodetic if and only if there is a unique shortest path between two points, and posed the problem of characterizing such graphs. Here this problem is studied in the context of oriented graphs and such geodetic orientations are characterized first for complete graphs (geodetic tournaments), then for complete bipartite and complete tripartite graphs, and finally for complete k-partite graphs.     

Dual Quaternion Involutions and Anti-Involutions

An involution or anti-involution is a self-inverse linear mapping. In this paper, we present involutions and anti-involutions of dual quaternions. In order to do this, quaternion conjugate, dual conjugate and total conjugate are defined for a dual quaternion and these conjugates are used in some transformations in order to check whether involution or anti-involution axioms are being satisfied or not by these transformations. Finally, geometric interpretations of real quaternion and dual quaternion involutions and anti-involutions are given.     

一类四元数矩阵方程的循环解及其最佳逼近

本文研究了四元数体上矩阵方程XB = C 的循环解及其最佳逼近问题. 利用循环矩阵的结构表示式, 以及四元数矩阵的复分解, 得到了方程XB = C 的循环解存在条件及其通解形式; 在循环矩阵约束条件下, 给出了该方程的最小二乘解集合; 与此同时, 在最小二乘解集合中, 获得与给定四元数循环矩阵的最佳逼近解. 推广了约束矩阵方程的数值求解范围. 数值算例验证了本文算法的可行性.     

一类四元数矩阵方程的循环解及其最佳逼近

本文研究了四元数体上矩阵方程XB=C的循环解及其最佳逼近问题.利用循环矩阵的结构表示式,以及四元数矩阵的复分解,得到了方程XB=C的循环解存在条件及其通解形式;在循环矩阵约束条件下,给出了该方程的最小二乘解集合;与此同时,在最小二乘解集合中,获得与给定四元数循环矩阵的最佳逼近解.推广了约束矩阵方程的数值求解范围.数值算例验证了本文算法的可行性.