无穷远平面单应性矩阵的线性复原算法  

Linear restoration algorithm of infinite homography matrix

作　　者：杨忠根[1] 任蕾[1] 姜桂祥[1] 曹芳[1] 

机构地区：[1]上海海事大学信息工程学院,上海200135

出　　处：《上海海事大学学报》2005年第1期69-73,共5页Journal of Shanghai Maritime University

基　　金：上海市高等学校科学技术发展基金项目(01G02)

摘　　要：通过推导基本矩阵对唯一确定无穷远单应性矩阵的计算公式,给出从一对线性无关运动下的三幅视图特征点集线性复原无穷远单应性矩阵的新算法,它不但用算法证明复原无穷远单应性矩阵的充要条件,并且在计算速度、复原精度和抗噪能力上与吴 胡算法相比都有较显著的提高。By deriving the formula to determine the infinite homography matrix from a pair of fundamental matrixes, a new linear restoration algorithm of infinite homography matrix from a pair of feature point sets extracted from three-views under a pair of linearly independent motions is developed. The sufficient and necessary condition to linearly restore the infinite homography matrix is proved by the computation procedure of the developed algorithm. As compared to the Wu-Hu’s algorithm, all of the computation speed, restoration precision and anti-noise robustness of the developed new algorithm have been improved significantly.

关 键 词：单应性矩阵 无穷远平面 复原算法 计算公式 线性无关 充要条件 计算速度 抗噪能力 矩阵对 新算法 视图 

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