检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]江南大学物联网工程学院,江苏无锡214000
出 处:《计算机工程与应用》2014年第2期189-193,共5页Computer Engineering and Applications
基 金:国家自然科学基金(No.61104213);江苏省自然科学基金(No.BK2011146)
摘 要:针对SIFT匹配算法和SIFT与RANSAC结合的匹配算法都存在不同程度误匹配的问题,提出一种基于局部SIFT特征点的双阈值匹配算法。设计变步长迭代准则获取SIFT双阈值,其中大阈值匹配获得一组稀疏的精确匹配,小阈值匹配获得一组可能存在误匹配的密集匹配。以精确匹配建立目标的形变约束模型,以此为基础从密集匹配中删除误匹配。通过这些正确的匹配点估计两幅图像之间的变换矩阵。为了降低算法所需时间,提高效率,通过分析图像的纹理变化,采用提取其变化最为剧烈的区域来代表整幅图像进行匹配运算。实验结果表明,该算法在图像存在平移、旋转等仿射变化情况下具有配准精度高,稳定和快速等特点。Since the SIFT matching algorithm and the SIFT combined with the RANSAC matching algorithm both exist the mismatching problem in varies degree, a double threshold matching algorithm based on local SIFT feature points is proposed. This paper designs the iteration criteria of the variable step size to obtain the double threshold of the SIFT, where the large threshold matching obtains a set of sparse precision matching, and the small threshold matching obtains a set of intensive matching in which mismatching may exists. Then the deformation constraint model is established based on the precise matching, which is the basis of removing the mismatching from the intensive matching. The transformation matrix is estimated by these correct matching points between the two images. To reduce the required time and increase efficiency of the algorithm, the most sharply changing region is extracted by analysing the changes of the image texture, which represents the whole image to do the matching operation. The experimental results indicate that the proposed matching algorithm has advantages of high accuracy, stability and rapidity in the situation that the affine changes of translation, rota- tion etc exist in the images.
关 键 词:尺度不变特征变换(SIFT)特征点匹配 图像配准 欧氏距离 双阈值
分 类 号:TP301.6[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.145