一种改进的爬山序列算法  

Improved algorithm based on mountain-climbing sequence

作　　者：张朝辉[1] 刘循[1] 王黎亮[2] 唐苏[1] 陈胜[1] 

机构地区：[1]四川大学计算机学院,成都610064 [2]百度时代(北京)网络技术有限公司,北京100080

出　　处：《计算机工程与应用》2009年第26期150-152,共3页Computer Engineering and Applications

基　　金：国家自然科学基金No.60773169~~

摘　　要：在图像特征提取和匹配过程中,爬山序列有效地解决了图像的平移、伸缩和旋转无关性问题,但是爬山序列可能存在旋转变换序列表现形式不唯一。针对此类情况,提出一种改进的爬山序列算法,能够较好地解决了图像旋转无关性问题。实验结果表明,相对于爬山序列算法,该算法有效地减小了平均最大匹配距离,从而使呈现出较高的匹配相似度。In the process Of image feature extracting and matching,the mountain-climbing sequence is effective for solving the problems which is about the invariance to translation,scale and rotation,but the mountain-climbing sequence can not get a uniqueness of all the sequences.Focus on this condition,the improved algorithm based on the mountain-climbing sequence is presented and solves the nontmiqueness problem.The experimental results show that the improved algorithm based on mountainclimbing sequence decreases the max matching distance effectively than that of the original algorithm,also with the higher matching degree of similarity.

关 键 词：爬山序列 旋转无关 唯一性序列 匹配相似度 

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