检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]西北农林科技大学机械与电子工程学院,陕西杨凌712100 [2]西北农林科技大学信息工程学院,陕西杨凌712100
出 处:《西北农林科技大学学报(自然科学版)》2012年第10期167-172,共6页Journal of Northwest A&F University(Natural Science Edition)
基 金:国家自然科学基金项目(60975007)
摘 要:【目的】研究轮廓线三维表面模型重建中存在的嵌套、分叉和投影交叉等复杂轮廓的轮廓匹配问题。【方法】在定义轮廓距离基础上,制定了轮廓匹配的2条准则,构成拓扑结构简单的轮廓对,针对一对多且投影交叉的轮廓对,采用等比放大方法进行预处理,利用简约束算法对放大后的轮廓对进行剖分。用实际算例对提出的重建方法进行了验证。【结果】算例验证表明,提出的重建方法能快速进行拓扑结构复杂的轮廓剖分,重建合理的表面网格模型,重建只存在轮廓嵌套的南瓜模型需19.673ms,重建最复杂的莲藕模型需51.845ms。【结论】通过对果实MRI图像序列提取的轮廓进行剖分,能够快速进行果实表面重建。【Objective】This paper attempted to remove the difficulties in contours matching due to some complex contour pairs with nests,branches,and projective intersections in the process of the contourbased three dimensional(3D) surface model reconstruction.【Method】On the basis of two defined contours distances,two criteria were proposed for contour matching to construct the simple contours pairs.A novel geometric amplification method was put forward to preprocess one-to-many contour pairs with projective intersections;the simple-constrained algorithm was applied to triangulate the amplified contour pairs.The proposed reconstruction method was validated with practical examples.【Result】The experimental results verify that the proposed method is able to achieve faster contours triangulation of the complex topologies,and reasonable reconstruction of mesh surface models.19.673ms was needed for the reconstruction of pumpkin model with contour nesting,and 51.845 ms for reconstruction of the most complex lotus model.【Conclusion】This paper proposed a novel method for fast surface models reconstruction of fruits by triangulating the contour pairs extracted from MRI image sequence.
分 类 号:TP391.41[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28