The optimisation of higher order resampling methods in a multiprocessor environment

The processing of images obtained from satellites often involves highly repetitive calculations on very large amounts of data. This processing is extremely time consuming when these calculations are performed on sequential machines. Parallel computers are well suited to handling computationally expensive operations such as higher order interpolations on large data sets. This paper decribes work undertaken to develop parallel implementations of a set of resampling procedures on an Alliant VFX/4. Each resampling procedure implemented has been optimised in three stages. First, the algorithm has been restructured, where two-dimensional resampling is performed by two one-dimensional resampling operations. Second, each procedure has been reprogrammed in such a way that the autoparallelisation provided by the FX/Fortran compiler has been exploited. Thirdly, data dependent analysis of each procedure has been performed in order to achieve full optimization of each procedure; each procedure has been restructured where appropriate to circumvent vectorisation and concurrency inhibiting data dependencies. The nature and extent of the code optimization achieved for each procedure is presented in this paper. The original code for the most computationally expensive procedure, as targeted at a sequential machine, was found to have an execution time of 4900 seconds on the Alliant VFX/4 when compiled with regular compiler optimization options. Following algorithmic redesigning and reprogramming of the code, as indicated in stage 1 and stage 2, the execution time was reduced to 248 seconds. Restructuring of the code following data dependency analysis indicated in stage 3 in order to avoid data dependencies and allow concurrency and vectorisation, further reduced execution time to 162 seconds. The consequence of this work is that higher-order resampling methods which had not previous been practical are now routinely performed on the Alliant VFX/4 at the University of Dundee.     

Local calibration of rigid pavement performance models using resampling methods

The performance prediction models in the Pavement-ME design software are nationally calibrated using in-service pavement material properties, pavement structure, climate and truck loadings, and performance data obtained from the Long-Term Pavement Performance programme. The nationally calibrated models may not perform well if the inputs and performance data used to calibrate those do not represent the local design and construction practices. Therefore, before implementing the new M-E design procedure, each state highway agency (SHA) should evaluate how well the nationally calibrated performance models predict the measured field performance. The local calibrations of the Pavement-ME performance models are recommended to improve the performance prediction capabilities to reflect the unique conditions and design practices. During the local calibration process, the traditional calibration techniques (split sampling) may not necessarily provide adequate results when limited number of pavement sections are available. Consequently, there is a need to employ statistical and resampling methodologies that are more efficient and robust for model calibrations given the data related challenges encountered by SHAs. The main objectives of the paper are to demonstrate the local calibration of rigid pavement performance models and compare the calibration results based on different resampling techniques. The bootstrap is a non-parametric and robust resampling technique for estimating standard errors and confidence intervals of a statistic. The main advantage of bootstrapping is that model parameters estimation is possible without making distribution assumptions. This paper presents the use of bootstrapping and jackknifing to locally calibrate the transverse cracking and IRI performance models for newly constructed and rehabilitated rigid pavements. The results of the calibration show that the standard error of estimate and bias are lower compared to the traditional sampling methods. In addition, the validation statistics are similar to that of the locally calibrated model, especially for the IRI model, which indicates robustness of the local model coefficients.     

基于分层转移的粒子滤波MCMC重采样算法

针对粒子滤波中如何设计重采样策略以解决“权值蜕化”,同时又可避免“样本贫化”的问题,提出一种基于分层转移的Monte Carlo Markov链（MCMC）重采样算法．当样本容量检测出现“蜕化”时,将样本集按权值蜕化程度进行分层,利用提出的变异繁殖算法,将其与PSO融合产生MCMC转移核,并施以分层子集;然后通过Metroplis—Hastings算法进行接收-拒绝采样,由此构建的Markov链可收敛到与目标真实后验等价的平稳分布．数值仿真结果表明,所提出的算法能以更快的收敛速度和更小的估计误差贴近目标真实后验,从而提高了估计精度．     

基于抛物线拉东变换的地震道重构

研究了一种基于抛物线拉东变换(PRT)的地震道外推和内插方法，该方法根据部分NMO校正后的CMP(Common Middle Point，共中心点)道集中地震同相轴的抛物线假设，在待重建道的位置用零值道代替，然后采用迭代方式，通过带限抛物线拉东正变换和最小平方抛物线拉东反变换进行数据重构．结果表明，该方法可用于叠前道集中缺失道的重建、外推、内插以及数据重采样和数据规则化等方面．模型数据和实际数据应用还表明本方法是有效的和稳健的，它不需要精确的NMO速度，具有很强的抗噪能力，且能进行中间偏移距道和远偏移距道的处理，对于多次波的消除、AVO分析、DMO处理和某些三维叠前偏移成像方法都将是有益的．     

对光照变化鲁棒的多特征动态提取跟踪算法

针对视觉跟踪算法光照自适应能力差的问题,提出了一种对光照变化鲁棒的多特征动态提取跟踪算法。该算法采用高效克服光照影响的特征提取方法,颜色子模型采用模糊直方图方法获取,在同态滤波基础上建立边缘子模型,运动子模型采用改进的三帧差分法提取。该算法还定义了一个新的特征融合模型,把多种互补的观测子模型动态融合,增强了观测模型的准确性,合理量化特征的可靠性使跟踪更稳定。同时采用改进的粒子重采样方法提高了跟踪准确度。实验结果表明,该算法能有效地避免光照变化对跟踪的影响,具有较好的鲁棒性。     

基于重采样平滑粒子滤波的检测前跟踪

针对基于序列重采样(SIR)粒子滤波的检测前跟踪(TBD)算法的不足,提出了重采样平滑(RS)算法以及简化的RS算法,并将其应用于常规雷达的TBD算法,得到基于序列重要性重采样平滑(SIRS)的TBD(SIRS-TBD)算法.仿真结果表明,RS算法可以有效地提高粒子的多样性,在雷达上应用SIRS-TBD算法可以实现对低可探测目标的检测和跟踪.     

基于粒子群优化的同步定位与地图构建

针对基本FastSLAM算法的样本枯竭、估计精度下降等问题,提出了一种基于多样性启发因子的粒子群优化FastSLAM算法.利用粒子群搜索寻优重新分配粒子,使粒子的表示更加接近于真实的后验概率分布,并且采用粒子集多样性测度作为启发因子,引导粒子优化搜索过程,确保群体多样性水平最优,减轻粒子退化现象,驱动粒子集向后验概率较高的区域运动.对所提出的算法进行了仿真实验,验证了算法的可行性和有效性.仿真结果表明,该算法能够改进样本枯竭问题,并能够获得较高的定位精度、地图构建精度及较好的滤波估计稳定性.     

陪护机器人粒子滤波定位法中重采样算法研究

针对室内陪护机器人粒子滤波定位方法,研究了四种粒子滤波重采样算法：多项式重采样算法、残差重采样算法、分层重采样算法和系统重采样算法,并分别对其进行仿真比较。实验证明残差重采样算法粒子收敛速度和粒子匮乏程度取折衷,性能优于其它三种重采样算法,在此基础上利用仿真实验结果在HHR-0303服务机器人上进行了实验。实验证明采用残差重采样算法的粒子滤波算法,利用声纳配合里程计定位的方案能达到定位目的。     

Medical Image Retrieval Based on Multi-Layer Resampling Template

Medical image application in clinical diagnosis and treatment is becoming more and more widely, How to use a large number of images in the image management system and it is a very important issue how to assist doctors to analyze and diagnose. This paper studies the medical image retrieval based on multi-layer resampling template under the thought of the wavelet decomposition, the image retrieval method consists of two retrieval process which is coarse and fine retrieval. Coarse retrieval process is the medical image retrieval process based on the image contour features. Fine retrieval process is the medical image retrieval process based on multi-layer resampling template, a multi-layer sampling operator is employed to extract image resampling images each layer, then these resampling images are retrieved step by step to finish the process from coarse to fine retrieval.