首页 | 本学科首页   官方微博 | 高级检索  
     

稳定估计F矩阵的双对极点约束算法
引用本文:陈泽志,吴成柯. 稳定估计F矩阵的双对极点约束算法[J]. 计算机学报, 2000, 23(11): 1140-1145
作者姓名:陈泽志  吴成柯
作者单位:西安电子科技大学综合业务网国家重点实验室,西安,710071
基金项目:国家自然科学基金!(6 9972 0 39),香港研究基金委员会!(RGC)
摘    要:从基本矩阵参数的几何意义出发,给出了新的估计基础矩阵的约束条件,使无约束规划的目标函数由原来的4元8次降为4元6次,并用求解非线性方程的方法求出了双对极点位置,实现了F阵的稳定估计,有效地避免了传统的用非线性最小二乘法求解所存在的不足。实验结果表明,文中所提供的方法彻底克服了原双对极点约束方法运算速度慢、存在大量伪解和对极点的不稳定现象,实用性较强。

关 键 词:F矩阵 真实图像 图像匹配 双对极点约束算法
修稿时间:1999-11-02

A Robust Biepipole Constraint Algorithm for Estimating Fundamental Matrix
CHEN Ze-Zhi,WU Cheng-Ke. A Robust Biepipole Constraint Algorithm for Estimating Fundamental Matrix[J]. Chinese Journal of Computers, 2000, 23(11): 1140-1145
Authors:CHEN Ze-Zhi  WU Cheng-Ke
Abstract:A new geometrical constraint, based on the geometrical analyzing of synthetic method, is developed to estimate fundamental matrix (F-matrix). A nonlinear equation of degree 8 in 4 unknowns for unconstraint optimizing objective function is reduced to a nonlinear equation of degree 6 in 4 unknowns by utilizing the constraint. Two epipoles can be obtained by solving the nonlinear equation. Compared to the traditional Least-Square method, the method is more robust. Experiments show that using the algorithm much more improvement in the speed of calculation can be obtained. Furthermore, problems raised by using two-epipole constrained algorithm, such as existing of pseudo-solution and poor stability of epipoles, can be completely eliminated. Hence, better practicability has bee n achieved.
Keywords:fundamental matrix   biepipole constraint   estimation   Singular Value Decomposition(SVD)   residual error
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号