基于样条金字塔和互信息的快速图像配准  

Fast image registration based on spline pyramid and mutual information

作　　者：李乔亮[1] 汪国有[1] 刘建国[1] 陈少波[1] 

机构地区：[1]华中科技大学图像识别与人工智能研究所,武汉430074

出　　处：《计算机应用研究》2009年第5期1949-1950,1960,共3页Application Research of Computers

基　　金：国家自然科学基金资助项目(60672060)

摘　　要：采用高精度B样条生成金字塔,大幅降低了计算复杂度,通过Parzen窗计算联合直方图并在此基础上导出目标函数的Hessian矩阵表达式,将具备二次收敛性的Newton方法引入到优化过程从而大大提高了配准速度。对普通光学和多谱图像的配准实验表明,该算法大幅提高了互信息模型下的配准速度,且精度较高。This paper introduced B-Spline pyramid into mutual information based registration procedure to improve the precision and efficiency. The proposed algorithm based on B-Spline pyramid adopted Newton instead of Powell optimizer while estimated the joint probability density function by Parzen window to improve the registration accuracy and efficiency, and experimental results show that the registration speed is substantially improved by the proposed algorithm with high accuracy.

关 键 词：互信息 图像配准 Powell方法 NEWTON方法 PARZEN窗 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术]