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

Complete Reconstruction of Non-Convex Surface under Complex Illumination

作　　者：马双涛[1] 韩九强[1] 张新曼[1] 

机构地区：[1]西安交通大学电子与信息工程学院,陕西西安710049

出　　处：《光学学报》2009年第8期2153-2157,共5页Acta Optica Sinica

基　　金：国家自然科学基金(60602050);教育部高等学校博士学科点专项科研基金(20050698025)资助项目

摘　　要：针对复杂光照条件下非凸表面完全重构问题,提出了一种基于两步策略的多目重构新方法。把立体匹配过程转化为颜色方差最小化问题,利用颜色方差阈值来平衡采样点数与采样噪声之间的矛盾,同时回避了立体匹配算法的二义性。采用水平集方法建立曲面运动方程,通过符号距离函数的演化过程逼近目标表面;通过弹性势能的最小化过程滤除采样噪声,增强对遮挡、光照条件的稳键性。实验结果表明,该方法能够在复杂光照条件下推断出非凸目标形状,且与Jin的算法比较,表现了更好的准确性,节省31%～39%的重构时间。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.

关 键 词：图像处理 机器视觉 多目重构 水平集 视觉外型 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]