Cyclic Solution and Optimal Approximation of the Quaternion Stein Equation

In this paper, two different methods are used to study the cyclic structure solution and the optimal approximation of the quaternion Stein equation AXB - X = F . Firstly, the matrix equation equivalent to the target structure matrix is constructed by using the complex decomposition of the quaternion matrix, to obtain the necessary and sufficient conditions for the existence of the cyclic solution of the equation and the expression of the general solution. Secondly, the Stein equation is converted into the Sylvester equation by adding the necessary parameters, and the condition for the existence of a cyclic solution and the expression of the equation’s solution are then obtained by using the real decomposition of the quaternion matrix and the Kronecker product of the matrix. At the same time, under the condition that the solution set is non-empty, the optimal approximation solution to the given quaternion circulant matrix is obtained by using the property of Frobenius norm property. Numerical examples are given to verify the correctness of the theoretical results and the feasibility of the proposed method. .

GENERALIZED DIAGONALIZATION OF MATRICES OVER QUATERNION FIELD

A concept of [GRAPHICS] diagonalization matrix over quaternion field is given, the necessary and sufficient conditions for determining whether a quaternion matrix is a [GRAPHICS] diagonalization one are discussed, and a method of [GRAPHICS] diagonalization of matrices over quaternion field is given.

基于四元数极性复指数变换的图像复制-粘贴篡改检测算法

在面对复制-粘贴(Copy-Move)篡改检测时,图像经过压缩、缩放、旋转和加噪等篡改操作处理后会导致检测性能的急剧下降甚至检测失败。本研究提出一种基于四元数极性复指数变换(quaternion polar complex exponential transform,QPCET)和改进PatchMatch的篡改检测算法。将待测图像进行重叠分块之后,计算各分块的四元数极性复指数变换不变量,并作为每一块的特征向量,构成特征矩阵。特征向量的初步匹配通过改进的PatchMatch算法完成,再通过随机抽样一致(random sampling consistency,RANSAC)算法去除错误的匹配块。在此基础上,使用形态学运算对标记区域进行处理,最终确定篡改区域。仿真结果表明,该算法可以有效检测图像中的Copy-Move篡改,并且对图像旋转、缩放、加噪和JPEG压缩等篡改区域后处理操作具有较好的鲁棒性。

AN ALGORITHM FOR JORDAN CANONICAL FORM OF A QUATERNION MATRIX

In this paper, we first introduce a concept of companion vector, and studythe Jordan canonical forms of quaternion matrices by using the methods of complex representation and companion vector, not only give out a practical algorithm for Jordancanonical form J of a quaternion matrix A, but also provide a practical algorithm forcorresponding nonsingular matrix P with P- 1 AP = J.

A Unified Algebraic Technique for Eigenvalues and Eigenvectors in Quaternionic and Split Quaternionic Mechanics

This paper aims to present, in a unified manner, the algebraic techniques of eigen-problem which are valid on both the quaternions and split quaternions. This paper studies eigenvalues and eigenvectors of the v-quaternion matrices by means of the complex representation of the v-quaternion matrices, and derives an algebraic technique to find the eigenvalues and eigenvectors of v-quaternion matrices. This paper also gives a unification of algebraic techniques for eigenvalues and eigenvectors in quaternionic and split quaternionic mechanics.

A Theoretical Foundation for the Widely Linear Processing of Quaternion-Valued Data

In this paper, we will give a theoretical foundation for a quaternion-valued widely linear estimation framework. The estimation error obtained with the quaternion-valued widely linear estimation method is proved to be smaller than that obtained using the usual quaternion-valued linear estimation method.

Algebraic Techniques for Linear Equations over Quaternions and Split Quaternions: A Unified Approach in Quaternionic and Split Quaternionic Mechanics

This paper aims to present, in a unified manner, algebraic techniques for linear equations which are valid on both the algebras of quaternions and split quaternions. This paper, introduces a concept of v-quaternion, studies the problem of v-quaternionic linear equations by means of a complex representation and a real representation of v-quaternion matrices, and gives two algebraic methods for solving v-quaternionic linear equations. This paper also gives a unification of algebraic techniques for quaternionic and split quaternionic linear equations in quaternionic and split quaternionic mechanics.

ON SOLUTIONS OF QUATERNION MATRIX EQUATIONS XF-AX=BY AND XF-A=BY

In this paper,the quaternion matrix equations XF-AX=BY and XF-A=BY are investigated.For convenience,they were called generalized Sylvesterquaternion matrix equation and generalized Sylvester-j-conjugate quaternion matrix equation,which include the Sylvester matrix equation and Lyapunov matrix equation as special cases.By applying of Kronecker map and complex representation of a quaternion matrix,the sufficient conditions to compute the solution can be given and the expressions of the explicit solutions to the above two quaternion matrix equations XF-AX=BY and XF-A=BY are also obtained.By the established expressions,it is easy to compute the solution of the quaternion matrix equation in the above two forms.In addition,two practical algorithms for these two quaternion matrix equations are give.One is complex representation matrix method and the other is a direct algorithm by the given expression.Furthermore,two illustrative examples are proposed to show the efficiency of the given method.

The Properties and Fast Algorithm of Quaternion Linear Canonical Transform

The quaternion linear canonical transform (QLCT) is defined in this paper, with proofs given for its reversibility property, its linear property, its odd-even invariant property and additivity property. Meanwhile, the quaternion convolution (QCV), quaternion correlation (QCR) and product theorem of LCT are deduced. Their physical interpretation is given as classical convolution, correlation and product theorem. Moreover, the fast algorithm of QLCT (FQLCT) is obtained, whose calculation complexity for different signals is similar to FFT. In addition, the paper presents the relationship between the convolution and correlation in LCT domains, and the convolution and correlation can be calculated via product theorem in Fourier transform domain using FFT.

关于两类超复数矩阵的若干性质

借助2×2复矩阵表示,探讨复四元数和复分裂四元数这两类超复数矩阵的基本性质,给出了一种求复四元数矩阵和复分裂四元数矩阵行列式的方法,并研究了复四元数和复分裂四元数的一些特殊矩阵.

四元数调制重叠变换及其在双彩色图像数字水印中的应用

为了整体处理彩色图像,基于四元数彩色图像表示方法和四元数代数理论,定义了四元数调制重叠变换(MQLT),将传统的主要针对灰度图像的复数调制重叠变换(MCLT)推广应用于彩色图像处理中.然后,通过建立MQLT系数与彩色图像三通道传统MCLT系数之间的关系,分析了MQLT系数的对称特性,并基于MQLT变换及其系数对称特性,结合Arnold变换和冗余嵌入策略,提出了一种鲁棒的双彩色图像盲水印算法.为了避免水印能量损失,修改系数嵌入水印时遵循了系数的对称性.所提算法充分利用了四维频域空间,将有意义的彩色水印嵌入到彩色载体图像中.实验结果表明,所提算法在不可见性和鲁棒性2个方面均明显优于采用传统三通道分别处理思想的MCLT算法.

基于复数矩不变性的遥感边缘信息提取

通过引入四元数的方法,对多光谱遥感影像进行整体统一的处理,经过求解影像的色彩中心值来完成影像的分割,从而达到对影像进行边缘提取,以及自动提取出影像中面状特征的目的。本文主要提取面状水域,试验结果表明,该方法能对多光谱遥感影像中的水域提取效果相较传统做法有很大的提高。

基于四元数的坐标旋转与插值方法研究

介绍四元数的基本数学性质与运算规则,详细阐述坐标旋转中基于四元数的转矢法,及其3种插值方法,与欧拉角法进行对比分析。讨论转矢法的各种插值算法对坐标转换的影响,并从计算机实现角度分析各种算法在时间复杂度方面的区别,通过实验仿真得出结论。

四元数方程AXA^H=B厄米特解中的复矩阵极秩

通过四元数矩阵的复表示X=X0+X1j和矩阵秩的许多性质,确定出四元数矩阵方程AXAH=B厄米特解集{X}的复表示矩阵集{X0}和{X1}的最大秩、最小秩公式.作为这些极秩公式的应用,探讨了四元数厄米特矩阵广义逆的一些性质,得出任意一个四元数厄米特矩阵M的广义逆中存在纯复矩阵、广义逆全部为纯复矩阵、广义逆中存在纯非复矩阵、广义逆全部为纯非复矩阵这4种情形的充要条件.

四元数矩阵的对角化及其算法

四元数矩阵的对角化在四元数力学等四元数应用学科的理论研究和数值计算中起到重要的作用。 本文通过引入友向量的方法,进一步研究了四元数矩阵的对角化问题,构造性地给出了四元数矩 阵对角化的实用算法。

四元数代数的复线性表示

定义并完全决定了广义四元数代数的复线性表示。利用这一结果,给出了两个广义四元数代数同构的一个充分必要条件。

基于四元同质微分的彩色光流估计

该文通过将颜色3维矢量表示为一个4元数(quaternion)形式的超复数,将彩色图像序列映射为3维时-空空间上定义的4元超复变函数,并以颜色常数模型假设为基础,建立了描述彩色图像序列中运动模式的4元光流方程。为了对超复数4元光流方程中的运动参数进行有效估计,定义了4元同质微分的概念,进而得到了基于4元同质颜色常数模型的光流方程,并给出了该光流方程的优化求解方法。最后,与已有算法的对比实验验证了该文方法的有效性。

四元数的一种新的代数结构

在四元数力学的数学方法研究中，首次引入了友向量的概念，借助四元数的复表示方法，进一步研究了四元数力学中的系列数值计算问题，给出了相应问题的简单计算和论证方法，建立起了一套四元数力学的简单数学方法．

四元数矩阵方程的复转化及保结构算法

给出四元数矩阵复表示运算定义及其相关性质,并运用复表示运算的保结构特性,讨论了四元数矩阵Moore-Penrose逆计算以及两类四元数矩阵方程AXB=C和AX-XB=C的数值求解方法.数值算例检验了所给算法的可行性.

实四元数矩阵的Bushell-Trustrum不等式及其改进

本文证明了两个四元数自共轭半正定矩阵乘积方幂的一些不等式,推广、改进了Bushell和Trustrum关于Hermitian矩阵的相应结果。