确定性扰动PV插值算法及其性能分析.pdfVIP

Vol. 31, No. 4 ACTA AUTOMATICA SINICA July, 2005 Deterministic Perturbation Partial Volume Interpolation: Algorithm and Analysis1) FENG Lin YAN Liang SUN Tao HUANG De-Gen TENG Hong-Fei (Institute of Mechanical Engineering, Dalian University of Technology, Dalian 116024) (E-mail: fenglin@dlut.edu.cn) Abstract This paper discusses the performance of some existing interpolation algorithms, and presents a deterministic perturbation partial volume interpolation algorithm. This algorithm dis- tributes the contribution of intensity of the transformed point to nine entries in the joint histogram, imports and determines the perturbation to calculate the weights. Then it is analyzed and compared with other algorithms. The results of experiments indicate that this algorithm can avoid the local extremes on grid points and non-grid points, and effectively smooth the object function. Key words Interpolation, partial volume interpolation, perturbation, deterministic perturbation, image registration, mutual information 1 Introduction Essentially, image registration based on mutual information is a problem of multi-parameter optimization[1] . Therefore, the target function is usually unsmooth. This cumbers registration badly. Local extremes are always ascribed to two facts[2] . One is that there may be misregistrations between images; the other is that voxels would not coincide completely with the sample grid and interpolation is needed. Then local extremes appear easily during interpolating. Therefore, a good interpolation