Under the scenario of dense targets in clutter, a multi-layer optimal data correlation algorithm is proposed. This algorithm eliminates a large number of false location points from the assignment process by rough corr...Under the scenario of dense targets in clutter, a multi-layer optimal data correlation algorithm is proposed. This algorithm eliminates a large number of false location points from the assignment process by rough correlations before we calculate the correlation cost, so it avoids the operations for the target state estimate and the calculation of the correlation cost for the false correlation sets. In the meantime, with the elimination of these points in the rough correlation, the disturbance from the false correlations in the assignment process is decreased, so the data correlation accuracy is improved correspondingly. Complexity analyses of the new multi-layer optimal algorithm and the traditional optimal assignment algorithm are given. Simulation results show that the new algorithm is feasible and effective.展开更多
In this paper, we use the global search characteristics of genetic algorithms to help search the weight space of the neurons in the cascade-correlation architecture. The cascade-correlation learning architecture is a ...In this paper, we use the global search characteristics of genetic algorithms to help search the weight space of the neurons in the cascade-correlation architecture. The cascade-correlation learning architecture is a technique of training and building neural networks that starts with a simple network of neurons and adds additional neurons as they are needed to suit a particular problem. In our approach, instead ofmodifying the genetic algorithm to account for convergence problems, we search the weight-space using the genetic algorithm and then apply the gradient technique of Quickprop to optimize the weights. This hybrid algorithm which is a combination of genetic algorithms and cascade-correlation is applied to the two spirals problem. We also use our algorithm in the prediction of the cyclic oxidation resistance of Ni- and Co-base superalloys.展开更多
The calculation of correlation dimension is a key problem of the fractals. The standard algorithm requires O（N2） computations. The previous improvement methods endeavor to sequentially reduce redundant computation o...The calculation of correlation dimension is a key problem of the fractals. The standard algorithm requires O（N2） computations. The previous improvement methods endeavor to sequentially reduce redundant computation on condition that there are many different dimensional phase spaces, whose application area and performance improvement degree are limited. This paper presents two fast parallel algorithms： O （N^2/p ＋ logp） time p processors PRAM algo- rithm and O（N^2/p） time p processors LARPBS algorithm. Analysis and results of numeric computation indicate that the speedup of parallel algorithms relative to sequence algorithms is efficient. Compared with the PRAM algorithm, The LARPBS algorithm is practical, optimally scalable and cost optimal.展开更多
基金This project was supported by the National Natural Science Foundation of China (60672139, 60672140)the Excellent Ph.D. Paper Author Foundation of China (200237)the Natural Science Foundation of Shandong (2005ZX01).
文摘Under the scenario of dense targets in clutter, a multi-layer optimal data correlation algorithm is proposed. This algorithm eliminates a large number of false location points from the assignment process by rough correlations before we calculate the correlation cost, so it avoids the operations for the target state estimate and the calculation of the correlation cost for the false correlation sets. In the meantime, with the elimination of these points in the rough correlation, the disturbance from the false correlations in the assignment process is decreased, so the data correlation accuracy is improved correspondingly. Complexity analyses of the new multi-layer optimal algorithm and the traditional optimal assignment algorithm are given. Simulation results show that the new algorithm is feasible and effective.
文摘In this paper, we use the global search characteristics of genetic algorithms to help search the weight space of the neurons in the cascade-correlation architecture. The cascade-correlation learning architecture is a technique of training and building neural networks that starts with a simple network of neurons and adds additional neurons as they are needed to suit a particular problem. In our approach, instead ofmodifying the genetic algorithm to account for convergence problems, we search the weight-space using the genetic algorithm and then apply the gradient technique of Quickprop to optimize the weights. This hybrid algorithm which is a combination of genetic algorithms and cascade-correlation is applied to the two spirals problem. We also use our algorithm in the prediction of the cyclic oxidation resistance of Ni- and Co-base superalloys.
基金This project was supported by the National Natural Science Foundation of China(60273075) .
文摘The calculation of correlation dimension is a key problem of the fractals. The standard algorithm requires O（N2） computations. The previous improvement methods endeavor to sequentially reduce redundant computation on condition that there are many different dimensional phase spaces, whose application area and performance improvement degree are limited. This paper presents two fast parallel algorithms： O （N^2/p ＋ logp） time p processors PRAM algo- rithm and O（N^2/p） time p processors LARPBS algorithm. Analysis and results of numeric computation indicate that the speedup of parallel algorithms relative to sequence algorithms is efficient. Compared with the PRAM algorithm, The LARPBS algorithm is practical, optimally scalable and cost optimal.
文摘数字图像后处理流程带来的非唯一性人造(Non-Unique Artifacts,NUAs)噪声掺杂在具有唯一性、稳定性的光响应非均质性(Photo-Response Non-Uniformity,PRNU)指纹中,极大地影响了下游成像设备溯源任务的精确性。然而,现有NUAs抑制方案主要针对实验环境,不仅需要额外的超参数设定,而且需额外的算力和存储空间,难以在开放环境中实际应用。为解决该问题,提出了一种面向开放环境的PRNU指纹提纯算法。首先,对现有PRNU指纹相关性度量指标即峰值相关能量比(Peak-to-Correlation Energy Ratio,PCE)进行改进,提出了基于归一化的PCE_norm和PCE_denuas,以实现开放环境下的自适应相关性度量。然后,通过构建对比学习机制缩小同一指纹和放大不同指纹的距离,实现NUAs离线抑制,从而在溯源任务中不需额外计算和存储成本进行在线抑制。最后,通过在Dresden和Daxing数据集上的实验证明了所提算法的有效性和鲁棒性。
