A new electro-optic modulated circular heterodyne interferometer for measuring the rotation angle in a chiral medium

A new optical polarimeter capable of measuring the rotation angle in a chiral medium is developed successfully, and is an extension of previously developed simultaneous or sequential measurement system of the principal axis and retardance in linearly birefringent materials. The polarimeter for measuring the rotation angle is based on an electro-optic modulated circular heterodyne interferometer and using phase-lock technique to measure the rotation angle directly and precisely. The validity of the proposed design is demonstrated by the measurement of rotation angle in a half-wave plate and the glucose sample. The average relative error in rotation angle level of 0.00284° has been obtained for a half-wave plate. A correlation coefficient value of 0.9999975 is determined; it indicates a highly linear relationship between the reference values and the measured rotation angles. Moreover, a standard deviation in rotation angle level of 0.005275° has been obtained for glucose solutions with concentrations ranging from 0 to 1.2 g/dl in 0.2 g/dl increments, with a correlation coefficient value of 0.99915 between the reference and the measured values. This setup is compact in configuration, and is easy in calibration. The linearity and resolution characteristics of this system are comparable to those previous studies adopting phase-sensitive techniques.     

Template matching of mixed quantum states

We consider the problem of optimal classification of an unknown input mixed quantum state with respect to a set of predefined patterns C_i, each represented by a known mixed quantum template . The performance of the matching strategy is addressed within a Bayesian formulation where the cost function, as suggested by the theory of monotone distances between quantum states, is chosen to be the fidelity or the relative entropy between the input and the templates. We investigate various examples of quantum template matching for the case of a finite number of copies of a two-level input state and for a generic, group covariant, set of two-level template states.     

Performance evaluation of maximal separation techniques in immunohistochemical scoring of tissue images

This paper presents an automatic scoring method for p53 immunostained tissue images of oral cancer that consist of tissue image segmentation, splitting of clustered nuclei, feature extraction and classification. The tissue images are segmented using entropy thresholding technique in which the optimum threshold value to each color component is obtained by maximizing the global entropy of its gray-level co-occurrence matrix and clustered cells are separated by selectively applying marker-controlled watershed transform. Cell nuclei feature is extracted by maximal separation technique (MS) based on blue component of tissue image and subsequently, each cell is classified into one of four categories using multi-level thresholding. Finally, IHC score of tissue images have been determined using Allred method. A statistical analysis is performed between immuno-score of manual and automatic method, and compared with the scores that have obtained using other MS techniques. According to the performance evaluation, IHC score based on blue component that has high correlation coefficients (CC) of 0.95, low mean difference (MD) of 0.15, and a very close range of 95% confidence interval with manual scores. Therefore, automatic scoring method presented in this paper has high potential to help the pathologist in IHC scoring of tissue images.     

A coarse-to-fine kernel matching approach for mean-shift based visual tracking

Mean shift is an efficient pattern match algorithm. It is widely used in visual tracking fields since it need not perform whole search in the image space. It employs gradient optimization method to reduce the time of feature matching and realize rapid object localization, and uses Bhattacharyya coefficient as the similarity measure between object template and candidate template. This thesis presents a mean shift algorithm based on coarse-to-fine search for the best kernel matching. This paper researches for object tracking with large motion area based on mean shift. To realize efficient tracking of such an object, we present a kernel matching method from coarseness to fine. If the motion areas of the object between two frames are very large and they are not overlapped in image space, then the traditional mean shift method can only obtain local optimal value by iterative computing in the old object window area, so the real tracking position cannot be obtained and the object tracking will be disabled. Our proposed algorithm can efficiently use a similarity measure function to realize the rough location of motion object, then use mean shift method to obtain the accurate local optimal value by iterative computing, which successfully realizes object tracking with large motion. Experimental results show its good performance in accuracy and speed when compared with background-weighted histogram algorithm in the literature.     

蚁群算法在近红外光谱定量分析中的应用研究

蚁群算法是新近发展的基于群体智能的仿生优化算法,它模拟蚂蚁的觅食行为来解决复杂的组合优化问题。蚁群算法的优点是智能搜索、全局优化、鲁棒性、分布式计算和容易与其他算法相结合等。近红外光谱定量分析技术在很多领域得到广泛的应用,而其关键技术环节之一是建立近红外光谱测量数据的多元校正模型。文章将蚁群算法应用于近红外光谱定量分析中,建立了谷物样品的傅里叶变换近红外漫反射光谱和谷物中蛋白质含量的定量分析模型,得到了较好的结果。校准集的相关系数与相对标准偏差分别为0.943和3.41％,预测集的相关系数与相对标准偏差分别为0.913和4.67%。     

Fault Diagnosis of a Wind Turbine Gearbox Based on Improved Variational Mode Algorithm and Information Entropy

The working environment of wind turbine gearboxes is complex, complicating the effective monitoring of their running state. In this paper, a new gearbox fault diagnosis method based on improved variational mode decomposition (IVMD), combined with time-shift multi-scale sample entropy (TSMSE) and a sparrow search algorithm-based support vector machine (SSA-SVM), is proposed. Firstly, a novel algorithm, IVMD, is presented for solving the problem where VMD parameters (K and α) need to be selected in advance, which mainly contains two steps: the maximum kurtosis index is employed to preliminarily determine a series of local optimal decomposition parameters (K and α), then from the local parameters, the global optimum parameters are selected based on the minimum energy loss coefficient (ELC). After decomposition by IVMD, the raw signal is divided into K intrinsic mode functions (IMFs), the optimal IMF(s) with abundant fault information is (are) chosen based on the minimum envelopment entropy criterion. Secondly, the time-shift technique is introduced to information entropy, the time-shift multi-scale sample entropy algorithm is applied for the analysis of the complexity of the chosen optimal IMF and extract fault feature vectors. Finally, the sparrow search algorithm, which takes the classification error rate of SVM as the fitness function, is used to adaptively optimize the SVM parameters. Next, the extracted TSMSEs are input into the SSA-SVM model as the feature vector to identify the gear signal types under different conditions. The simulation and experimental results confirm that the proposed method is feasible and superior in gearbox fault diagnosis when compared with other methods.     

基于遗传算法参数优化的PCNN红外图像分割

构造一种基于遗传算法参数优化的脉冲耦合神经网络(PCNN)红外图像分割算法。该算法首先利用PCNN的全局耦合性和脉冲同步性对输入图像进行点火处理,根据PCNN的输出结果计算熵作为遗传算法的适应度函数,并利用熵的变化量作为遗传算法的收敛依据,对PCNN模型中影响图像分割的参数进行组合优化,结合PCNN生物视觉特性和遗传算法解空间随机搜索能力来寻找关键参数的最优值。将遗传算法和PCNN进行结合可充分发挥二者优势,将本文方法与最大类间方差法(OTSU)、最大熵直方图分割算法和PCNN分割方法进行对比,通过交叉熵、区域对比度等客观指标对分割后的图像进行定量分析,结果表明无论从主观视觉还是客观指标,本文方法分割效果优于其他对比方法。     

基于量子并行粒子群优化算法的分数阶混沌系统参数估计

分数阶混沌系统参数估计的本质是多维参数优化问题, 其对于实现分数阶混沌控制与同步至关重要. 提出一种基于量子并行特性的粒子群优化新算法, 用于解决分数阶混沌的系统参数估计问题. 利用量子计算的并行特性, 设计出了一种新的量子编码, 使每代运算的可计算次数呈指数增加. 在此基础上, 构建了由量子当前旋转角、个体最优旋转角和全局最优旋转角共同组成的粒子演化方程, 以约束粒子在量子空间中的运动行为, 使算法的搜索能力得到了较大提高. 以分数阶Lorenz混沌系统和分数阶Chen混沌系统的参数估计为例, 进行了未知参数估计的数值仿真, 结果显示本算法具有良好的有效性、鲁棒性和通用性.     

电子稳像的分层位平面全局运动估计算法

提出一种分层位平面匹配的快速全局运动估计算法.算法充分利用多分辨率思想,在每一层选用不同位平面进行匹配以找到运动矢量|利用层内块运动的空间相关性和层间矢量传递性,来自适应地选择搜索起始点|同时设定阈值,对运动矢量满足准确度的子块,直接结束搜索|将所得到的各子块的运动矢量作为集合,根据其统计规律,找到出现概率最大的样本作为正确的全局运动矢量.实验表明,该算法计算速度快,且与块匹配全搜索相比,其误差小于半个像素,能够达到快速准确进行全局运动估计的能力.     

电子稳像的分层位平面全局运动估计算法

提出一种分层位平面匹配的快速全局运动估计算法.算法充分利用多分辨率思想,在每一层选用不同位平面进行匹配以找到运动矢量;利用层内块运动的空间相关性和层间矢量传递性,来自适应地选择搜索起始点;同时设定阈值,对运动矢量满足准确度的子块,直接结束搜索;将所得到的各子块的运动矢量作为集合,根据其统计规律,找到出现概率最大的样本作为正确的全局运动矢量.实验表明,该算法计算速度快,且与块匹配全搜索相比,其误差小于半个像素,能够达到快速准确进行全局运动估计的能力.     

基于灰度相关的图像匹配算法的改进

针对目前图像匹配算法中存在的匹配精度不高和匹配速度慢的缺点，对基于灰度相关的2类匹配算法——最小误差法和相关系数法进行了改进。最小误差法采用新的ML距离法，提出动态调整阈值的方法，既保证了匹配精度，又避免了局部噪声的影响；相关系数法对相关系数的计算公式进行了简化，并采用三步搜索策略进行匹配，以达到减少计算量和搜索位置的目的。实验证明：改进后的算法，在保证一定匹配精度的条件下，匹配速度大大提高，能够满足实际应用中的实时性要求。     

一类含Mathieu-Duffing振子的相对转动系统的分岔和混沌

建立了一类具有Mathieu-Duffing振子的两质量相对转动系统的非线性动力学方程. 应用多尺度法求解该系统发生主共振-基本参数共振的分岔响应方程,并通过奇异性分析得到系统稳态响应的转迁集. 利用Melnikov方法讨论系统在外激扰动和参激扰动变化下的全局分岔和系统进入混沌状态的可能途径,得到外激和参激幅值变化下系统可能出现多次通向混沌的道路,获得系统发生混沌的必要条件. 最后采用数值方法验证了理论研究的有效性. 关键词： 相对转动 Mathieu-Duffing振子 混沌 Melnikov方法     

粒子群和GMM-SDR模型在重叠谱峰解析中的应用

针对X光谱分析研究中经常遇到的谱峰重叠问题,提出了一种基于标准差关联的高斯混合模型(GMM-SDR)和粒子群算法的重叠谱峰解析方法。首先,介绍了重叠峰的GMM-SDR模型,并以GMM-SDR参数构成粒子位置,给出了粒子目标函数及适应度值的快速算法;然后,利用粒子群算法的群体搜索能力,以搜索最优GMM-SDR模型,进而实现重叠峰的分解。初始值采用随机设定,将测量的所有随机数据作为一个整体,以其对模型的概率匹配程度作为适应度值,故该方法避免了初值设定不当带来的局部收敛问题,克服了传统曲线拟合方法对原始有用数据的破坏,所搜索到的模型是一个全局最优解。通过对四个及以下重叠谱峰的分解表明,该方法分解精度较高,其中,两峰重叠谱分解后的峰位、峰面积及标准差最大相对误差分别为0.4%,0.05%和2.07%,三峰重叠谱分解后的峰位、峰面积及标准差最大相对误差分别为1.2%,0.04%和0.74%,可适用于各种严重重叠谱峰的分解。     

Brownian dynamics simulation of electrostatically interacting proteins

Brownian dynamics simulation software has been developed to study the dynamics of proteins as a whole in solution. The proteins were modelled as spheres with point dipoles embedded in the centre of sphere. A set of Brownian dynamics simulations at different values of the dipole moments, protein concentration and translational diffusion coefficient was performed to investigate the influence of interprotein electrostatic interactions on dynamic protein behaviour in solution. It was shown that these interactions led to the slowing down of protein rotation and a complex non-exponential shape of the rotational correlation function. Analysis of the correlation functions was performed within the frame of the model of electrostatic interprotein interactions advanced earlier on the basis of NMR and dielectric spectroscopy data. This model assumes that, due to electrostatic interactions, protein Brownian rotation becomes anisotropic. The lifetime of this anisotropy is controlled mainly by translational diffusion of proteins. Thus, the correlation function can be decomposed into two components corresponding to anisotropic Brownian rotation and an isotropic motion of an external electric field vector produced by the surrounding proteins.     

一种基于非基因信息的免疫记忆优化算法

为提高人工免疫优化算法的优化能力, 将非基因信息的记忆机制引入智能算法, 提出了一种基于非基因信息的免疫记忆优化算法. 算法通过对先验知识(非基因信息)的短期记忆并指导后续进化, 降低盲目搜索和重复搜索, 增加了搜索的智能性和有效性. 结合标准测试函数在高维下的仿真实验表明, 与其他智能算法相比, 新算法在收敛速度、收敛精度和全局收敛性方面均优于对比算法. 此外, 在超高维下的仿真结果表明新算法具有在大规模维度解空间中的全局寻优能力.     

基于赋权连接图的增量式运动恢复结构算法北大核心CSCD

运动恢复结构算法(structure from motion, SfM)是一种通过计算图像匹配关系,恢复出相机位姿和目标三维结构的重建算法。提出一种基于赋权视角连接图的增量式运动恢复结构算法。首先建立基于图像对立体匹配质量的赋权连接图,量化了图像两两之间的匹配关系;其次在赋权连接图中边的权重的基础上,搜索度数感知的最佳初始种子对;最后根据已重建顶点的连通性构建下一张最佳图像候选集,设计了基于顶点度数与特征点分布的下一张最佳图像评价算法。在公开数据集上实验结果显示,本文算法在重建质量、相机校准率和点云生成数量的表现优于现有先进的运动恢复结构算法,相比基准对比算法,本文算法在不同数据集上平均重建耗时至少降低了19%,点云生成速率至少提升了21%。     

基于边缘几何特征和频域相关技术的图像匹配方法

提出了一种基于图像特征提取和变换域相关的图像匹配方法。借助提取图像的大边缘信息，以其几何特征构造边缘方向角曲线作为图像匹配的依据。通过对差分的计算，并比较两幅图像边缘方向曲线的相对链码，得到2幅图像之间可能的旋转角度。对旋转矫正后的图像进行2维傅里叶变换，计算频域内2图的相位相关矩阵，并从中找到相关系数最大的位置，这个位置就代表了2图的坐标位移量，通过平移达到图像间的精确匹配。实验表明：该方法匹配准确，速度快，减少了人为因素的干扰，对于图像间存在较小灰度差和噪声情况均有很好的匹配效果。     

基于大脑情感学习模型和自适应遗传算法的混沌时间序列预测

针对传统神经网络预测精度不高、收敛速度慢的问题,提出一种基于大脑情感学习模型和自适应遗传算法的混沌时间序列预测方法.大脑情感学习模型模拟了哺乳动物大脑中杏仁体和眶额皮质之间的情感学习机制,具有计算复杂度低、运算速度快的特点,因此可以大大提高混沌预测的快速性.为了进一步提高大脑情感学习模型的预测精度,采用自适应遗传算法优化其参数,将待优化的权值与阈值分布在染色体基因序列上,用适应度函数选出最佳参数,从而增强了模型的逼近能力.基于Lorenz混沌时间序列和实际地磁Dst指数序列的预测结果表明,本文方法较其他传统方法在预测精度、运算速度和稳定性上均具有明显优势.     

A new implementation of the molecular replacement method using a six-dimensional Patterson vector search

The current molecular replacement programs are primarily implemented in reciprocal space. In this paper a new implementation in direct (real) space is proposed by matching the model atomic vectors with the vectors in the Patterson vector space using a six-dimensional exhaustive search method. It is shown that this implementation can find the correct rotations and translations of alpha helices in a myoglobin crystal structure using experimental diffraction data at 2 A resolution. A comparison with previous Patterson vector search methods is discussed.