检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《中国图象图形学报》2011年第1期84-89,共6页Journal of Image and Graphics
基 金:国家自然科学基金项目(60873085);国家高技术研究发展计划(863)项目(2007AA01Z314);西北工业大学研究生创业种子基金项目(Z200963)
摘 要:在图像特征匹配过程中,误匹配不可避免。提出一种新的基于拓扑约束(顺序约束和仿射不变约束)的外点去除算法,用于快速地去除图像粗匹配结果中的误配点。该算法对随机采样集进行拓扑过滤,只对满足拓扑约束的采样集进行计算。实验表明,该算法相比于传统的鲁棒估计算法RANSAC和改进的PROSAC算法,大大提高了计算效率并保持很高的计算精度,有助于提升图像匹配性能及3维重建的精度和鲁棒性。Outliers are inevitable in image matching process. To address this issue, a novel topology constraint based outlier rejection algorithm is proposed to efficiently remove the mismatches between images after coarse matching. By using the topology constraint to filter the sample sets, the proposed algorithm calculates the transformation between images based on the sample set which fully satisfies the topology constraints. Experimental results demonstrate that the proposed algorithm can significantly reduce the computational complexity, while keeping the accuracy compared to the traditional RANSAC and improved PROSAC algorithms. Therefore, the proposed method can effectively and efficiently improve the performance of image matching, and furthermore benefits the application of 3D scene reconstruction in both accuracy and robustness.
关 键 词:图像匹配 外点 顺序约束 仿射不变约束 拓扑约束
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.169