摘要
提出一种基于聚类分析的Robust基础矩阵估计算法.该算法用高斯混合模型描述匹配点估计余差,采用改进的分裂合并EM算法对匹配点估计余差进行聚类分析,根据分类结果及平均余差最小规则筛选出正确匹配点类别,抛弃错误匹配点;最后,用M估计算法对筛选出的正确匹配点进行迭代求精.大量实验结果表明,文中算法比随机抽样一致性算法的估计精度高,且计算效率高.
In the paper, Gaussian mixture model is used to describe the residuals of matches in the new robust algorithm for fundamental matrix estimation, and an improved split-merge EM （SMEM） algorithm is used to classify the matches, so that the false matches can be detected and rejected by the least mean absolute residual criteria. Finally, M-estimator is used to estimate the fundamental matrix. Our algorithm gives better result than random sample consensus （RANSAC） algorithm with higher efficiency in the large number experiments tested.
出处
《计算机辅助设计与图形学学报》
EI
CSCD
北大核心
2005年第10期2251-2256,共6页
Journal of Computer-Aided Design & Computer Graphics
