Display modulation by Fourier transform: A preferred method

Abstract— A preferred method for determining the grating modulation of a rear‐projection display using a grating image and Fourier analysis is prescribed. This method is insensitive to spatial image noise and is in better correspondence with the response of the human visual system than is the standard technique. This method is not limited to rear‐projection displays and can be applied to any display technology.     

Fast parallel Preconditioned Conjugate Gradient algorithms for robot manipulator dynamics simulation

In this paper fast parallel Preconditioned Conjugate Gradient (PCG) algorithms for robot manipulator forward dynamics, or dynamic simulation, problem are presented. By exploiting the inherent structure of the forward dynamics problem, suitable preconditioners are devised to accelerate the iterations. Also, based on the choice of preconditioners, a modified dynamic formulation is used to speedup both serial and parallel computation of each iteration. The implementation of the parallel algorithms on two interconnected processor arrays is discussed and their computation and communication complexities are analyzed. The simulation results for a Puma Arm are presented to illustrate the effectiveness of the proposed preconditioners. With a faster convergence due to preconditioning and a faster computation of iterations due to parallelization, the developed parallel PCG algorithms represent the fastest alternative for parallel computation of the problem withO(n) processors.     

Covering a string

We consider the problem of finding the repetitive structures of a given stringx. The periodu of the stringx grasps the repetitiveness ofx, sincex is a prefix of a string constructed by concatenations ofu. We generalize the concept of repetitiveness as follows: A stringw covers a stringx if there is a superstring ofx which is constructed by concatenations and superpositions ofw. A substringw ofx is called aseed ofx ifw coversx. We present anO(n logn)-time algorithm for finding all the seeds of a given string of lengthn.Partially supported by SERC Grants GR/F 00898 and GR/J 17844, NATO Grant CRG 900293, ESPRIT BRA Grant 7131 for ALCOMII, and MRC Grant G 9115730.Partially supported by MRC Grant G 9115730 and S.N.U. Posco Research Fund 94-15-1112.     

新型显示器件进展

介绍了有源（光发射）和无源（光反射）显示器件－气体－电子－荧光粉显示，冷阴极场致发射矩阵平板显示、电泳成像显示和电化学显示器件等的发展情况。     

几种常用CT图像分割算法分析和探讨

图像分割是数字图像处理的一个经典难题。其分割质量的好坏直接影响到图像处理的后续工作。因而在理论研究和实际应用中受到研究人员的广泛重视。本文在总结了过去的分割方法基础上,就目前常用几种分割方法进行实验研究。主要包括阈值分割、LOG算子分割、FCM聚类分割、分水岭分割,并结合CT图像进行图像分割。文章阐述了各种分割方法的概念及原理,并在此基础上对分割结果进行了分析和探讨,得出各种方法的优点和不足。这些实验结论将为后续研究提供科学依据。     

基于移动锚节点的无线传感器网络圆心定位

文章提出了一种利用无线传感器网络无线信号接收强度（RSSI）和移动锚节点轨迹来获得待定节点位置的算法。该算法在有多个可移动锚节点的情况下,定位将会更加高效。在定位阶段,通过RSSI测得锚节点到待定节点的距离,并利用三个以上移动锚节点的坐标（包括三个）来求解圆的方程,计算出待定节点的位置。     

云计算下基于CRP算法的资源提供策略

云计算资源管理系统是用于接收来自云计算用户的资源请求,并且把特定的资源封装为服务提供给资源请求者。在云计算环境下,如何为资源请求者选择合适的资源是一个值得研究的课题。文中通过对云计算下现有的资源提供策略的分析,同时根据不同云提供者提供的计算资源的成本不同的特点,综合考虑资源的计算能力、可靠性和单位成本三点因素,提出了云计算下基于CRP算法的资源提供策略。这种资源提供策略既能提供满足用户资源请求的服务,也能降低云服务提供者的运营成本,从而获得更大收益。     

基于AUPF的TDOA几何定位跟踪算法研究

使用无源时差（TDOA）定位技术确定无人机等小型辐射源目标的位置是当前研究的热点,针对时差定位算法较为复杂的实际情况,推导了时差双曲线的几何解,并提出了一种基于自适应无迹粒子滤波（AUPF）技术的移动目标定位跟踪方法。通过仿真对该方法在不同场景的应用效果进行了验证,进一步比较分析了算法的定位精度。结果表明,基于自适应无迹粒子滤波的时差几何定位跟踪算法可以在多种情况下较好地拟合出目标真实运动轨迹,实现对运动目标的定位跟踪,同时拥有更低的定位误差和更高的轨迹包容度,使用该方法可以显著提高对非合作移动辐射源目标的位置估计性能。     

An evolutionary lion optimization algorithm‐based image compression technique for biomedical applications

Recently, medical image compression becomes essential to effectively handle large amounts of medical data for storage and communication purposes. Vector quantization (VQ) is a popular image compression technique, and the commonly used VQ model is Linde–Buzo–Gray (LBG) that constructs a local optimal codebook to compress images. The codebook construction was considered as an optimization problem, and a bioinspired algorithm was employed to solve it. This article proposed a VQ codebook construction approach called the L2‐LBG method utilizing the Lion optimization algorithm (LOA) and Lempel Ziv Markov chain Algorithm (LZMA). Once LOA constructed the codebook, LZMA was applied to compress the index table and further increase the compression performance of the LOA. A set of experimentation has been carried out using the benchmark medical images, and a comparative analysis was conducted with Cuckoo Search‐based LBG (CS‐LBG), Firefly‐based LBG (FF‐LBG) and JPEG2000. The compression efficiency of the presented model was validated in terms of compression ratio (CR), compression factor (CF), bit rate, and peak signal to noise ratio (PSNR). The proposed L2‐LBG method obtained a higher CR of 0.3425375 and PSNR value of 52.62459 compared to CS‐LBG, FA‐LBG, and JPEG2000 methods. The experimental values revealed that the L2‐LBG process yielded effective compression performance with a better‐quality reconstructed image.     

模糊自适应卡尔曼滤波算法在航位推算系统中的应用

针对实际的应用中车载航位推算系统的模型参数、噪声的统计特性不确定性,影响估计效果,提出了车载航位推算的模糊自适应卡尔曼滤波模型及其滤波算法;该方法通过监视理论残差与实际残差的比值是否接近1,应用模糊推理系统不断地调整量测噪声协方差的加权,对自适应卡尔曼滤波的量测噪声协方差进行递推修正,通过该算法来抑制噪声对精度的影响,进而提高系统的导航精度;仿真结果表明,这种算法能够有效地提高系统的精度,是一种比较理想的车载DR导航滤波方法。