一种面向深空测距的大多普勒频偏信号捕获算法

在深空测距任务中,高精度的伪码捕获是后续执行伪码跟踪的关键前提.传统基于时频二维搜索的频偏估计算法对于深空测距中频率偏移范围较大的情况难以满足伪码捕获实时性要求.为此,提出了改进的时频二维搜索算法,通过在传统时频二维搜索算法的前端引入快速傅里叶变换(Fast Fourier Transform,FFT)算法对多普勒频偏...     

OFDM系统中的二维差分解调算法

文章首先介绍了64-DAPSK OFDM系统的基本原理，然后利用高斯近似推导了简化的幅度和相位软判决度量，紧接着详细阐述了二维差分解调算法的思路和最优路径选择准则以及一种新的搜索算法，最后通过仿真表明，该算法在合理的复杂度下可以获得一定的性能增益。     

基于二维粒子群优化的图像模糊增强算法研究*

针对传统基于灰度变换方法进行图像增强后图像质量不高等现象,对粒子群优化算法、模糊增强算法进行研究,同时结合禁忌搜素和粒子空间对称分布原理,提出一种基于二维粒子群优化的图像模糊增强算法。该算法通过对搜索粒子进行空间对称分布调整以避免算法陷入局部最优、提高全局搜索能力,并且在算法迭代后期加入禁忌搜索算法记录粒子搜索位置,以减少粒子位置重复寻优、提高算法搜索效率。最后将改进后的粒子群优化算法中粒子搜索位置和速度更新方向设定为二维并与模糊增强算法相结合,自适应搜索出模糊参数Fp、Fe最优值,实现模糊增强。实验结果表明,改进后算法对图像增强效果较好,并且将算法用于过暗SAR图像、医学MR图像的增强,可有效提高图像质量。     

二维谱估计算法的空间探测性能分析及验证

针对二维谱估计算法的空间探测性能分析的需求,从计算速度、计算量、顽健性、计算精度以及实际工程应用的角度出发,对基于L型阵列的二维MUSIC、二维干涉仪、二维增广矩阵束的谱估计算法进行了简要介绍,并对上述二维谱估计算法的性能进行了仿真分析,得到了3种算法的角度RMSE的对比分析,可知在同样仿真条件下,二维增广矩阵束算法最优,二维MUSIC算法次之,二维干涉算法最差。同时,构建了相应的试验场景,通过试验分析上述二维谱估计算法的空间探测性能,得到的试验结论与仿真结论一致。在此基础上,提出了二维增广矩阵束算法可扩展应用到雷达测控一体化系统的思路。     

基于后退式索引的动态树形防碰撞算法

标签防碰撞技术是RFID系统中的关键技术,二进制搜索算法和动态二进制搜索算法是两个典型的防碰撞算法。文章在动态二进制搜索算法的基础上提出了一种新的防碰撞算法,通过对新算法的分析,可知本算法相对于动态二进制搜索算法有明显的优势。     

基于改进核范数的2DPCA人脸识别算法研究

传统的二维主成分分析法广泛应用于图像特征提取,为了使此算法更加有效,提出了一种结构化二维算法,即核范数2DPCA算法(N-2-DPCA).该算法基于核范数重构误差准则,将核范数最优化问题转化为基于F范数的最优化问题,然后通过采用迭代方法寻找到最佳投影矩阵,最后运用最小欧氏距离规则识别出待识别人脸的身份.在此基础之上,将N-2-DPCA扩展到基于双边投影的算法(N-B2-DPCA),采用曲线搜索算法寻找到双边投影矩阵,继而进行识别.最后将提出的算法在FERET和Yale B人脸数据库中进行人脸识别评估,实验结果表明所提出的算法与L1-2DPCA相比,重建误差降低了2.19％,识别率提高了2.03％,性能更好.     

基于双平行线阵的相干分布源二维DOA估计

针对现有相干分布源二维波达方向(DOA)估计算法存在的一些问题,基于双平行均匀线阵提出了一种相干分布源二维DOA估计新算法。利用旋转不变的思想并结合传播算子法来估计相干分布源的二维中心DOA。无需谱搜索和对样本协方差矩阵做特征分解,和传统算法相比,其计算复杂度更低。此外,还给出了详细的参数配对过程,因而能够应用于多源场合。算法在小角度扩展条件下估计性能良好,其性能甚至接近于一维交替搜索算法。算法还是一种对角分布先验知识盲的估计。仿真结果证实了算法的有效性。     

基于二维投影点集的三维模型检索算法研究

本文给出一种基于二维投影点集的三维模型检索算法.该算法利用二维投影点集边界点,给出一种结合夹角信息的二维投影轮廓特征提取算法,简单有效地刻画三维模型外围轮廓;同时还利用二维投影点集内部点,给出一种剖面特征提取算法,反映三维模型空域信息.实验结果表明该算法在保证检索效率的同时,显著提高三维模型的检索准确性.     

基于数据插值的二维MUSIC谱峰搜索算法

针对MUSIC算法在进行二维到达角估计时运算量大、估计速度较慢的问题,对基于数据插值二维MUSIC谱峰搜索算法进行研究。在MUSIC算法的基础上先用较大步长在二维空间进行粗略搜索,之后在粗搜谱峰位置附近的小区间内进行二维插值,最后用小步长在该区间内进行谱峰搜索,得到精确的角度估计值。仿真实验表明,该算法可有效地减少二维空间搜索的运算量。     

基于分形理论的改进型二维最大熵红外图像分割算法

提出了一种基于分形理论的改进型二维最大熵红外图像阈值分割算法。该算法利用图像分形维数挖掘像素的空间分布信息,然后将原图像灰度及其分形维数映射图像灰度相结合组成二维随机向量,并构造出联合离散概率分布。在此基础上,以二维最大熵原则来确定一个最佳二维分割阈值,进而取得分割结果。实验结果表明,该算法在分割效果上优于传统的二维最大熵分割算法。     

An Improved Grasshopper Optimization Algorithm for Global Optimization

We proposes an improved grasshopper algorithm for global optimization problems. Grasshopper optimization algorithm (GOA) is a recently proposed meta-heuristic algorithm inspired by the swarming behav-ior of grasshoppers. The original GOA has some drawbacks, such as slow convergence speed, easily falling into local optimum, and so on. To overcome these shortcomings, we proposes a grasshopper optimization algorithm based on a logistic Chaos maps opposition-based learning strategy and cloud model inertia weight (CCGOA). CCGOA is divided into three stages. The chaos opposition learning initialization strategy is used to initialize the population, so that the population can be evenly distributed in the feasible solution space as much as possible, so as to improve the uniformity and diversity of the initial population distribution of the grasshopper algorithm. The inertia weight cloud model is introduced into the grasshopper algorithm, and different inertia weight strategies are used to adjust the convergence speed of the algorithm. Based on the principle of chaotic logistic maps, local depth search is carried out to reduce the probability of falling into local optimum. Fourteen benchmark functions and an engineering example are used for simulation verification. Experimental results show that the proposed CCGOA algorithm has superior performance in determining the optimal solution of the test function problem.     

On an inviable approach for derivation of 2-D stability tests

A tabular stability test for two-dimensional (2-D) discrete systems that was published in these Transaction is shown to be not correct. It is also shown that the claimed new method that it introduced to extend stability conditions from one-dimensional (1-D) to 2-D systems relies on a mathematically inviable argument. The paper tries to find a similar but correct algorithm and stability conditions. The outcome of the search after a stability test with similar algorithm is a variant of the Maria-Fahmy 2-D stability test for which a more concise set of necessary and sufficient conditions for stability are obtained. The search after stability conditions of similar appearance that can be posed on the correct algorithm, yields new necessary conditions for 2-D stability that resemble stability conditions associated with the "reflection coefficient" parameters in the 1-D Schur test.     

Source localization in a waveguide using polynomial rooting

Source localization in acoustic waveguides involves a multidimensional search procedure. We propose a new algorithm in which the search in the depth direction is replaced by polynomial rooting. Using the proposed algorithm, range and depth estimation by a vertical array requires a 1-D search procedure. For a 3-D localization problem (i.e., range, depth, and direction-of-arrival (DOA) estimation), the algorithm involves a 2-D search procedure. Consequently, the proposed algorithm requires significantly less computation than other methods that are based on a brute-force search procedure over the source location parameters. In order to evaluate the performance of the algorithm, an error analysis is carried out, and Monte-Carlo simulations are performed. The results are compared with the Cramer-Rao bound (CRB) and to the maximum likelihood (ML) simulation performance. The algorithm is shown to be efficient, while being computationally simpler than the ML or the Bartlett processors. The disadvantage of the algorithm is that its SNR threshold occurs in lower SNR than in the ML algorithm     

Efficient 2-D DOA and frequency estimation for L-shaped array via RD-PM

This paper addresses the issue of joint two-dimensional direction of arrival (2-D DOA) and frequency estimation via reduced-dimensional propagator method (RD-PM) with L-shaped array. The proposed algorithm has no need for eigenvalue decomposition of the sample covariance matrix and simplifies three-dimensional global spectral search within the three-dimensional propagator method (3-D PM) to one-dimensional local search, which greatly reduces computational complexity. Furthermore, the proposed algorithm can work under both uniform and non-uniform L-shaped array and can achieve paired 2-D DOA and frequency estimates automatically. In addition, the 2-D DOA and frequency estimation performance for the proposed method is approximate 3-D PM algorithm and parallel factor (PARAFAC) method but exceeds the estimating signal parameters via rotational invariance techniques (ESPRIT) algorithm and improved PM algorithm. The detailed derivation of Cram´er-Rao bound (CRB) is provided and the simulation results demonstrate the effectiveness and superiority of the proposed approach.     

互相关矩阵重排获取信号子空间的二维DOA估计算法

本文提出一种L型阵列的二维子空间DOA估计算法,该算法通过重排阵列接收数据的互相关矩阵获取信号子空间,然后根据信号子空间生成一个二维谱函数,最后通过二维搜索估计信号的来波方向。由于该算法采用二维谱峰搜索,所以不需要对俯仰角和方位角进行配对。与二维MUSIC算法相比,该算法的估计精度略有下降,但该算法不需要对矩阵做特征值分解,计算量降低且易于实现。文中给出了该算法的推导过程和具体实现步骤,并进行了实验仿真,仿真结果说明了算法的有效性。      

基于改进麻雀算法的最大2维熵分割方法

为了提高最大2维熵分割的性能,提出了基于改进麻雀算法的最大2维熵分割方法,可减小运算量并且缩短计算时间.首先,融合反向学习策略和自适应t分布变异,引入精英粒子,以扩大算法搜索范围,增加算法后期局部搜索能力;其次,使用萤火虫机制,对最优解进行扰动变异,进一步增加种群多样性;最后,采用提出的改进麻雀算法寻找图像最大2维熵,...     

适用任意阵列的变换域二维波达角快速估计算法

 MUSIC(Multiple Signal Classification)算法是波达角(the Direction of Arrival,DOA)估计的经典算法之一,但其在二维DOA估计中因需进行二维谱峰搜索而计算量十分巨大.为降低MUSIC算法的计算量,本文在引入变换域DOA概念的基础上提出了一种能够适用于任意阵列结构的二维DOA快速估计算法,即变换域MUSIC(transformed domain-MUSIC,TD-MUSIC)算法.理论分析和仿真实验表明:该算法不但将空间谱峰搜索的范围减小一半而且具有更低维度的噪声子空间,因而其计算量远小于 MUSIC算法.同时,新算法具有比MUSIC更高的空间分辨率.     

一种基于改进遗传算法的只测向无源定位技术

从单站序贯测向无源定位的误差分析出发,提出了基于遗传算法的最大似然只测向(Bearing-Only)定位方法,并以最小二乘法进行粗估计,对遗传算法采用了一维编码改进。实验表明,该方法既提高了算法的精度,又解决了二维定位中遗传算法搜索空间过大的问题,提高了算法的实用性。     

时-空二维信号模型下的目标参数估计

提出一种基于时空二维信号模型下相干信号源参数估计的LS-ESPRIT算法,解决了常规ESPRIT算法不能解相干等问题。和解相干的MUSIC算法相比,该方法不需要在整个空间进行谱峰搜索,运算量小。仿真结果表明,该方法适用于所有信号(包括非相干和相干信号)的目标二维参数与多普勒频率估计。在不同信噪比(SNR)情况下,其估计精度较常规方法有了较大的提高,可以满足工程应用的需要。     

一种快速递归红外舰船图像分割新算法

针对背景复杂、对比度低的红外舰船目标分割问题,提出了一种红外舰船图像分割的新算法.由于二维最大类间方差法不仅反映了图像的像素点灰度分布信息,还反映了邻域空间相关信息,因此有较好的抗噪能力.但是由于其解空间维数的增加,计算量的变化是以指数增长的,而粒子群优化算法可实现高效并行、随机、自适应群体搜索.基于这一特点,提出了基于粒子群优化的二维最大类间方差局部递归分割方法,有利于实现红外图像的实时处理.该方法同样适用于复杂背景下的其他红外目标图像的分割.