光学学报, 2009, 29 (8): 2153, 网络出版: 2009-08-17  

复杂X光照条件下非凸表面完全重构

Complete Reconstruction of Non-Convex Surface under Complex IlluminationMa Shuangtao
作者单位
西安交通大学电子与信息工程学院, 陕西 西安 710049
摘要
针对复杂光照条件下非凸表面完全重构问题, 提出了一种基于两步策略的多目重构新方法。把立体匹配过程转化为颜色方差最小化问题, 利用颜色方差阈值来平衡采样点数与采样噪声之间的矛盾, 同时回避了立体匹配算法的二义性。采用水平集方法建立曲面运动方程, 通过符号距离函数的演化过程逼近目标表面; 通过弹性势能的最小化过程滤除采样噪声, 增强对遮挡、光照条件的稳键性。实验结果表明, 该方法能够在复杂光照条件下推断出非凸目标形状, 且与Jin的算法比较, 表现了更好的准确性, 节省31%~39%的重构时间。
Abstract
Focusing on the complete reconstruction of non-convex surface under complex illumination, a multi-view reconstruction method is presented. Stereo matching is translated into an issue of color variance minimizing. A threshold is used to balance the contradiction between sampling number and sampling noise, and the ambiguity in stereo match is avoided. By using level set method to deduce the equation of curve surface moving, the object surface is approximated by sign distance function, and the sampling noise is filtered by minimizing the elasticity potential energy, and the robustness for occlusion and illumination condition is strengthened. The experimental results show that the deformable initial surface can shrink to model of object with accuracy and robustness under complex illumination, and the reconstructed time is saved 31~39% than the Jin’s algorithm.

马双涛, 韩九强, 张新曼. 复杂X光照条件下非凸表面完全重构[J]. 光学学报, 2009, 29(8): 2153. 马双涛, 韩九强, 张新曼. Complete Reconstruction of Non-Convex Surface under Complex IlluminationMa Shuangtao[J]. Acta Optica Sinica, 2009, 29(8): 2153.

关于本站 Cookie 的使用提示

中国光学期刊网使用基于 cookie 的技术来更好地为您提供各项服务,点击此处了解我们的隐私策略。 如您需继续使用本网站,请您授权我们使用本地 cookie 来保存部分信息。
全站搜索
您最值得信赖的光电行业旗舰网络服务平台!