点匹配问题的极坐标算法和三角形算法

The Polar Algorithm and Triangle Algorithm on Point Pattern Matching Problems

点模式匹配在比较两幅由不同时间或同一时间不同传感器采集的图像时 ,是常用的方法之一 ,许多实时应用系统对匹配效率有很高的要求 .文中构造了一个基于极坐标转换的算法和一个基于三角形近似顺序全等的算法 ,两个算法都具有原理简明、识别能力强、计算速度快的特点 .文末对两个算法进行了比较 ,并用数值实例加以验证 .

The points matching algorithm is a popular approach on comparing two images of the same scene at different time. The efficiency of the matching process is an important problem on many practices. This paper constructs two algorithms based on polar transformation and triangle ordered congruence. The two algorithms are simple in theory, efficient in discrimination, and fast in speed.A comparison between the two algorithms is given and numerical examples validate the results.