检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:左威健 胡立华[1] 刘爱琴[1] 张素兰[1] 马瑞 ZUO Wei-jian;HU Li-hua;LIU Ai-qin;ZHANG Su-lan;MA Rui(School of Computer Science and Technology,Taiyuan University of Science and Technology,Taiyuan 030024,China)
机构地区:[1]太原科技大学计算机科学与技术学院,山西太原030024
出 处:《计算机工程与设计》2022年第3期778-785,共8页Computer Engineering and Design
基 金:国家自然科学基金项目(61873264);辽宁省自然科学基金项目(2020-KF-22-14)。
摘 要:针对图像间结构复杂、纹理重复的对象中存在特征匹配鲁棒性差、误匹配率高的问题,结合最近邻思想,提出一种基于动态拓展的特征匹配方法。输入待匹配的两幅图像,采用SIFT算子提取图像初始特征点几何位置信息,构建基础数据集;依据基础数据集,采用核心点周围邻域逐层约束的动态拓展聚类方法,划分图像聚类簇;设计度量函数确定图像对应聚类簇,生成对应簇内特征点的描述子;采用最近邻距离比准则进行特征匹配。以Oxford VGG标准数据集和古建筑图像为对象,验证了该算法的精确性与鲁棒性。To solve the problems of the poor feature matching robustness and high false matching rate with complex structures and repeated textures,a feature matching method based on dynamic expansion was proposed combining with the nearest neighbors.For two images,the SIFT operator was used to extract the geometric position information of the initial feature points in images,and two basic data sets were obtained.Based on the core points in the basic data sets,a dynamic expansion clustering method was used combining with the layer-by-layer constraint,and the clusters in each image were obtained.The corresponding clusters between the left image and the right image were determined by the new measurement function,and the descriptors of the feature points in the corresponding clusters were generated.The nearest neighbors distance ratio criterion was used for feature matching.Taking the Oxford VGG standard data set and the ancient architectural images as objects,the accuracy and robustness of this algorithm are verified.
分 类 号:TP391.41[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:13.59.1.209