Accurate and efficient algorithm for simulation of fringe projection system

Because of intrinsic drawbacks of existing algorithm for optical simulation: first, there is an accuracy problem, finite-precision machine arithmetic introduces error into line-surface intersection calculation. Second, these algorithms do not or partially consider process of shadow modeling. In this paper, we present an algorithm based on geometric analysis to simulate fringe projection system, a variable-step-iterative (VSI) algorithm is used to search line-surface intersection point, which can avoid many difficult problems. The proposed algorithm can accurately identify the shadow. Simulation results shows the reconstructed RMS errors obtained by our algorithm are far smaller than those obtained by previous reported algorithm. Simulation results validate our VSI algorithm can obtain more accurate results than many previous intersection point algorithms. Simulation results indicate our shadow modeling algorithm exceeds many existing shadow modeling algorithm, and is equivalent to shadow volumes algorithm, but our shadow algorithm runs faster than shadow volumes algorithm.     

双点干涉法位相缺陷检测中的解相算法比较

双点光源移相干涉测量是大口径光学元件位相缺陷检测的一种重要方法。为了分析双点干涉中误差对解相算法的影响,首先给出相位缺陷检测的系统结构和理论模型,在此基础上,针对测量过程中主要存在的一次移相误差、二次移相误差、光强误差和随机振动误差,研究了Hariharan 5帧移相算法、13帧移相算法和迭代随机移相算法的解相误差,并进行了仿真分析。结果表明,针对这几种误差源,13帧算法解相精度整体优于5帧法,迭代随机移相算法解相效果优于13帧法和5帧法,当这几种误差按实际指标同时作用时,迭代随机移相算法解相误差RMS小于5帧法和13帧法,PV值稳定在0.5 nm以内。由于随机振动占主要作用,说明迭代随机移相算法受误差影响很小。     

Fast and precise algorithm based on maximum radial symmetry for single molecule localization

We present an algorithm to estimate the location of single fluorescent molecule with both high speed and high precision. This algorithm is based on finding the subpixel position with maximum radial symmetry in a pixelated single molecule fluorescence image. Compared with conventional algorithms, this algorithm does not rely on point-spread-function or noise model. Through numerical simulation and experimental analysis, we found that this algorithm exhibits localization precision very close to the maximum likelihood estimator (MLE), while executes ～1000 times faster than the MLE and ～6 times faster than the fluoroBancroft algorithm.     

小快拍高分辨目标方位估计算法 GMUSIC的性能分析*

针对水下运动阵列在运动过程中进行方位估计时存在快拍不足的问题,研究了基于随机矩阵理论的MUSIC改进算法GMUSIC,该方法通过Stieltjes变换建立起统计协方差矩阵真实特征值、特征向量与样本协方差矩阵之间在逼近域中的关联,以修正样本协方差特征分解的结果,进而实现小快拍方位估计。仿真与试验表明:GMUSIC算法可以更好地分辨相邻目标,且需要的快拍数较MUSIC算法要少;在低信噪比情况下,GMUSIC算法方位估计均方根误差远小于MUSIC算法,估计成功概率远大于MUSIC算法。因此,GMUSIC算法适用于解决水声目标的小快拍方位估计问题。     

Evolutionary algorithm for optimization of multilayer coatings

In this paper, a new evolutionary algorithm, the well-known imperialist competition algorithm, is proposed for optimizing the optical thin-films. In this method, the process is modeled of the competition between countries as imperialists and their colonizing of others as colonies. This algorithm could be an appropriate alternative to some of the more popular algorithms for optimizing the optical thin-films for good performance. The polarizer and edge filter for example are designed by using the imperialist competition algorithm method and the results are compared with those from two optimization high-performance methods: the genetic algorithm and differential evolutionary algorithm. Based on these results,the performance of the imperialist competition algorithm method shows that this algorithm is not sensitive to the change of its parameters and it can be an important advantage for quickly achieving a global optimal point. On the other hand the results show a better ratio of P-polarization transmittance to S-polarization transmittance in the design of a 1540-nm polarizer, which is more appropriate than the results from the other two methods. In the second design, an edge filter with a lower number of layers and more uniform bandpass spectrum than the counterparts of those methods is obtained. These results indicate that the imperialist competition algorithm is a robust method for optical thin-film designs.     

用进化策略方法反演二维弹性波动方程的参数

从材料响应的理论合成与实际测量数据相拟合出发,将二维弹性波动方程的参数反演问题归结为非线性多峰函数的最优化问题.全局最优解的求解采用了进化策略法,并同遗传方法的反演结果进行了比较.数值结果表明,用进化策略方法进行参数反演的精度大大高于用遗传方法进行参数反演的精度,进化策略反演是一种良好的非线性反演方法.     

由傅里叶功率谱恢复物函数的研究

相位恢复工作中,针对物函数是实函数的情形,Fienup算法取得了较大的成功.本文给出一新算法,其收敛程度比Fienup算法更优.以天文学中双星情形为例,比较了两种不同算法的结果.     

一种更具普适性的浅海不确定声场快速算法

非嵌入式随机多项式展开法是目前性能最优的一种不确定声场快速算法,但配点的选择对算法计算精度影响较大,且当计算随不确定海洋环境参数变化剧烈的声场输出时,需采用分段概率配点法等特殊方法处理。基于Kriging模型提出了一种新的浅海不确定声场快速算法,首先给出了该算法的理论推导,然后通过数值计算验证了算法性能,并给出具体的物理解释,结果表明:在同等条件下,新算法的计算精度较非嵌入式随机多项式展开法更高;无需针对声场输出随不确定海洋环境参数的变化情况采取特殊处理过程;克服了非嵌入式随机多项式展开法为提高计算精度将随机多项式展开至非常高的阶数,从而增加计算量的不足;较非嵌入式随机多项式展开法,其样本点的选择简单易行,且可直接计算误差,因此,本文算法较非嵌入式随机多项式展开法普适性更强。     

基于高阶统计的水声信道盲辨识

本文给出了基于ARMA模型的水下通信系统模型,将一种基于三阶统计的算法应用到水声信道盲辨识领域,在不需要训练序列的条件下估计得到信道传输函数。与基于二阶统计特性方法相比,该算法具有较强的抗噪性,更适合信噪比低于12dB条件下水声信道的辨识。通过对水声信道盲辨识的计算机仿真,验证了该算法具有较高的辨识精度。     

基于改进HOG特征提取的车型识别算法

本文针对高速环境下的车型识别问题,提出基于方向可控滤波器的改进HOG算法。将方向可控滤波器算法与HOG算法相结合,以实现对车辆图像特征提取。采用主成分分析算法(PCA)约减特征向量维数以减少计算复杂度,利用支持向量机算法对提取特征进行样本训练,实现对车辆外型特征的识别。仿真实验结果表明:采用该算法原始车辆车型的识别正确率均值达到92.36%;另外,本文方法的识别速度比传统的HOG特征算法提高了3.45%,识别实时性得到提升。本文算法比传统HOG算法更优,能有效提高车型识别的效率。     

基于双尺度相关运算的拉曼谱峰识别方法

拉曼谱峰识别是拉曼定性分析中的关键技术之一, 针对现有拉曼谱峰识别方法中存在的缺陷和不足提出了一种双尺度相关拉曼光谱谱峰识别方法,即采用两个尺度下的相关系数与局部信噪比相结合来实现拉曼谱峰识别。利用MATLAB对所提算法与传统的连续小波变换法进行了对比分析,并通过实测拉曼光谱进行验证。分析结果：双尺度相关法识别一幅拉曼谱的平均时间为0.51 s,连续小波变换法为0.71 s;当谱峰信噪比≥6时(现代拉曼光谱仪器均可达到较高的信噪比),双尺度相关法的谱峰识别准确率高于99%,连续小波变换法的谱峰识别准确率小于84%,且双尺度相关法谱峰位置识别误差的均值与标准差均要小于连续小波变换法。通过仿真对比分析和实验验证表明：双尺度相关法具有无需人工干预,无需做去噪及去背景等预处理操作,识别速度快,识别准确率高等特点,是一种切实可行的拉曼谱峰识别方法。     

Improved phase demodulation for grain orientation measurement

The method of phase demodulation for wood grain orientation measurement has been improved by employing a laser sampling system instead of a laser scanning system and using an edge detection algorithm rather than an intensity detection algorithm. The laser sampling system is able to determine the average grain angle and estimate the wood defect distribution much faster and more accurate than the laser scanning system. The edge detection algorithm is able to transform not only an oriented laser pattern but also an oriented wood texture into a periodic histogram. For the hardwoods with weak tracheid effect but the texture direction indicative of the grain orientation, the orientation measurement of laser pattern can be replaced by the orientation measurement of wood texture.     

Adaptive optics wave function reconstruction and phase unwrapping when branch points are present

An algorithm is presented for reconstruction of adaptive optics wavefront sensor data which produces results that contain the part of the wavefront distortion associated with the hidden phase as well as the scalar phase part that is captured by an ordinary least-mean-square-error reconstructor. The algorithm uses a multigrid formulation and multiplication of complex phasors representing the measured phase differences to reconstruct the distorted wave function. The algorithm is formulated to work with Hudgin-geometry data, but in the appendix a variant of this algorithm is described that allows operation with Fried-geometry data. Also an algorithm is presented that generates a phase function from the reconstructed wave function, a phase function that has its branch cuts placed so that the 2π discontinuities of the branch cut occur where the optical intensity is much lower than the average intensity. The reconstructor algorithm is formulated as a noise-variance-weighted reconstructor. It is found that the algorithm's noise gain is only slightly greater than that of a noise-variance-weighted least-mean-square-error reconstructor so long as the noise variance for the input phase difference measurement data is less than about 0.25 rad².     

A circle similarity algorithm for an automatic circular decomposition of blood cell images

This paper presents an iterative algorithm for circular decomposition which investigates the separation of overlapped circular particles of a binary image, in order to locate their center coordinates and to estimate their radii. Since this algorithm is based on the measure of a circle similarity of an object in an image to execute a search for concavities, object segmentation and circle recognition, its implementation is simpler than the algorithm based on polygonal approximation. In this work we compare the accuracy and robustness of the proposed circle similarity algorithm with a polygonal approximation based algorithm using synthetic images and real blood cell images. Both the algorithms are able to decompose connected blood cells. However, the input parameters of the polygonal approximation method shows high sensitivity to the shape or agglomeration of an object, while the proposed algorithm demonstrates more stable performance.     

Comment on ‘An optimal algorithm for counting networks motifs’ [Physica A 381 (2007) 482-490]

Network motifs in a given network are small connected subnetworks that occur at significantly higher frequencies than would be expected for a random network. In their 2007 article “An optimal algorithm for counting network motifs”, Itzhack, Mogilevski, and Louzoun present an algorithm for detecting network motifs. Based on an experimental comparison with a motif detection software called FANMOD, they claim that their algorithm is “more than a thousand times faster” than any previous motif detection algorithm. We show that this claim is not correct and based on a significant flaw in the experimental setup. Once the experimental data of Itzhack et al. is corrected for this flaw, the implementation of their algorithm actually turns out to be a little slower than FANMOD for random Erd?s-Rényi graphs. For random scale-free networks, the implementation of Itzhack et al. is faster only by a factor of ∼1.5, not the orders of magnitude claimed by Itzhack et al.     

用于半导体激光器光束整形的衍射光学元件的设计研究

采用模拟退火法（ＳＡ）和输入 输出法（Ｉ-Ｏ）相结合的算法（ＳＡＩＯ）设计了８台阶的衍射光学元件，将椭圆高斯分布的激光束变换到均匀圆光束，转换到圆均匀区的能量效率达到了９１.９％．计算结果表明，用ＳＡＩＯ设计得到的输出波形边缘陡直，在平顶区的起伏和光滑程度比单独使用ＳＡ或Ｉ-Ｏ有明显改善 关键词：     

改进自适应LBG矢量量化算法在干涉高光谱图像压缩中的应用

在基于点到线模型扩展LBG(linde-buzo-gray algorithm)矢量量化算法的基础上,提出了一种更为高效的新型自适应LBG矢量量化算法,并给出了该算法在干涉高光谱图像无损压缩中的实际压缩方案.该算法在LBG算法码书中利用点到线的垂线关系基础上进行了改进,执行进一步的自适应化迭代进而获得了更小的残差.将自...     

基于背景加权空间直方图的目标跟踪

针对传统目标跟踪算法中存在的特征鲁棒性不强的问题,提出了一种基于背景加权空间直方图的目标跟踪算法。算法通过综合背景加权直方图和空间直方图二者各自的优势,增强了特征描述的鲁棒性,进而在Mean Shift跟踪框架下实现了对运动目标的跟踪。仿真实验与定量分析表明,所提算法能够实现对目标的稳定跟踪,跟踪所得的平均中心位置误差较传统算法降低了80%以上。     

衍射光学元件设计中的插值迭代方法

在I-O算法的基础上提出一个适合于FFT迭代计算的DOE精细化设计方法.并对此方法进行了重复性计算实验.结果表明,这种精细化设计方法可以比较有效地改善设计目标的PV与RMS值,具有较好的可重复性,为后续的模拟退火优化提供了比较良好的初始位相结果.     

Dynamic critical behavior of the worm algorithm for the Ising model

We study the dynamic critical behavior of the worm algorithm for the two- and three-dimensional Ising models, by Monte Carlo simulation. The autocorrelation functions exhibit an unusual three-time-scale behavior. As a practical matter, the worm algorithm is slightly more efficient than the Swendsen-Wang algorithm for simulating the two-point function of the three-dimensional Ising model.