A robust method for detecting nuclear materials when the underlying model is inexact

This paper is concerned with the detection and identification of nuclides from weak and poorly resolved gamma-ray energy spectra when the underlying model is not known exactly. The algorithm proposed and tested here pairs an exciting and relatively new model selection algorithm with the method of total least squares. Gamma-ray counts are modeled as Poisson processes where the average part is taken to be the model and the difference between the observed gamma-ray counts and the model is considered random noise. Physics provides a template for the model, but we add uncertainty to this template to simulate real life conditions. Unlike most model selection algorithms whose utilities are demonstrated asymptotically, our method emphasizes selection when data is fixed and finite (after all, detector data is undoubtedly finite). Simulation examples provided here demonstrate the proposed algorithm performs well.     

基于小波域马尔可夫随机场模型的压缩传感图像重构

目前在压缩传感重构算法中利用图像的可稀疏性表示先验知识,从比奈奎斯特采样少得多的观测值中恢复原始图像。除了稀疏性之外,邻域系数的相关性也可以作为先验知识加速重构算法收敛。为了克服目前算法中没有利用邻域系数相关性的缺点,提出了基于小波域马尔可夫随机场模型的压缩传感图像重构算法,根据显著性度量对变换系数进行分类得到具有马尔可夫性的初始掩模,利用ICM算法完成掩模优化,实现系数更新,并将算法与未考虑邻域相关性的算法进行了比较。实验结果证明了算法的有效性。     

量子势阱粒子群优化算法的改进研究

为提高量子势阱粒子群优化算法的优化能力, 通过分析目前量子势阱粒子群优化算法的设计过程, 提出了改进的量子势阱粒子群优化算法. 首先, 分别基于Delta势阱、谐振子和方势阱 提出了改进的量子势阱粒子群优化算法, 并提出了基于统计量均值的控制参数设计方法. 然后, 在势阱中心的设计方面, 为强调全局最优粒子的指导作用, 提出了基于自身最优粒子加权平均和动态随机变量的两种设计策略. 实验结果表明, 三种势阱粒子群优化算法性能比较接近, 都优于原算法, 且Delta势阱模型略优于其他两种.     

有限离散剪切波域的红外可见光图像融合

针对目前图像融合过程中的不足之处,结合有限离散剪切波具有高的方向敏感性和抛物尺度化特性,提出了一种有限离散剪切波变换下的图像融合算法。首先对严格配准的多传感器图像进行有限离散剪切波变换,得到低频子带系数和不同尺度不同方向的高频子带系数;然后对低频子带系数采用全局特征值和像素点之间的差异性与区域空间频率匹配度相结合的融合算法,高频方向子带系数采用方向权重对比度与相对区域平均梯度和相对区域方差相结合的方案;最后通过有限离散剪切波逆变换得到融合图像。实验结果表明,与其他的融合算法相比较,本文算法不但有良好的主观视觉效果,而且3幅图像的客观评价指标分别平均提高了0.9%、3.8%、3.1%,2.6%、3.8%、2.9%和1.5%、125%、59%,充分说明了本文融合算法的优越性。     

A New Two-Stage Algorithm for Solving Optimization Problems

Optimization seeks to find inputs for an objective function that result in a maximum or minimum. Optimization methods are divided into exact and approximate (algorithms). Several optimization algorithms imitate natural phenomena, laws of physics, and behavior of living organisms. Optimization based on algorithms is the challenge that underlies machine learning, from logistic regression to training neural networks for artificial intelligence. In this paper, a new algorithm called two-stage optimization (TSO) is proposed. The TSO algorithm updates population members in two steps at each iteration. For this purpose, a group of good population members is selected and then two members of this group are randomly used to update the position of each of them. This update is based on the first selected good member at the first stage, and on the second selected good member at the second stage. We describe the stages of the TSO algorithm and model them mathematically. Performance of the TSO algorithm is evaluated for twenty-three standard objective functions. In order to compare the optimization results of the TSO algorithm, eight other competing algorithms are considered, including genetic, gravitational search, grey wolf, marine predators, particle swarm, teaching-learning-based, tunicate swarm, and whale approaches. The numerical results show that the new algorithm is superior and more competitive in solving optimization problems when compared with other algorithms.     

等离子体发射和吸收系数的轴对称重建

在激光聚变靶丸等离子体诊断中,为了同时重建出等离子体发射系数和吸收系数的空间分布,建立了分层结构成像模型,利用LM（Levenberg-Marquardt）非线性最小二乘优化算法,提出了基于该模型的重建算法。数值模拟结果表明,该算法成功地重建出发射系数和吸收系数,而且重建精度高,明显优于不考虑吸收衰减影响的Abel逆变换重建结果。对于连续分布,当噪声标准差为0.01时,发射系数与吸收系数重建误差分别为0.17,0.22。     

基于信息理论的γ能谱辨识新方法

提出了一种基于相对熵的放射源γ能谱识别方法。首先,利用主成分分析(PCA)算法压缩数据,构造γ射线能谱的特征空间。然后,采用随机化技术(RT)来使特征空间中γ射线能谱的特征值归一化,这样,γ射线能谱的特征空间可以看作是概率空间。最后,定义两个概率空间的相对熵来测量两个γ射线能谱的相对差异。大量实验表明,所提方法能够更加有效地辨识γ射线能谱, 不仅计算量小,而且对诸如统计浮动、谱峰偏移、底噪等因素具有很高的鲁棒性。     

Lasso算法的油砂钠元素近红外建模

以油砂中钠元素为研究对象,首次应用近红外光谱,结合Lasso(least absolute shrinkage and selection operator)建模方法,建立了油砂金属钠含量的近红外光谱定量校正模型,并与传统的PLS建模方法进行比较。结果表明,两种方法建立的油砂金属钠含量校正模型都具有很高的精度,预测性能方面略有差异。在实验验证集与预测集中,PLS与Lasso算法的相关系数分别是：R_v=0.878 8,R_p=0.857 9和R_v=0.887 4,R_p=0.860 0。实验验证了使用近红外光谱快速测定油砂金属钠含量的有效性,并分析了PLS与Lasso算法的适用范围。     

Group sparse Lasso for cognitive network sensing robust to model uncertainties and outliers

To account for variations in the frequency, time, and space dimensions, dynamic re-use of licensed bands under the cognitive radio (CR) paradigm calls for innovative network-level sensing algorithms for multi-dimensional spectrum opportunity awareness. Toward this direction, the present paper develops a collaborative scheme whereby CRs cooperate to localize active primary user (PU) transmitters and reconstruct a power spectral density (PSD) map portraying the spatial distribution of power across the monitored area per frequency band and channel coherence interval. The sensing scheme is based on a parsimonious model that accounts for two forms of sparsity: one due to the narrow-band nature of transmit-PSDs compared to the large portion of spectrum that a CR can sense, and another one emerging when adopting a spatial grid of candidate PU locations. Capitalizing on this dual sparsity, an estimator of the model coefficients is obtained based on the group sparse least-absolute-shrinkage-and-selection operator (GS-Lasso). A novel reduced-complexity GS-Lasso solver is developed by resorting to the alternating direction method of multipliers (ADMoM). Robust versions of this GS-Lasso estimator are also introduced using a GS total least-squares (TLS) approach to cope with both uncertainty in the regression matrices, arising due to inaccurate channel estimation and grid-mismatch effects, and unexpected model outliers. In spite of the non-convexity of the GS-TLS criterion, the novel robust algorithm has guaranteed convergence to (at least) a local optimum. The analytical findings are corroborated by numerical tests.     

A nonlinear controller for three-dimensional tracking of a fluorescent particle in a confocal microscope

We describe an algorithm for using a confocal microscope for tracking single fluorescent particles diffusing in three dimensions. The algorithm uses a standard confocal setup and directly translates each fluorescence measurement into an actuator command. Through physical simulations, we illustrate 3-D tracking in both stage scanning and beam scanning confocal systems. The simulated stage scanning system achieved tracking of particles diffusing in 3-D with coefficients up to 0.2 μm²/s when the average fluorescence intensities was less than 1.84 counts per measurement cycle (corresponding to less than 18,400 counts per second) in the presence of background fluorescence with a rate of 5,000 counts per second. Increasing the fluorescence intensity to approximately 193 counts per measurement cycle (1,930,000 counts per second) allowed the system to track up to particles diffusing with coefficients as large as 0.7 μm²/s. The beam steering system allowed for faster motion of the focal volume of the microscope and successfully tracked particles diffusing with coefficients up to 0.7 μm²/s with fluorescence measurement intensities of approximately 0.189 counts per measurement cycle (37,570 counts per second) and with coefficients up to 90 μm²/s when the fluorescence intensity was increased to 19 counts per measurement cycle (3,807,500 counts/sec).     

基于Shearlet变换的自适应图像融合算法

针对多聚焦图像与多光谱和全色图像的成像特点,结合Shearlet变换具有较好的稀疏表示图像特征的性质,提出了一种新的图像融合规则.并基于此融合规则,提出了基于Shearlet变换的自适应图像融合算法.在多聚焦图像的融合算法中,分别对聚焦不同的图像进行Shearlet变换,并基于本文提出的融合规则,对分解后的高低频系数进行融合处理. 通过与多种算法的比较实验证明了本文提出的算法融合的图像具有更高的清晰度和更加丰富的细节信息.在多光谱和全色图像的融合处理中,提出了一种基于Shearlet变换与HSV变换相结合的图像融合方法.该算法首先对多光谱图像作HSV变换,将得到的V分量与全色图像进行Shearlet分解与融合,在融合过程中对分解系数选用特定的融合准则进行融合,最后将融合生成新的分量与H、S分量进行HSV逆变换产生新的RGB融合图像. 该算法在空间分辨率和光谱特性两方面达到了良好的平衡,融合后的图像在减少光谱失真的同时,有效增强了空间分辨率. 仿真实验证明,本文算法融合的图像与传统的多光谱和全色图像融合算法相比,具有更佳的融合性能和视觉效果.     

两阶段复数谱卷积循环网络立体声回声消除

提出了一种两阶段复数谱卷积循环网络(CRN)的立体声回声消除(SAEC)算法,该算法无需对立体声信号进行去相关,因而能够在保证立体声音质和空间感的同时,解决自适应滤波SAEC算法非唯一解问题。所提算法采用两个阶段进行回声消除,第一阶段根据传声器接收信号和参考信号估计回声信号,第二阶段将估计回声信号作为先验信息,联合传声器接收信号作为输入特征,估计近端语音。相对于单阶段CRN算法,该方法能够提高网络对回声和近端语音的区分度,有助于近端语音的提取。另外,网络的输入特征和训练目标均采用复数谱,降低了近端语音的相位估计误差,因而可以进一步提升算法性能。实验表明,基于两阶段复数谱CRN的SAEC算法在单端讲话时的回声抑制量和双端讲话时的语音质量都明显优于传统算法以及单阶段CRN算法。      

基于改进对比度的有限离散剪切波图像融合

为了提高多聚焦图像的融合精度,结合有限离散剪切波变换(FDST)良好的局部化特性及平移不变性,提出了一种基于有限离散剪切波变换与改进对比度相结合的图像融合新算法。对经过严格配准后的多聚焦图像进行FDST分解,得到低频子带系数和不同尺度不同方向的高频子带系数;对低频子带系数采用区域平均能量匹配度自适应融合算法,高频子带系数的选取则根据低频与高频系数关联得到的对比度进行融合;应用有限离散剪切波逆变换重构得到融合图像,并对融合结果进行主观视觉和客观评价。通过仿真实验,算法在主观视觉效果上有着明显的优越性。在不同融合算法比较的融合结果中,熵值、互信息量和边缘相似度分别平均提高了1.4%、34.6%和8.0%,各项客观评价指标优于其他算法。     

A Hybridization of Dragonfly Algorithm Optimization and Angle Modulation Mechanism for 0-1 Knapsack Problems

The dragonfly algorithm (DA) is a new intelligent algorithm based on the theory of dragonfly foraging and evading predators. DA exhibits excellent performance in solving multimodal continuous functions and engineering problems. To make this algorithm work in the binary space, this paper introduces an angle modulation mechanism on DA (called AMDA) to generate bit strings, that is, to give alternative solutions to binary problems, and uses DA to optimize the coefficients of the trigonometric function. Further, to improve the algorithm stability and convergence speed, an improved AMDA, called IAMDA, is proposed by adding one more coefficient to adjust the vertical displacement of the cosine part of the original generating function. To test the performance of IAMDA and AMDA, 12 zero-one knapsack problems are considered along with 13 classic benchmark functions. Experimental results prove that IAMDA has a superior convergence speed and solution quality as compared to other algorithms.     

多无人机三维群集算法的适用性研究与改进

针对多无人机群三维空间运动的复杂群集控制问题,提出了基于生物群集行为、依据Reynolds规则描述的三维群集控制算法。已有的研究大多将无人机群集运动简化为二维平面运动,但这不符合实际控制需求。为此,将群集控制算法和人工势场算法推广到三维无人机群集控制中,建立了三维无人机群空间运动模型,通过多种不同条件下的仿真,研究了两种算法在三维群集控制中的有效性。结果显示两种算法用于三维群集控制均具有一定效果,但相对二维所需要的条件更为苛刻。同时,注意到智能算法具有更好的群体聚集效果,而人工势场算法则避碰效果更迅速明显。据此,对人工势场算法和智能算法进行了改进,通过在距离大于平衡点时采用智能算法聚集,在距离小于平衡点时采用人工势场算法避碰,得到能同时获得更好的聚集、避碰效果的新的群集控制算法。     

Using Background Knowledge from Preceding Studies for Building a Random Forest Prediction Model: A Plasmode Simulation Study

There is an increasing interest in machine learning (ML) algorithms for predicting patient outcomes, as these methods are designed to automatically discover complex data patterns. For example, the random forest (RF) algorithm is designed to identify relevant predictor variables out of a large set of candidates. In addition, researchers may also use external information for variable selection to improve model interpretability and variable selection accuracy, thereby prediction quality. However, it is unclear to which extent, if at all, RF and ML methods may benefit from external information. In this paper, we examine the usefulness of external information from prior variable selection studies that used traditional statistical modeling approaches such as the Lasso, or suboptimal methods such as univariate selection. We conducted a plasmode simulation study based on subsampling a data set from a pharmacoepidemiologic study with nearly 200,000 individuals, two binary outcomes and 1152 candidate predictor (mainly sparse binary) variables. When the scope of candidate predictors was reduced based on external knowledge RF models achieved better calibration, that is, better agreement of predictions and observed outcome rates. However, prediction quality measured by cross-entropy, AUROC or the Brier score did not improve. We recommend appraising the methodological quality of studies that serve as an external information source for future prediction model development.     

贴片电阻表面缺陷自动识别方法

提出了一种基于非下采样Contourlet变换(NSCT)域图像去噪算法.首先根据尺度间与尺度内的NSCT系数之间的相关性,用非高斯分布模型对NSCT系数与其邻域系数及父系数进行建模,给出分类准则,把系数分为重要系数和非重要系数,再采用广义高斯分布来模拟重要系数的概率分布,根据贝叶斯理论得到自适应阈值,并求出最佳参量范围.为了克服软、硬阈值函数的缺点,提出一种自适应的新阈值函数,利用新阈值函数估计出不含噪音的变换系数,并通过非下采样Contourlet逆变换得到去噪后的图像.仿真实验表明,本文方法在峰值信噪比、结构相似性与视觉效果上均优于目前许多优秀的去噪算法.     

非下采样Contourlet变换域混合统计模型图像去噪

提出了一种基于非下采样Contourlet变换(NSCT)域图像去噪算法.首先根据尺度间与尺度内的NSCT系数之间的相关性,用非高斯分布模型对NSCT系数与其邻域系数及父系数进行建模,给出分类准则,把系数分为重要系数和非重要系数,再采用广义高斯分布来模拟重要系数的概率分布,根据贝叶斯理论得到自适应阈值,并求出最佳参量范围.为了克服软、硬阈值函数的缺点,提出一种自适应的新阈值函数,利用新阈值函数估计出不含噪音的变换系数,并通过非下采样Contourlet逆变换得到去噪后的图像.仿真实验表明,本文方法在峰值信噪比、结构相似性与视觉效果上均优于目前许多优秀的去噪算法.     

Reliable Recurrence Algorithm for High-Order Krawtchouk Polynomials

Krawtchouk polynomials (KPs) and their moments are promising techniques for applications of information theory, coding theory, and signal processing. This is due to the special capabilities of KPs in feature extraction and classification processes. The main challenge in existing KPs recurrence algorithms is that of numerical errors, which occur during the computation of the coefficients in large polynomial sizes, particularly when the KP parameter (p) values deviate away from 0.5 to 0 and 1. To this end, this paper proposes a new recurrence relation in order to compute the coefficients of KPs in high orders. In particular, this paper discusses the development of a new algorithm and presents a new mathematical model for computing the initial value of the KP parameter. In addition, a new diagonal recurrence relation is introduced and used in the proposed algorithm. The diagonal recurrence algorithm was derived from the existing n direction and x direction recurrence algorithms. The diagonal and existing recurrence algorithms were subsequently exploited to compute the KP coefficients. First, the KP coefficients were computed for one partition after dividing the KP plane into four. To compute the KP coefficients in the other partitions, the symmetry relations were exploited. The performance evaluation of the proposed recurrence algorithm was determined through different comparisons which were carried out in state-of-the-art works in terms of reconstruction error, polynomial size, and computation cost. The obtained results indicate that the proposed algorithm is reliable and computes lesser coefficients when compared to the existing algorithms across wide ranges of parameter values of p and polynomial sizes N. The results also show that the improvement ratio of the computed coefficients ranges from 18.64% to 81.55% in comparison to the existing algorithms. Besides this, the proposed algorithm can generate polynomials of an order ∼8.5 times larger than those generated using state-of-the-art algorithms.     

基于二进制小波变换和改进SPIHT算法的图像编码方法

提出了一种基于二进制小波变换和改进SPIHT算法的图像编码方法.二进制小波变换将图像从实数域变换到实数域,消除像素之间的空间冗余性,得到了具有整数准确度的紧致描述.针对传统SPIHT算法解码图像视觉效果差的缺点,提出了改进方法.根据图像分析结果,将二进制小波变换变换系数按视觉重要性重新排序,通过对视觉重要系数优先编码,把量化误差集中在视觉不敏感区域,从而在不影响编码率失真性能的同时,有效地提高了解码图像的视觉效果.实验结果表明,和其它流行的编码算法相比,本文算法对不同性质的图像具有最优的编码性能和视觉效果.