摘要
针对利用Helmholtz互易原理由一对图像重构三维表面时存在计算时间长、显示质量不高的问题,提出一种利用上下对、左右对图像重建三维物体表面的高效算法.利用其中一对图像的匹配结果分割另一对图像的外极线,将整个外极线的匹配问题转化为相应子段的匹配问题,并交错地递归这种处理过程;引入不要求端点匹配的动态规划匹配算法实现子段对应,并分段重构物体三维表面的点.实验结果表明,与单对图像重构算法相比,该算法能够大幅度地缩小动态规划算法的搜索范围,使得重构速度提高了一个数量级;通过上下、左右方向扫描线恢复三维表面点并大约增加0.5倍的重构点数量,使得表面显示质量得到明显提高.
Surface reconstruction method via Helmholtz reciprocity with single image pair has low computational efficiency, and its reconstructed surface appeared layer by layer along scanning lines. We present an efficient surface reconstruction approach via Helmholtz reciprocity with two image pairs. The fundamental idea of this method is to segment the matching epipolar line of one image pair by using the matched epipolar line of the other image pair alternately, which transfers the optimal matching of a whole epipolar line into that of its sub-segments. Dynamic programming without the requirement of endpoint matching is introduced and applied to these sub-segments to get matching and reconstruct 3D surface points. Simulation experimental results show that, compared to the surface reconstruction algorithms with a single image pair, the reconstruction speed of our algorithm increases one order of magnitude and the surface display quality is better since the searching range of dynamic programming on sub-segments is shortened considerably and more surface positions are recovered by using two image pairs.
出处
《计算机辅助设计与图形学学报》
EI
CSCD
北大核心
2009年第10期1433-1437,共5页
Journal of Computer-Aided Design & Computer Graphics
基金
国家自然科学基金(60203003
60873249)
国家"八六三"高技术研究发展计划(2006AA02Z472
2008AA01Z419)