摘要
针对传统的图像间直线特征编组匹配算法中采用笛卡尔积运算存在的计算量巨大、计算复杂等问题,本文提出了一种改进的采用分步笛卡尔积运算方法运用于直线匹配的算法,大大减少了候选线段集数量,提高了整个匹配的效率。实验数据和结果进一步验证了该算法的高效性和有效性。
In order to reduce the calculation amount in line grouping matching between two adjacent images base on traditional Cartesian product, an improved method of using Cartesian product step by step is presented. Due to the greatly reduced the number of candidate segment sets, the efficiency in matching is improved. The experimental results have proved that the method is reasonable and efficient.
出处
《宜春学院学报》
2015年第12期42-45,共4页
Journal of Yichun University
基金
国家自然科学基金项目(61165011)
宜春学院校级科研项目(XJ315)
