基于QR 分解的彩色图像自嵌入全盲水印算法

针对彩色图像的版权保护问题,基于QR 矩阵分解提出了一种自嵌入全盲水印算 法。先将原始图像的G 通道分量进行非下采样剪切波变换,再对得到的低频分量分块QR 分解, 通过判断各子块R 矩阵中第一行元素向量的l1 范数与所有子块R 矩阵第一行元素l1 范数均值之 间的大小关系生成特征水印。然后对B 通道分量DWT 变换后的低频分量进行分块QR 分解, 并通过修改该子块QR 分解后R 矩阵中第一行最后一列元素来嵌入特征水印。特征水印的生成 和嵌入在两个通道内独立完成,水印检测无需原始载体图像,算法无需借助外加水印信息即可 完成对图像版权的鉴别。实验结果表明,该算法在经历添加噪声、JPEG 压缩、缩放、剪切和行 偏移等常见攻击时,具有很强的鲁棒性。     

基于QR分解的方阵特征多项式数值算法

借鉴QR分解的概念,探讨如何利用QR分解法求一个方阵的特征多项式的数值算法。这就为用Matlab编程求解矩阵的特征多项式提供了条件。通过对三个不同类型矩阵的实例计算验证了该数值方法能够较好地求解一般方阵的特征多项式,比用通常的求带变量的行列式的方法和基于迹的算法要相对简单些,特别是对于高阶矩阵,其优势更加明显,且易在计算机上用Matlab编程实现,从而说明了该算法具有较高的实用价值。     

基于离散小波变换的QR二维条码防伪技术

基于数字水印的快速响应矩阵（QR）二维条码防伪技术的水印容量低、防伪效果差。为解决该问题,提出QR码二值图像Rand灰度化和背景图灰度化方法,以提高防伪水印容量。QR码二值图像灰度化的程度由灰度化阈值决定,并且可以根据实际应用需要灵活确定。在此基础上,设计基于离散小波变换的QR二维条码防伪水印方案,通过量化函数实现水印的嵌入和检测,利用混沌密钥生成的二维混沌序列控制水印嵌入和检测的位置。实验结果表明,该方案在确保条码信息可识别的条件下,提高了QR码防伪水印的性能。     

用于EVS的改进小波变换图像融合算法

为增强小波变换图像融合算法的实时性,提高视觉增强系统(EVS)可见光图像与红外图像实时融合的效率,提出了一种基于矩阵QR分解和小波变换的图像融合算法.该算法对原始图像的像素矩阵进行QR分解,再利用正交矩阵的性质,根据小波变换图像融合算法对QR分解得到的上三角矩阵进行分解融合,利用QR分解得到的正交矩阵逆变换得到融合图像.实验结果表明,该算法能获得较好的实时性,同时保证较好的融合效果.     

二元域上三次和四次剩余码的幂等生成元

有限域上高次剩余码的生成多项式都是多项式[xn-1]的因式。针对多项式[xn-1]在有限域上分解的困难性,给出了二元域[F2]上三次和四次剩余码的幂等生成元表达式。利用计算机软件求解该幂等生成元与[xn-1]最大公因式就可得到三次和四次剩余码生成多项式而不用分解[xn-1]。     

一种不完全信息下递推辨识方法及收敛性分析

针对信号在网络环境下传输带来不完全信息使得在线参数辨识算法和收敛性困难的问题, 不同于传统递推最小二乘方法, 本文提出了一种不完全信息下递推辨识方法并分析其收敛性. 首先运用伯努利分布刻画引起不完全信息的数据丢包特性, 然后基于辅助模型方法补偿不完全信息并构造了新的数据信息矩阵, 并运用矩阵正交变换性质对数据信息矩阵进行QR分解, 推导了融合网络参数的递推辨识新算法, 理论证明了在不完全信息下递推参数辨识算法的收敛性. 最后仿真结果验证了所提方法的可行性和有效性.     

基于IQRD-RLS的自适应均衡算法在DS-SS系统的应用研究

提出一种基于逆QR分解的RLS自适应算法(IQRD-RLS),该算法能有效降低计算复杂度、改善矩阵条件数,具有比基于相关矩阵的最小二乘算法有更好的数值稳定性。通过用Matlab仿真结果表明,逆QR分解方法避免了RLS问题的不准确求解问题,并且很容易随时检查变换信息矩阵的正定性。     

基于QR分解的扩展监督局部保留映射

针对局部保留映射(LPP)算法不能提供数据集的差异信息问题,提出一种基于QR分解的扩展有监督LPP算法。该方法对训练数据矩阵进行QR分解,采用有监督的LPP算法进行降维,利用类别信息对降维后的数据进行Fisher线性判别式分析,得到最终的映射矩阵以提高判别性能。实验结果表明,该方法较主成分分析法和LPP方法有更好的判别性能。     

深度非负矩阵分解的链路预测方法研究

链路预测是根据现有的网络结构信息预测潜在的边,其已成为复杂网络中的热点之一。在链路预测中,传统非负矩阵分解直接将原始网络映射到隐空间中,不能充分挖掘复杂网络的深层隐结构信息,导致在稀疏网络中预测能力有限。针对以上问题,提出一种基于深度非负矩阵分解的链路预测方法（Deep Non-negative Matrix Factorization,DNMF）。通过对系数矩阵多次分解,得到一组基矩阵和一个系数矩阵相乘,进而构建深度隐特征模型的目标函数。采用两阶段法去调整训练参数,即在预训练阶段通过逐层分解作为预分解结果,在微调阶段整体微调训练参数。根据微调训练后的基矩阵和系数矩阵,计算网络相似矩阵。该方法可以在保证真实网络的深层隐结构信息表达的同时使其可以获得更加全面的网络结构信息。通过对10个典型实际网络进行实验,表明该方法比现有经典链路预测方法具有更好的预测性能。     

基于聚类信息和对称非负矩阵分解的链路预测模型研究

现有的大部分基于非负矩阵分解的链路预测方法仅考虑网络拓扑结构信息而忽略节点与链接聚类信息.针对此问题,提出一个融合聚类信息的对称非负矩阵分解的链路预测模型.首先,该模型利用对称非负矩阵分解去捕获网络节点相似度信息;其次,使用基于Jaccard的节点和链接聚类系数去保持网络局部结构信息;最后,启用拉格朗日乘法规则去学习模型参数.在六个真实无向无权和四个加权网络上的实验结果表明,该方法在两种不同类型网络预测精确度分别提升了1.6％和8.9％.     

A new watermarking scheme for colour image using QR decomposition and ternary coding

At present, the binary images are often used as the original watermark images of many watermarking methods, but partial methods cannot be easily extended to colour image watermarking methods. For resolving this problem, we propose a new watermarking method using ternary coding and QR decomposition for colour image. In the procedure of embedding watermark, the colour image watermark is coded to ternary information; the colour host image is also separated into image blocks of sized 3?×?3, and these image blocks are further decomposed via QR decomposition; then, one ternary watermark is embedded into one orthogonal matrix Q of QR decomposition by the proposed rules. In the procedure of extracting watermark, the proposed method uses the blind-manner to extract the embedded ternary information. The novelty of this scheme lies in the proposed ternary coding for watermark image, which can improve the imperceptibility, embedded watermark capacity and real-time feature of the watermarking scheme. The results of simulation show the presented technique is better than other compared schemes with respect to imperceptibility, embedded watermark capacity and real-time feature under the similar robustness.

     

高精度曲面建模与实时空间模拟

为了弥补地理信息系统不能进行实时动态模拟的缺陷,通过QR矩阵分解,将高精度曲面建模HASM4的矩阵表达转换为求解系数矩阵为上三角矩阵和下三角矩阵的两个方程组。在此基础上,实时空间模拟问题被抽象为动态加点问题和动态减点问题,建立了适用于实时模拟的HASM5。数值实验结果表明,HASM5的加点模拟只需要对新采样点形成的矩阵进行矩阵分解;而HASM5的减点模拟只需要取原有矩阵的子矩阵计算即可。     

含仿射不确定参数的多项式非线性系统控制器设计

针对含仿射时变不确定参数的多项式非线性系统，提出了基于多项式分解的控制方法. 多项式分解方法主要思想是将多项式系统转化成带自由变量的系数矩阵，从而偶次多项式的非负性验证问题可转化成线性矩阵不等式或双线性矩阵不等式求解问题. 文中多项式系统控制器综合基于 Lyapunov 稳定定理. 构造 Lyapunov 函数以及寻找反馈控制器可由所给的算法通过计算机程序自动完成. 对于多维系统相对高阶的控制器，由多项式全基构造的控制器将有很多项单项式. 为克服这一问题，文中算法给出含最少单项式的简约型控制器设计方法，并提出针对最小代价性能目标优化的增益受约次优控制. 数值仿真例子表明，文中所给的控制方法取得良好性能.     

含仿射不确定参数的多项式非线性系统控制器设计

针对含仿射时变不确定参数的多项式非线性系统，提出了基于多项式分解的控制方法. 多项式分解方法主要思想是将多项式系统转化成带自由变量的系数矩阵，从而偶次多项式的非负性验证问题可转化成线性矩阵不等式或双线性矩阵不等式求解问题. 文中多项式系统控制器综合基于 Lyapunov 稳定定理. 构造 Lyapunov 函数以及寻找反馈控制器可由所给的算法通过计算机程序自动完成. 对于多维系统相对高阶的控制器，由多项式全基构造的控制器将有很多项单项式. 为克服这一问题，文中算法给出含最少单项式的简约型控制器设计方法，并提出针对最小代价性能目标优化的增益受约次优控制. 数值仿真例子表明，文中所给的控制方法取得良好性能.     

A two-level QR code scheme based on polynomial secret sharing

Quick Response codes (QR codes) are common two-dimensional machine readable codes used extensively in all walks of life due to their high reading speeds, high data density, and strong error correction capabilities. However, public encoding using QR codes poses a threat to information security. In this paper, we introduce a Two-Level QR code that protects private data by using the recognition patterns of QR codes and by use of polynomial secret sharing algorithms. On a public level, QR codes are decodable by any standard QR reader. For secure use, QR codes simultaneously store private information, allowing transmission of secret information via an open channel. Experimental results and analysis demonstrate that this proposed approach is both feasible and reasonable. It reduces the probability of attracting the attention of potential attackers. The secret image format can accommodate either binary or grayscale. In addition, the data capacity of the secret payload of this approach is much higher than other methods.

     

A blind double color image watermarking algorithm based on QR decomposition

In this paper, a novel blind image watermarking scheme based on QR decomposition is proposed to embed color watermark image into color host image, which is significantly different from using the binary or gray image as watermark. When embedding watermark, the 24-bits color host image with size of 512?×?512 is divided into non-overlapping 4?×?4 pixel blocks and each pixel block is decomposed by QR. Then, according to the watermark information and the relation between the second row first column coefficient and the third row first column coefficient in the unitary matrix Q, the 24-bits color watermark image with size of 32?×?32 is embedded into the color host image. In addition, the new element compensatory method is used in the upper-triangle matrix R for reducing the visible distortion. When extracting watermark, only the watermarked image is needed. Compared with other SVD-based methods, the proposed method does not have the false-positive detection problem and has lower computational complexity, that is, the average running time of the proposed method only needs 1.481403 s. The experimental results show that the proposed method is robust against most common attacks including JPEG compression, JPEG 2000 compression, low-pass filtering, cropping, adding noise, blurring, rotation, scaling and sharpening et al. Compared with some related existing methods, the proposed algorithm has stronger robustness and better invisibility.     

QR code–based ECG signal encryption/decryption algorithm

The paper presents a novel and enhanced bio-signal (ECG) cryptographic technique in which a QR code has been successfully utilized as a data container. The bio-signal encryption process considers ECG samples in the form of integers in order to create corresponding binary pair sequences that are converted as equivalent ciphertext information. Subsequently, the generated ciphertexts are transformed into QR code by using a QR code generator/reader in order to ensure further security. The encryption process generates a binary key for each binary pair that will be used during signal decryption. The imperceptibility of a reconstructed ECG signal is evaluated by analyzing performance metrics in terms of PSNR and PRD values. The average PSNR values are found to be above 42?dB, whereas PRD values observed were less than 3.43 percent. It is further proved that the proposed technique can encrypt a maximum of 226?kb of diagnose data by using merely seven QR codes.