Modified genetic algorithm-based sub-pixel mapping

Sub-pixel mapping (SPM) is a promising way to predict the location of endmembers within mixed pixels at the sub pixel level. SPSAM is a real time processing algorithm for SPM, but it will generate a lot of isolated sub pixels because land cover classes were assigned to sub pixels in order. In this letter, a novel method is proposed to realize SPM. It contains two main steps: sub-pixel/pixel spatial attraction model (SPSAM) is first used to generate the initial SPM result; and then modified genetic algorithm (MGA) is applied as the post-processing method to obtain more accurate results. Three different sets of data are used for experiments: simple artificial images and two sets of real remote sensing images. The results show MGA/SPSAM outperforms the conventional SPM methods.     

惯性约束聚变实验中编码成像的反投影解码

 描述了惯性约束聚变实验中编码成像原理及解码方法。以环孔显微镜为例,对ICF实验中编码成像的解码进行数字研究。采用反投影算法进行数值解码,并编制数值解码程序,对两个实例进行模拟计算。模拟结果表明该算法的图像解码复原精度高 ,效果好。     

改进的多重网格法重建含遮拦物的干涉波前

阐述了由单张干涉图求取相位主值图像及最小二乘相位恢复。推导出基于梯度拟合的泊松方程及其离散化形成后,详细讨论了多重网格法对此方程求解的原理和过程。结合路径无关与路径相关算法的优点,设计了自适应最优路径法作为多重网格法的预处理,改进迭代的初始条件,提高了重建精度,同时大大加快了收敛速度。实验结果证明改进的多重网格法对含遮挡物的干涉图能获得很好的波前重建效果。     

Joint power allocation and user assignment for licensed/unlicensed band users in massive MIMO cellular systems

In this paper, we study the joint user assignment and power allocation for the defined utility function (central cell throughput) maximization in massive Multiple Input-Multiple Output (MIMO) cellular system coexistence with Wireless Fidelity (WiFi) network. Firstly, the power allocation of problem is formulated as a convex optimization. Unfortunately, the formulated problem has not a closed-form solution. For solving the mentioned problem, it is converted to three sub-problem based on the number of lemmas that are expressed. Due to two of these problems remain difficult to solve, this two sub-problem are relaxed. The Ellipsoid algorithm is an iterative algorithm that used for solving of the relaxed problems. In the following, joint user assignment and power allocation will be addressed, in which two approaches are proposed for solving. In the first approach, we propose an iterative algorithm that user assignment problem and power allocation problem are solved in each iteration. In the second approach, at first, users are assigned to licensed and unlicensed bands, then for the obtained arrangement, the power allocation problem is solved. The simulation results showed that the proposed algorithms are significantly close to the benchmark methods.     

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.     

GMRES算法在二维定常无粘流计算中的应用

发展了GMRES算法的两种不同预处理方法求解二维无粘流体动力学方程组。在保证计算效率的基础上,采用了一种减小内存需求的途径。用两个算例对GMRES算法以及两种不同的预处理方法进行分析,同时与DDADI方法进行比较。通过对NACA0012有攻角超临界流动以及GAMM通道超音流的计算,表明两种预处理下的GMRES算法都具有收敛速度快的优点,LUSGS预处理方法略优于ILU预处理方法。     

Off-axis dose distribution for rectangle proton beam

This papcr modifies an analytical algorithm originally developed for electron dose calculations to evaluate the off-axis dose distribution of rectangle proton bcam. This spatial distribution could be described by Fermi-Eyges theory since a proton undergoes small-angle scattering when it passes through medium. Predictions of the algorithm for relative off-axis dose distribution by a 6 cm ＊ 6 cm initial monoenergetic proton beam are compared with the results from the published Monte Carlo simulations. The excellent level of agreement between the results of these two methods of dose calculation （〈 2%） demonstrates that the off-axis dose distribution from rectangle proton beam may be computed with high accuracy using this algorithm. The results also prompts the necessity to consider the off-axis distribution when the proton is applied to clinical radiotherapy since the penumbra is significant at the distal of its range （about 0.6 cm at the Bragg-peak depth）.     

腔衰荡光谱技术中衰荡时间的准确快速提取

对NO₃腔衰荡光谱(cavity ring-down spectroscopy,CRDS)探测系统中衰荡时间的准确提取方法进行了研究。对衰荡时间有效快速的提取可以提高CRDS测量的精度和速度。选取了五种常用的提取衰荡时间的拟合方法,分别为快速傅里叶变换法、离散傅里叶变换法、线性回归总和法、列文伯格-马夸尔特算法和最小二乘法。采用以上五种算法对带有不同大小白噪声的模拟衰荡信号进行拟合,并从受噪声影响情况、拟合准确性和精度、拟合速率,三个方面对五种算法的拟合结果进行对比和分析,结果表明列文伯格-马夸尔特算法和线性回归总和法准确度高、抗噪能力强,但列文伯格-马夸尔特算法拟合速率相对较慢。选取衰荡时间的5～10倍为衰荡信号的最佳拟合波形长度,此时五种算法拟合结果的标准偏差最小。采用外部调制二极管激光器及高反腔搭建CRDS探测系统,针对0.2%噪声的实验条件,选取线性回归总和法和列文伯格-马夸尔特算法对实际测量的实验数据进行处理。实验表明,线性回归总和法拟合准确度和精度与列文伯格-马夸尔特算法相似,但拟合速率比列文伯格-马夸尔特算法快约5倍。实验结果与模拟分析相吻合,表明线性回归总和法为适合我们实验条件的最佳拟合方法。     

Phase unwrapping algorithms, respectively, based on path-following and discrete cosine transform

This paper describes a path-following phase unwrapping algorithm and a phase unwrapping algorithm based on discrete cosine transform (DCT) which accelerates the computation and suppresses the propagation of noise. Through analysis of fringe pattern with serious noises simulated in mathematic model, we make a contrast between path-following algorithm and DCT algorithm. The advantages and disadvantages of analytical fringe pattern are also given through comparison of two algorithms. Three-dimensional experimental results have been given to prove the validity of these algorithms. Despite DCT phase unwrapping technique robustness and speed in some cases, it cannot be unwrapping inconsistencies phase. The path-following algorithm can be used in automation analysis of fringe patterns with little influence of noise.     

Quantifying time-varying coordination of multimodal speech signals using correlation map analysis

This paper demonstrates an algorithm for computing the instantaneous correlation coefficient between two signals. The algorithm is the computational engine for analyzing the time-varying coordination between signals, which is called correlation map analysis (CMA). Correlation is computed around any pair of points in the two input signals. Thus, coordination can be assessed across a continuous range of temporal offsets and be detected even when changing over time due to temporal fluctuations. The correlation algorithm has two major features: (i) it is structurally similar to a tunable filter, requiring only one parameter to set its cutoff frequency (and sensitivity), (ii) it can be applied either uni-directionally (computing correlation based only on previous samples) or bi-directionally (computing correlation based on both previous and future samples). Computing instantaneous correlation for a range of time offsets between two signals produces a 2D correlation map, in which correlation is characterized as a function of time and temporal offset. Graphic visualization of the correlation map provides rapid assessment of how correspondence patterns progress through time. The utility of the algorithm and of CMA are exemplified using the spatial and temporal coordination of various audible and visible components associated with linguistic performance.     

连续太赫兹波双物距叠层定量相衬成像

针对连续太赫兹波叠层成像重建算法收敛较为迟滞的问题,提出一种连续太赫兹波双物距叠层成像方法及相关重建算法,使用不同记录距离形成的差异化衍射图幅值作为重建算法记录平面的约束条件,增加了记录平面数据多样性和衍射信息冗余度.仿真结果表明,本方法可以加快算法收敛速率,有效减少迭代次数,提高连续太赫兹波定量相衬成像计算效率.随后构建了基于2.52 THz光泵连续太赫兹激光器的双物距叠层成像实验装置,应用双物距记录方法及改进算法重建获得了聚丙烯基字母图案样品的幅值和相位分布,结果表明改进方法可以减少算法迭代次数,提升计算效率,同时改善相位像重建结果保真度.     

一种用于均匀照明的衍射光学元件设计的快速模拟退火法

介绍了一种适用于均匀照明的衍射光学元件设计的自洽迭代和优化混合的快速模拟退火法,它引入Tsallis正则分布以及相应的效用函数思想,可以在接近1%的时间内得到和传统模拟退火法有着相同均方差(MSE)的理想模拟结果.     

一种改进的基于小波方向对比度的无缝拼接算法

为了提高图像无缝拼接效果,对现有平滑算法进行分析,在此基础上提出一种基于小波方向对比度的中缝平滑算法。该算法首先对源图像进行基于统计参数的预处理,使得图像整体亮度趋于一致,然后利用小波变换对图像进行多分辨率分解,对于分解后的图像提出采用一种基于改进的小波方向对比度的规则进行平滑处理。文中还通过几种图像客观评价标准对仿真结果进行了评价,结果表明：该方法在两图像灰度相差较大时也能够取得较好的平滑效果,对光照具有鲁棒性,并且平滑后的图像可以保留原始图像的细节信息,使得图像在保证清晰度的前提下达到无缝拼接。     

Computational leakage: Grover's algorithm with imperfections

We study the effects of dissipation or leakage on the time evolution of Grover's algorithm for a quantum computer. We introduce an effective two-level model with dissipation and randomness (imperfections), which is based upon the idea that ideal Grover's algorithm operates in a 2-dimensional Hilbert space. The simulation results of this model and Grover's algorithm with imperfections are compared, and it is found that they are in good agreement for appropriately tuned parameters. It turns out that the main features of Grover's algorithm with imperfections can be understood in terms of two basic mechanisms, namely, a diffusion of probability density into the full Hilbert space and a stochastic rotation within the original 2-dimensional Hilbert space. Received 12 August 2002 / Received in final form 14 October 2002 Published online 4 February 2003     

基于随机并行梯度下降算法的光束相干合成技术

介绍了随机并行梯度下降算法的基本原理,对算法流程进行了仿真验证,并对其中随机扰动幅度和增益系数两个关键参数进行了仿真分析。分析结果表明,这两个参数存在一个最适区间,只有在此区间内取值时算法才能有效收敛。以仿真分析为依据开展了光纤激光的相干合成实验,结果表明光束相干合成效果显著,有效地验证了仿真分析的结果。     

基于DCT算法的种子点相位解包算法

移相干涉术由于其高精度被广泛应用在光学元件的面形测量上,而由移相算法得到的相位数据被包裹在[-π,π]之间。基于区域生长理论的相位解包算法(种子点法)可以高精度地实现连贯区域的相位解包,基于离散余弦变换的最小二乘解包(DCT)算法可以实现矩形区域的相位解包,而实际测量中,经常会碰到被测件的有效区域为非矩形的分离区域。因此,在分析前两种算法优缺点的基础上,提出了基于DCT算法的种子点相位解包算法。首先运用DCT算法对整个包裹相位进行解包,然后运用种子点法分别解包各分离区域,再通过DCT算法求得的种子点干涉级次实现各分离区域解包相位的统一。实验结果表明,该方法克服了种子点法和DCT算法的缺点,可以准确、快速地实现分离区域干涉图包裹相位的解包,且比这两种算法具有更好的稳定性和更高的精度。     

The validation of the parallel three-dimensional solver for analysis of optical plasmonic bi-periodic multilayer nanostructures

Fundamentals of the three-dimensional spatial harmonic analysis (SHA) approach are reviewed, and the advantages of a fast-converging formulation versus the initial SHA formulation are emphasized with examples using periodic plasmonic nanostructures. First, two independent parallel versions of both formulations are implemented using the scattering matrix algorithm for multilayer cascading. Then, by comparing the results from both formulations, it is shown that choosing an advanced fast-converging scheme could be essential for accurate and efficient modeling of plasmonic structures. Important obstacles to the fast parallel implementation of this approach are also revealed. The results of test simulations are validated using the data obtained from a commercial finite-element method (FEM) simulations and from the experimental characterization of fabricated samples.     

畸变产物耳声发射信号的时域分离算法研究

针对在分离畸变产物耳声发射(Distortion Product Otoacoustic Emissions,DPOAE)不同产生源成分的过程中两成分之间存在交叉干扰的问题,建立了IFFT(Inverse Fast Fourier Transform,IFFT)结合时域窗的成分分离算法模型,结合模型进行了分离误差的分析,并在此基础上给出一种时间窗窗宽选择准则。根据IFFT后的时域波形,利用两成分主峰包络内的信号波形的矩心移动速率的快慢选择两成分之间的合适的分界点,将两成分分离开。对结合了该时间窗窗宽选择准则的时域成分分离算法进行了仿真,并对DPOAE实验数据进行了成分分离。仿真和实验结果表明,结合该窗宽选择准则的DPOAE时域分离算法可以成功地分离两个成分,且有效地减少了因两成分之间的交叉干扰引入的幅度和相位扰动。因此,结合该窗宽选择准则的DPOAE时域分离算法是有效的,可以提高分离不同产生源成分的准确性。      

Calculation of Refractive Index Changes from Thermal Lens Fringes using Continuous Wavelet Algorithm

Thermal lens fringes are obtained on the nile-blue/ethanol solution by illuminating it with a He–Ne laser in a Mach–Zehnder interferometer. The refractive index change distribution of these fringes is calculated by using two different continuous wavelet transform (CWT) algorithms. It is concluded that the CWT-phase method works better than the CWT-gradient algorithm for the analysis of thermal lens fringes according to theoretical results.