高级检索
袁红星, 郭立, 郁理, 程龙. 采用窄带图切割的多目重构方法[J]. 计算机辅助设计与图形学学报, 2010, 22(4): 605-611.
引用本文: 袁红星, 郭立, 郁理, 程龙. 采用窄带图切割的多目重构方法[J]. 计算机辅助设计与图形学学报, 2010, 22(4): 605-611.
Yuan Hongxing, Guo Li, Yu Li, Cheng Long. Multi-view Reconstruction Using Band Graph-Cuts[J]. Journal of Computer-Aided Design & Computer Graphics, 2010, 22(4): 605-611.
Citation: Yuan Hongxing, Guo Li, Yu Li, Cheng Long. Multi-view Reconstruction Using Band Graph-Cuts[J]. Journal of Computer-Aided Design & Computer Graphics, 2010, 22(4): 605-611.

采用窄带图切割的多目重构方法

Multi-view Reconstruction Using Band Graph-Cuts

  • 摘要: 针对目前多目重构研究中物体表面获取和凹陷区域恢复的难题,提出采用窄带图切割的可见外壳和多目立体匹配相融合的方法.在可见外壳的拓扑约束下,通过最小化能量泛函使得重构表面与多目立体匹配得到的稠密点云形状一致;并利用窄带图切割计算能量泛函的全局最优解.实验结果表明,该方法能重构封闭表面和凹陷区域;窄带图切割在获得最优解的同时提高了计算效率,与全图切割相比速度提高了3倍以上.

     

    Abstract: This paper proposes a new multi-view reconstruction algorithm by combining the visual hull and multi-view stereo matching based on the band graph-cuts technique.The reconstructed surface is made consistent with the dense point cloud obtained from the multi-view stereo matching through the minimization of the functional that is constrained by the topology of the built visual hull.The globally optimal solution can be achieved with the minimum cut of a band weighted graph meanwhile the overall performance is greatly improved.Experimental results show our method is able to recover surface concavities and watertight surface.Compared with conventional graph-cuts approaches,more than three folds acceleration is gained with our approach.

     

/

返回文章
返回