线性多视图重构的新算法  

A New Method of Linear Multi-view Reconstruction

作　　者：章权兵[1] 王海贤[1] 韦穗[1] 

机构地区：[1]安徽大学计算智能与信号处理教育部重点实验室,合肥230039

出　　处：《中国图象图形学报（A辑）》2004年第10期1210-1215,共6页Journal of Image and Graphics

基　　金：国家自然科学基金(60143003);国家自然科学基金(60375010);安徽省教育厅自然科学研究项目(2003KJ005)

摘　　要：研究了由多幅图像恢复摄像机矩阵和空间物体三维几何形状这一多视图三维重构问题,改进了由Hartley和Rother等人分别给出的基于由无穷远平面诱导的单应进行射影重构的算法,提出了一种新的线性算法,它仅需要空间中3个点在每幅图像上均可见。因为空间中不在同一直线上的3个点恰好确定一个平面,所以它避免了Hartley和Rother等方法中需要确定空间4个点是否共面这一比较棘手的问题。大量实验结果表明,这种方法快速、准确且受噪声影响小。This paper investigates the problem of how to carry out 3D projective reconstruction from multiple images. Up to now, it is commonly accepted that the bundle adjustment and factorization method are the main methods for projective reconstruction. But the bundle adjustment needs a good initialization and extremely expensive computation, and the factorization method is limited by the restriction that all 3D points must be visible in all views. Recently, a linear algorithm of projective reconstruction based on the homography induced by the infinite plane was given by Hartley and Rother et al., but they needed 4 points on a reference plane be visible in all views. This paper improves their algorithms and proposes a new linear algorithm based on infinite homography where 3 points on a reference plane should be visible in all views. It avoids the difficult task of determining whether 4 object points are coplanar or not, because 3 points which are not collinear just determines a plane. The algorithm proposed in this paper is convenient and can deal with the occluded problem. The algorithms are evaluated on both synthetic and real world images and the experiment results show that the method is accurate and only affected slightly by noise.

关 键 词：多视图 新算法 无穷远平面 线性算法 图像恢复 三维重构 快速 同一直线 射影 共面 

分 类 号：TB332[一般工业技术—材料科学与工程] TP391[自动化与计算机技术—计算机应用技术]