基于分数阶傅里叶变换的模式测控一体化方法

提出了一种基于分数阶傅里叶变换的模式测控一体化方法。利用分数阶傅里叶变换光路对光纤模式耦合态进行空间调制和相位调制,以实现模式的有效分解。与双重傅里叶变换（F2）法以及空间和频谱成像（S2）法相比,采用的分数阶傅里叶变换法,通过改变分数阶参数,控制模式的空间分布以及模式间的叠加状态,更易于分解出高阶模式。基于分数阶傅里叶变换的模式测量方法可在更广泛空间,研究模式的空间和相位叠加以及模式分解,也可退化为F2法和S2法。     

分数阶傅里叶变换结合高峰均比抑制算法对CO-OFDM系统的影响分析

针对相干光正交频分复用系统中出现的高峰值平均功率比问题,提出分数阶傅里叶变换与高峰值平均功率比抑制算法相结合的方法.计算表明:随着分数阶傅里叶变换阶数的减小,信号的峰值平均功率比逐渐降低;与抑制算法结合后可进一步降低系统的峰值平均功率比,并解决抑制算法影响系统性能的问题.从结合的兼容性、抑制高峰值平均功率比效果及改善引入抑制算法后对系统的负面影响三方面进行仿真分析,结果表明:采用选择性映射算法与分数阶傅里叶变换结合后,旋转因子同为4时,峰值平均功率比高于6.6dB的概率较单一选择性映射算法低104;选取高峰值平均功率比抑制情况相近时,结合算法的时间复杂度比单一选择性映射算法降低了8倍;采用限幅算法与分数阶傅里叶变换结合的仿真情况也较单一限幅算法有很大提高,表明该算法结合的兼容性良好.     

基于全光时域分数阶傅里叶变换的光脉冲最小损伤传输新方法

提出了一种基于全光分数阶傅里叶变换(optical fractional fourier transformation,OFRFT)的关于色散和自相位调制对光脉冲传输影响的分析方法,并基于该方法给出了一种新的光脉冲在光纤中传输最小损伤的方法,通过在发射端将输入的高斯光脉冲做OFRFT然后再送入到光纤中去传输,可以提高光脉冲抵抗色散和非线性的能力,仿真发现当色散占主要作用的时候,负阶数的分数阶傅里叶变换可以很大程度上减小光脉冲的展宽;当自相位调制作用占主要的时候,正阶数的分数阶傅里叶变换可以消除自相位调制作 关键词： 光脉冲传输 分数阶傅里叶变换 色散 自相位调制     

简明分数阶傅里叶变换及其对线性调频信号的检测和参数估计

针对低信噪比下线性调频信号的检测问题,提出了一种简明分数阶傅里叶变换方法。该变换借助chirp相乘和傅里叶变换对时频平面上的频率轴进行旋转,以获取信号在各个角度下频率轴上的频谱分布。对时频分布呈直线状的线性调频信号,简明分数阶傅里叶变换能在特定角度上将信号能量聚集成尖锐的强能量峰,从而提高信噪比,实现对线性调频信号的可靠检测和参数估计。数值仿真和实验验证结果表明,简明分数阶傅里叶变换可对较低信噪比的线性调频信号实现有效检测,并由变换域峰值的位置对信号参数进行准确估计。相比于传统的分数阶傅里叶变换方法,简明分数阶傅里叶变换的复杂度更低,离散计算效率更高,在对噪声掩盖下的线性调频信号进行检测和参数估计时能更好地满足实时处理的要求。     

基于矢量线阵的目标低频线谱提取方法

主动声呐系统常采用线性调频信号探测水下目标。利用分数阶傅里叶变换处理线性调频回波时,可在低信噪比和强混响背景下获得目标参数的有效估计。主动声呐系统常通过增大发射信号的时间带宽积来提升系统的距离分辨力和速度分辨力,但却带来了计算复杂度的显著增加,尤其是奈奎斯特采样下基于分数阶傅里叶变换的回波处理方法,导致数据处理时间难以满足功耗和体积受限的无人水下航行器平台的实时性要求。针对此问题,该文提出分数阶傅里叶变换的带通采样实现方法,通过对线性调频信号时频特性直线在分数阶域的投影进行修正,使利用分数阶傅里叶变换方法处理带通采样的回波数据时,可获得正确的目标参数估计。计算机仿真数据和无人水下航行器湖试数据处理结果验证了分数阶傅里叶变换的带通采样实现方法的正确性,数据处理时间能够满足无人水下航行器平台处理的实时性要求。     

水下目标几何声散射回波在分数阶傅里叶变换域中的特性

水下目标散射回波在时域、频域混叠在一起, 而且受声波入射角度的影响严重, 在不同的入射角度下表现出很大的差异, 需要建立全方位入射角度下回波分量的理论分析模型. 本文推导了目标几何声散射分量在分数阶傅里叶变换域中随入射角度变化的解析表达式; 确定了目标几何声散射回波分量在最佳分数阶傅里叶变换域中的全方位模型, 从理论上证明了目标回波的几何特征形式; 给出了离散分数阶傅里叶变换对声散射分量的分辨能力和计算精度与发射信号带宽和观测时间之间的关系. 实验数据处理表明, 建立的分数阶傅里叶变换域的全方位模型与目标几何特征是一致的, 对未知入射角度下的目标识别提供了理论依据.     

机动目标逆合成孔径激光雷达成像算法

针对逆合成孔径激光雷达对机动目标成像时,其回波信号存在距离向色散和方位向多普勒时变的问题,在建立机动目标精确回波信号模型的基础上,提出一种基于积分立方次相位函数-分数阶傅里叶变换的成像算法.在距离压缩时,首先采用积分立方次相位函数快速估计出回波脉冲的调频率,进而在最佳旋转角下采用分数阶傅里叶变换实现距离像压缩,消除距离色散.经过运动补偿后,在方位压缩时结合积分立方次相位函数-分数阶傅里叶变换与Clean技术实现对每一距离单元上强弱散射点的分离成像,解决由于机动运动产生的方位多普勒时变而形成的图像散焦问题.最后,通过散射点模型的仿真实验,验证了所提方法的有效性.     

简明分数阶傅里叶变换及其对线性调频信号的检测和参数估计

针对低信噪比下线性调频信号的检测问题,提出了一种简明分数阶傅里叶变换方法。该变换借助chirp相乘和傅里叶变换对时频平面上的频率轴进行旋转,以获取信号在各个角度下频率轴上的频谱分布。对时频分布呈直线状的线性调频信号,简明分数阶傅里叶变换能在特定角度上将信号能量聚集成尖锐的强能量峰,从而提高信噪比,实现对线性调频信号的可靠检测和参数估计。数值仿真和实验验证结果表明,简明分数阶傅里叶变换可对较低信噪比的线性调频信号实现有效检测,并由变换域峰值的位置对信号参数进行准确估计。相比于传统的分数阶傅里叶变换方法,简明分数阶傅里叶变换的复杂度更低,离散计算效率更高,在对噪声掩盖下的线性调频信号进行检测和参数估计时能更好地满足实时处理的要求。      

水下连续波有源探测的回波检测算法

研究线性调频连续波在水下探测中的信号模型、回波信号的检测和目标参数估计方法,通过分析回波信号与发射信号间的差拍信号,提出差拍-分数阶傅里叶变换结构的处理算法。为了减少分数阶傅里叶变换二维搜索时的计算量,首先使用Radon-Ambiguity变换估计差拍信号的调频斜率,再做相应阶次的分数阶傅里叶变换。数值仿真说明提出的算法能够有效消除线性调频连续波的距离-速度耦合现象,准确估计目标参数。通过湖上试验比较线性调频脉冲信号和线性调频连续波的处理增益,提出的算法处理的连续波比匹配滤波方法处理的脉冲信号处理增益大13 dB。研究结果表明该算法在连续波水下探测中可行有效,不仅能够准确估计目标参数,还具有良好的检测性能。      

浅海双基地有源探测调频信号直达波消除

双基地有源探测常采用长脉宽探测信号以获取更高的时间增益,容易导致回波弱信号被强直达波信号掩蔽而影响回波检测.针对长调频信号直达波的干扰,提出基于分数阶傅里叶变换(FrFT)的直达波消除方法.该方法利用调频信号在时频分布上的稀疏性,通过对接收信号进行分数阶傅里叶变换分离直达波和回波信号然后在变换域对直达波信号进行去除.远...     

Geometrically robust image watermarking using scale-invariant feature transform and Zernike moments

In order to resist geometric attacks, a robust image watermarking algorithm is proposed using scaleinvariant feature transform (SIFT) and Zernike moments. As SIFT features are invariant to rotation and scaling, we employ SIFT to extract feature points. Then circular patches are generated using the most robust points. An invariant watermark is generated from each circular patch based on Zernike moments.The watermark is embedded into multiple patches for resisting locally cropping attacks. Experimental results show that the proposed scheme is robust to both geometric attacks and signal processing attacks.     

抗JPEG压缩和几何攻击的鲁棒零水印算法

针对数字图像传输时经常面临JPEG压缩和几何攻击,提出一种抗JPEG压缩和几何攻击的鲁棒零水印算法.将原始图像分割成互不重叠的子块,对每个子块进行奇异值分解,对奇异值矩阵进行harr小波变换,通过比较相邻两个子块奇异值矩阵小波低频逼近子带对角线元素的均值大小关系产生零水印序列.数学理论分析表明:通过比较相邻两个子块奇异值矩阵所有奇异值的均值大小关系产生零水印序列,算法实质上没有对原始图像做任何改动,具有非常好的不可见性.实验结果表明,该算法在抵抗JPEG压缩和旋转、尺寸缩放、随机删除行列、偏移行列、打印-扫描几种几何攻击表现出比较强的鲁棒性.     

A robust watermarking algorithm based on salient image features

A feature-based robust watermarking algorithm against geometric attacks is proposed in this paper. It is well-known that geometric attacks such as rotation, scaling, and translation on a watermarked image will destroy the synchronization between the processes of watermark embedding and detection. In other words, the locations for embedding the watermark are lost due to geometric attacks, which results in the failure of watermark detection. Since salient features in an image are relatively stable under geometric attacks, they may serve as reference points to synchronize the embedding and detection processes and the detection rate of the watermark could be increased significantly. Another problem for feature-based watermarking is that the repeatability of feature detection tends to be low; that is, the features detected during the embedding process may not be detected again during the detection process. To overcome such a problem, a novel feature enhancement technique is developed to increase the repeatability rate of feature detection, in which image moments are used to achieve geometric invariance between the embedding and detection processes. Experimental results demonstrate that the proposed watermarking algorithm is able to survive various geometric attacks and common image processing operations. And the visual quality of the watermarked image is well preserved as well.     

对一类超混沌图像加密算法的密码分析与改进

对一种超混沌图像加密算法及其改进版进行了安全性分析, 结果表明该类算法的置乱过程都是与混淆过程相脱离的, 且混淆过程的加密公式简单; 因此都不能抵抗选择明文和选择密文攻击. 进而提出了一种改进的加强型超混沌图像加密算法; 改进算法包含两轮像素值替代加密操作, 并使得密文与明文、密钥之间的关系更复杂. 安全性分析和实验测试表明, 改进算法不仅克服了原算法不能抵御选择明文和选择密文攻击的缺陷; 而且具有时间开销更小和抗差分攻击性能更好的优势.     

Block based embedding of encrypted watermarks using singular value decomposition

Watermarking is a solution to the problem of copyright protection of multimedia documents over the Internet. This paper presents a block based watermarking scheme using the singular value decomposition (SVD) algorithm to embed encrypted watermarks into digital images. The paper compares between the traditional method of Liu and the proposed method for embedding encrypted watermarks. Also, a permutation based encryption algorithm and a diffusion based encryption algorithm are compared as the watermark encryption algorithms. Experimental results show that the proposed method is superior to the traditional method of Liu for embedding encrypted watermarks and extracting them efficiently under attacks. Results also show that it is preferred to use permutation based encryption algorithms than diffusion based encryption algorithms for watermark encryption due to their lower sensitivity to attacks.     

基于混沌的自嵌入安全水印算法

利用混沌系统的伪随机性和初值敏感性，提出一种基于混沌的自嵌入安全水印算法.该算法以混沌初值为密钥生成混沌序列，根据混沌序列的索引有序序列随机生成图像块的水印嵌入位置.与现有的自嵌入算法相比，该算法实现了水印嵌入位置的随机选取，有效扩大了算法的密钥空间，且解决了自嵌入水印算法如何准确定位篡改块的问题.理论分析和仿真结果表明，该算法不仅提高了自嵌入水印算法的篡改定位的能力，而且进一步增强了算法抵抗向量量化攻击和同步伪造攻击的能力. 关键词： 数字水印 混沌 脆弱水印 自嵌入     

Multivariable Heuristic Approach to Intrusion Detection in Network Environments

The Internet is an inseparable part of our contemporary lives. This means that protection against threats and attacks is crucial for major companies and for individual users. There is a demand for the ongoing development of methods for ensuring security in cyberspace. A crucial cybersecurity solution is intrusion detection systems, which detect attacks in network environments and responds appropriately. This article presents a new multivariable heuristic intrusion detection algorithm based on different types of flags and values of entropy. The data is shared by organisations to help increase the effectiveness of intrusion detection. The authors also propose default values for parameters of a heuristic algorithm and values regarding detection thresholds. This solution has been implemented in a well-known, open-source system and verified with a series of tests. Additionally, the authors investigated how updating the variables affects the intrusion detection process. The results confirmed the effectiveness of the proposed approach and heuristic algorithm.     

Single decision reporting for cooperative spectrum sensing under erroneous feedback channels with Byzantine attack

Spectrum sensing based on a single user suffers from low detection performance due to fading, shadowing, and hidden node problems. Cooperative spectrum sensing (CSS) is thought to be a potential method to overcome these issues and improve detection performance in determining the available spectrum in cognitive radio (CR). However, CSS suffers in case of erroneous reporting channels, and it is also susceptible to Byzantine attacks by malicious users (MUs). In this paper, we first analyze the traditional CSS under erroneous feedback channels. And then, we extend the analysis to include erroneous reporting channels in the presence of the Byzantine attack. We propose a single decision reporting (SD-R) algorithm immune to erroneous reporting channels. The proposed algorithm also improves the performance under the Byzantine attack. With the proposed algorithm, MUs can attempt only false alarm attacks, whereas the miss detection attack is not possible. An extensive analysis is carried out, and the plots are shown to prove the superiority of the proposed algorithm.     

Robustness analysis of network controllability

Structural controllability, which is an interesting property of complex networks, attracts many researchers from various fields. The maximum matching algorithm was recently applied to explore the minimum number of driver nodes, where control signals are injected, for controlling the whole network. Here we study the controllability of directed Erdös–Rényi and scale-free networks under attacks and cascading failures. Results show that degree-based attacks are more efficient than random attacks on network structural controllability. Cascade failures also do great harm to network controllability even if they are triggered by a local node failure.     

Image encryption using eight dimensional chaotic cat map

In recent years, a large number of discrete chaotic cryptographic algorithms have been proposed. However, most of them encounter some problems such as lack of robustness and security. In this paper, we introduce a new image encryption algorithm based on eight-dimensional (nonlinear) chaotic cat map. Encryption of image is different from that of texts due to some intrinsic features of image such as bulk data capacity and high redundancy, which are generally difficult to handle by traditional methods. In traditional methods the key space is small and the security is weak. The proposed algorithm tries to address these problems and also tries to enhance the encryption speed. In this paper an eight dimensional chaotic cat map is used to encrypt the intensity values of pixels using lookup table method thereby significantly increasing the speed and security of encryption. The proposed algorithm is found to be resistive against chosen/known-plaintext attacks, statistical and differential attacks.