三维重构中层次性断层数据的处理技术  

Technical treatment of layering cross-sections data in 3D reconstruction

作　　者：黄永丽[1] 李晔[1] 

机构地区：[1]郑州轻工业学院计算机与通讯工程学院,河南郑州450002

出　　处：《计算机工程与设计》2008年第24期6407-6409,共3页Computer Engineering and Design

基　　金：河南省自然科学基金项目(0611054800)

摘　　要：针对基于层次性断层数据的三维重构,通过引入嵌套矩阵构造嵌套树,再通过构造最小生成树的方法来解决轮廓线相邻层次间的对应问题,并以两轮廓环相互覆盖区域的大小作为约束条件。该方法把基于覆盖的轮廓线对应法和基于全局的轮廓线对应方法结合起来,降低了重构时轮廓拓扑关系判断的复杂性,又能准确的确定轮廓线间的对应关系。Aiming at 3D reconstruction based on layering cross-sections data, the idea that nested trees are built through the introduction of nested matrix is put forward. Then the minimum spanning tree is constructed in order to resolve the correspondence of contours between two adjacent cross-sections. What is more, while constructing the minimum spanning tree, mutual overlapping area is used as a constraining condition. The method combines the correspondences based on overlapping and that based on global, which not only reduces the complexity of topology judgment but also determines the correspondence of contours accurately.

关 键 词：三维重构 嵌套树 嵌套矩阵 最小生成树 拓扑重构 

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