共查询到18条相似文献,搜索用时 359 毫秒
1.
对医学图像体数据及重构几何模型进行虚拟剖切,可以方便地看到内部的组织,便于观察和诊断,可用于医疗放射治疗规划.针对医学图像重建的表面几何模型,提出了对模型进行平面剖切、立体开窗及任意交互切割的算法.平面剖切和开窗是用剖切面或剖切体对重建模型施以剖切,在剖切面上生成边序列及顶点序列;由此边序列和顶点序列生成封闭的边界轮廓,确定各轮廓的包含关系;对封闭轮廓包围的截面区域进行Delaunay三角剖分,得到完整的剖切后的表面模型.任意交互切割过程是交互生成切割路径,确定切割边界,并沿切割边界对表面模型进行切割.实验结果证明了本文算法的有效性.采用本文算法可得到良好的虚拟剖切效果. 相似文献
2.
基于医学图像序列轮廓线重建三维表面的改进算法 总被引:6,自引:0,他引:6
基于医学图像重建三维表面是医学图像可视化的主要手段之一。传统的方法直接采用由序列轮廓线生成的三角片来拟合曲面,重建的效果和表达的信息均有限。该文提出一种基于三角Bernstein-Bezier曲面拟合和纹理映射的改进算法,即在对生成的单个三角片进行三角Bernstein-Bezier曲面拟合的基础上,通过对三角片三顶点法矢的二次插值来重新计算三角Bernstein-Bezier曲面的法矢,使拟合曲面的显示效果整体连续且光滑;同时通过对重建后的表面模型施以平面剖切,并给剖切后模型的断面和截面贴上纹理来增加图像信息。该算法已运用于伽玛刀治疗计划系统中,重建效果较传统算法取得了较大的改善。 相似文献
3.
针对三维重建表面模型的任意切面纹理显示,分为3D纹理采样和切面纹理映射两阶段。前者通过模型包围盒及模型横断面轮廓定位纹理部位并去掉图像背景,经采样形成多精度3D纹理;后者先计算剖切平面和模型及纹理空间中包围盒交面,然后利用向量叠加原理及立方体线性插值方法快速提取纹理空间的交面图像,经Alpha测试后映射到模型空间相应切面上,形成具有切面纹理的剖切模型。实验表明,该方法克服了面绘制技术不能体现内部数据的缺点,有效地提高了大数据量模型任意剖切面纹理绘制速度。 相似文献
4.
针对现有医学图像技术中三维模型的虚拟剖切面重建算法功能单一、不能完成复杂路径剖切面展开的缺点,提出基于空间任意标志点的剖切面重建算法。该算法可以沿三维空间中的任意路径完成虚拟剖切面展开,包括确定标志点、拟合虚拟剖切路径、重建剖切面3个部分。实验证明该算法可以得到稳定优异的重建图像,精确度较高。 相似文献
5.
基于等值面优化重建医学图像的改进算法 总被引:1,自引:0,他引:1
医学图像可视化技术利用二维医学图像序列重建出三维模型,为医生提供了直观、全面、准确的病灶和正常组织信息.传统的方法直接采用由序列轮廓线生成的三角片来拟合曲面,重建的速度与效果均有限.为了提高医学三维图像的重建速度和效果,在对用于构造等值面的MCfMarching cubes)算法进行分析的基础上,提出一种三点线性插值法代替相邻多边形顶点的位置,并对等值面法向矢量场进行平滑,实现了目标图像的三维重建. 相似文献
6.
三角网格剖切算法的研究 总被引:3,自引:0,他引:3
在三维表面模型重建及可视化中,为了便于观察三维表面模型的截面大小和形状,需要对模型进行剖切操作。因为一般的模型网格数据既包含空间坐标信息又包含拓扑信息,而对表面模型进行剖切不但会改变其空间信息,而且还会破坏拓扑信息。本文提出一种表面模型剖切的方法,使剖切后的表面模型仍能保持正确的拓扑信息。 相似文献
7.
8.
9.
10.
医务工作者常常通过观察和分析二维切片方式对病人进行诊断医疗,难于想象“病灶”的三维信息,这种方式效率低,难度大、风险高;针对这一问题,利用第4代可视化语言IDL构建并实现了适合医务工作者需要的医学图像三维可视化及分析系统,该系统根据医学图像(如DICOM)的自身信息能够对断层序列切片进行快速精确重建,进而可以对重建结果进行剖分、组织提取、窗宽窗位调节、任意方向切片提取等操作,对病人的医疗诊断具有很高的使用价值。 相似文献
11.
Surface reconstruction by multiaxial triangulation 总被引:2,自引:0,他引:2
Outlines for reconstructing object surfaces are traditionally drawn from sequential images in parallel planes. The method presented here instead supports complex object topologies by drawing contours from multiaxial image planes. Multiaxial triangulation of an object in a given data volume involves four steps. First, the user generates contours interactively by selecting sample planes inside the data volume, then drawing object contours from the image corresponding to this sample plane. Our algorithm for multiaxial triangulation then processes these contours to verify consistency within and between sample planes. Second, it uses the sample planes containing the contours to partition the data volume into a divided volume. The contours are partitioned against the plane boundaries, and the contour parts (chains) are associated with faces, edges, and vertices in the divided volume. Third, these chains are joined into closed loops in the divided volume. Fourth, the loops are triangulated patchwise to create the surface model 相似文献
12.
The article describes a reconstruction pipeline that generates piecewise-planar models of man-made environments using two calibrated views. The 3D space is sampled by a set of virtual cut planes that intersect the baseline of the stereo rig and implicitly define possible pixel correspondences across views. The likelihood of these correspondences being true matches is measured using signal symmetry analysis [1], which enables to obtain profile contours of the 3D scene that become lines whenever the virtual cut planes intersect planar surfaces. The detection and estimation of these lines cuts is formulated as a global optimization problem over the symmetry matching cost, and pairs of reconstructed lines are used to generate plane hypotheses that serve as input to PEARL clustering [2]. The PEARL algorithm alternates between a discrete optimization step, which merges planar surface hypotheses and discards detections with poor support, and a continuous optimization step, which refines the plane poses taking into account surface slant. The pipeline outputs an accurate semi-dense Piecewise-Planar Reconstruction of the 3D scene. In addition, the input images can be segmented into piecewise-planar regions using a standard labeling formulation for assigning pixels to plane detections. Extensive experiments with both indoor and outdoor stereo pairs show significant improvements over state-of-the-art methods with respect to accuracy and robustness. 相似文献
13.
快速的人脸轮廓检测及姿态估计算法 总被引:1,自引:0,他引:1
提出一种基于人脸特征区域划分的人脸轮廓检测方法和快速人脸姿态估计方法.该方法根据特征点在人脸的分布情况将人脸划分为9个区域.对于每个选定的区域,首先检测出其初始轮廓线,然后用三次多项式对其进行曲线拟合处理,最后把不同区域的轮廓线连接起来得到完整的人脸轮廓.此外,为了快速、准确地估计出人脸的姿态,本文从人脸的对称性出发,提出了进行人脸姿态估计的面积模型和近似平面模型.实验表明,本文所提出的轮廓检测方法对于复杂背景中具有不同姿态的人脸图像可以得到较满意的检测结果.和其它检测方法相比,本文方法具有模型简单、计算速度快等优点. 相似文献
14.
This paper presents a new graph cut-based multiple active contour algorithm to detect optimal boundaries and regions in images
without initial contours and seed points. The task of multiple active contours is framed as a partitioning problem by assuming
that image data are generated from a finite mixture model with unknown number of components. Then, the partitioning problem
is solved within a divisive graph cut framework where multi-way minimum cuts for multiple contours are efficiently computed
in a top-down way through a swap move of binary labels. A split move is integrated into the swap move within that framework
to estimate the model parameters associated with regions without the use of initial contours and seed points. The number of
regions is also estimated as a part of the algorithm. Experimental results of boundary and region detection of natural images
are presented and analyzed with precision and recall measures to demonstrate the effectiveness of the proposed algorithm. 相似文献
15.
16.
17.