基于全局最优的快速一致性点漂移算法.pdfVIP

第 34 卷第 3 期 电 子 与 信 息 学 报 Vol.34No.3 2012 年 3 月 Journal of Electronics Information Technology Mar. 2012 基于全局最优的快速一致性点漂移算法 赵 键* 孙即祥 周石琳 李智勇 王亮亮 (国防科学技术大学电子科学与工程学院 长沙 410073) 摘 要：目前受到广泛关注和研究的一致性点漂移(CPD)算法是一种基于高斯混合模型的点模式匹配算法，虽然该 算法具有较强的鲁棒性，但其存在局部最优性和收敛速度随点集大小增加而下降等问题。针对上述问题，该文提出 了一种新的基于全局最优的快速一致性点漂移算法。该算法首先将点集进行正交标准形约简，利用约简后点集的重 要性质，推导出不完全观测数据的对数似然函数在全局最优解附近凸函数区域的边界值，再以该边界值为基础，采 用多重初始化策略来实现全局最优。最后，提出了基于置信域的全局收敛二次平方迭代期望最大化算法，实现了全 局优化算法的超线性收敛。模拟仿真与真实数据实验验证了该文算法是有效的、快速的以及鲁棒性较强的。 关键词：图像处理；一致性点漂移；点模式匹配；高斯混合模型；全局最优 中图分类号：TP391 文献标识码： A 文章编号：1009-5896(2012)03-0509-08 DOI: 10.3724/SP.J.1146.2011.00916 Fast Coherent Point Drift Algorithm Based on Global Optimization Zhao Jian Sun Ji-xiang Zhou Shi-lin Li Zhi-yong Wang Liang-liang (College of Electronic Science and Engineering, National University of Defense Technology, Changsha 410073, China) Abstract: Currently, the Coherent Point Drift (CPD) which based on Gaussian Mixture Model (GMM) is one of popular point pattern matching algorithms because of its robustness. However, The CPD is local optimization and its convergent rate is slower along with the size of point-set become larger. For resolving these problems, this paper presents a Global Optimal and Fast algorithm which based on CPD (GOF-CPD). The orthogonal normalization first reduce the general affine case to the orthogonal case, and the convex region boundary of the unoberserved data’s log likelihood nearby the global optimal solutions are deduced by the properties of normalized point-sets. Then, the multi-start strategy based on the convex region boundary is introduced to achieve the