三种二值图像时域定位算法的比较研究  

Comparison and contrast of three binary image registration algorithms

作　　者：李国正[1] 杨杰[1] 邓志鹏[1] 

机构地区：[1]上海交通大学图像处理与模式识别研究所,上海200030

出　　处：《红外与激光工程》2001年第5期346-349,共4页Infrared and Laser Engineering

摘　　要：基于边缘特征的图像时域快速定位方法有很多。文中提出一种基于实时图像与模板图像边缘点之间映射的算法 ,该算法具有很强的稳健性 ,与基于Hausdorff距离的快速算法、基于时域互相关的算法比较 ,理论和实验结果都证明 ,三种方法在理论上的稳健性是一致的 ,但具体算法的实现上文中提出图像定位的方法 ,在图像特征点较少时 ,计算量更少 ,实时性高 ,具有实用价值。Many algorithms have been put forward for binary i ma ge registration. A new algorithm based on point mapping is presented in this pap er. The method is robust to find the most matches among point mapping between re al-time image and model image. Comparing this algorithm with a fast algorithm b ased on Hausdorff Distance and an algorithm based on cross correlation in time d omain it is proved that this algorithm is the same robust as the other two algor ithms by theory analysis and experiments, but this algorithm is more efficient i n computation, and of practical value.

关 键 词：图像定位 边缘检测 二值图像 时域定位算法 

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