基于多尺度的Marching Cube改进算法

在医学图像三维重建中,经典的等值面重建算法Marching Cube是一种比较常用的算法。该算法具有可以在给定阈值的情况下提取任意三维数据场的等值面的优点,但因需计算大量的数据和三角面片而使得该算法速度较慢。提出了使用不同尺度的等值面重建理论,实现了一个多尺度的Marching Cube算法,经过实验对比,该算法比原Marching Cube算法具有效率高、速度快的优点。     

基于等值面优化重建医学图像的改进算法

医学图像可视化技术利用二维医学图像序列重建出三维模型,为医生提供了直观、全面、准确的病灶和正常组织信息.传统的方法直接采用由序列轮廓线生成的三角片来拟合曲面,重建的速度与效果均有限.为了提高医学三维图像的重建速度和效果,在对用于构造等值面的MCfMarching cubes)算法进行分析的基础上,提出一种三点线性插值法代替相邻多边形顶点的位置,并对等值面法向矢量场进行平滑,实现了目标图像的三维重建.     

基于等值面点的快速三维表面重建算法

医学图像可视化技术利用二维医学图像序列重建出三维模型,为医生提供了直观、全面、准确的病灶和正常组织信息。传统的方法直接采用由序列轮廓线生成的三角片来拟合曲面,重建的速度与效果均有限。本文采用了一种直接绘制等值面点的三维重建算法,该算法只对视觉有贡献,约占总体数据的2%左右表面点进行遍历绘制,大大提高了绘制速度。另外,本文提出了由等值面数据计算法向量的方法,实现了在只有等值面坐标数据的情况下计算法向量。     

等值面的高质量显示方法

等值面是描述体数据中所含特定器官表面的有效方式，因此对等值面进行快速高质量的显示就显得非常重要。与以往的等值面显示算法不同，本文提出的方法不需要用三角形网格去逼近等值面然后再对三角形网格进行显示，而是直接对原始等值面进行显示，从而避免了三角化过程中的计算损耗和精度损失等问题，保证了等值面轮廓不会出现锯齿状现象，使等值面的显示既快速又准确。     

等值面的高质量显示方法

等值面是描述体数据中所含特定器官表面的有效方式，因此对等值面进行快速高质量的显示就显得非常重要。与以往的等值面显示算法不同，本文提出的方法不需要用三角形网格去逼近等值面然后再对三角形网格进行显示，而是直接对原始等值面进行显示，从而避免了三角化过程中的计算损耗和精度损失等问题，保证了等值面轮廓不会出现锯齿状现象，使等值面的显示既快速又准确。     

MC 算法在 CT 医学图像三维重建中的应用*

MC 算法是三维重建面绘制的经典方法,采用等值面提取的方式把所需的数据分离出来进行重建。通过对 MC 算法的原理进行分析,结合 VTK 类库编程,研究基于 MC 算法提取CT 图像病灶的方法,并通过坐标平滑的方法对算法进行改进,提高三维重建的平滑显示效果和重建速度。     

移动立方体算法的研究和改进

CT三维重建技术是辅助医生对病情进行分析和显示的有效工具,它极大地提高了医疗诊断的准确性。移动立方体法（Marching Cubes,MC）是一种经典的医学图像三维重建算法,但是在实际使用中还是存在着一些缺点。针对传统MC算法出现的两个问题：（1）用直线代替双曲线来构造等值面会产生误差;（2）重建过程中大量时间耗费在检查空立方体上,提出了一种改进的MC算法,分别通过切片图像间的插值和基于分割的快速查找法来对此进行解决。通过实验表明,改进的MC算法比起传统MC算法,在三维重建的效果和效率上都得到了很大的提高。     

一种改进的MC算法

为了对等值面与子等值面进行提取和分组,在MC算法原理的基础上,提出了一种改进的等值面提取与子等值面分组算法。该算法首先将数据场分解为点、棱边、面与体元的拓扑结构;然后在整个数据场范围内求所有棱边与等值面的交点,并在面内连接交点形成面与等值面的交线,交线在体元内连接生成空间多边形;接着通过三角化各个体元内的空间多边形得到由顶点表与三角形表组成的等值面数据;最后根据三角形在顶点处的连接关系,采用种子算法对属于同一子等值面的三角形与顶点进行标记,属于同一子等值面的顶点与三角形将被存放在独立的顶点表与三角形表中。实验结果表明,该算法可以高效地实现等值面提取与子等值面的分组。     

面跟踪算法在快速三维重建中的应用研究

现代医学影像设备所产生的图像的分辨率越来越高、数据越来越多,使得许多三维重建的算法只能在高档的工作站上实现。本文提出了一种可以高速处理高解析度医学图像的三维重建算法,即面跟踪法,在当前主流计算机的硬件条件下,可以快速地处理高分辨率的医学图像,且能实时地显示重建数据。     

基于GPU的医学图像快速面绘制

提出了一种医学图像快速面绘制的方法,该方法将新一代图形处理器GeForce 8800的特性和MC（Marching Cubes）算法相结合。利用几何着色器的数据批处理能力在每个立方体中提取等值面并生成三角形带;在片段着色器上采用Phong光照模型对生成三角形渲染显示。建模和显示过程均在GPU上完成,对CPU的依赖低。实验表明,在保证绘制效果的前提下,该方法可在通用PC平台上实现大小为512×512×400的CT数据的实时建模,有很好的实用价值。     

基于图像分割的三维重构

三维重构方法是医学图像可视化系统、治疗计划系统的重要技术。基于图像分割的三维重构方法结合了图像分割、等值面抽取、网格简化三种技术,是不同于传统Marching Cubes算法的一种三维重构方法。它首先将医学图像分割为二值图,然后利用Marching Cubes方法进行等值面抽取,最后对得到的网格模型进行简化。实验结果表明,基于图像分割的三维重构方法加快了Marching Cubes的运算速度,改善了重构的效果,有利于实现对基于三维重构的大型几何模型的实时绘制和交互。     

A surface reconstruction algorithm for topology optimization

For mechanical structural design, topology optimization is often utilized. During this process, a topologically optimized model must be converted into a parametric CAD solid model. The key point of conversion is that a discretized shape of a topologically optimized model must be smoothed, but features such as creases and corners must be retained. Thus, a surface reconstruction algorithm to produce the parametric CAD solid model from a topologically optimized model is proposed in this paper. Our presented algorithm consists of three parts: (1) an enclosed isosurface geometry from which the topologically optimized model is generated, (2) features detected and (3) the parametric CAD solid model reconstructed as biquartic surface splines. In order to generate an enclosed isosurface model effectively, we propose an algorithm based upon the marching cubes method to detect elements intersected by an isosurface. After generating an enclosed isosurface model, we produce biquartic surface splines. By applying our algorithm to an enclosed isosurface model, it is possible to produce smoothed biquartic surface splines with features retained. Some examples are shown and the effectiveness of our algorithm is discussed in this paper.     

Mesh filtering algorithm using an adaptive 3D convolution kernel applied to a volume-based vector distance field

This paper addresses the problem of feature preserving mesh filtering, which occurs in surface reconstruction of scanned objects, which include acquisition noise to be removed without altering sharp edges. We propose a method based on a vector field distance transform of the mesh to process. It is a volume-based implicit surface modeling, which provides an alternative representation of meshes. We use an adaptive 3D convolution kernel applied to the voxels of the distance transform model. Weights of the kernel elements are determined according to the angle between the vectors of the implicit field. We also propose a new adaptation of the Marching Cubes algorithm in order to extract the isosurface from the vector implicit field after the filtering process. We compare our method to the previous one introduced using the vector field representation and to other feature preserving adaptive filtering algorithms. According to error metric evaluations, we show that our new design provides high quality filtering results while better preserving geometric features.     

Using difference intervals for time-varying isosurface visualization

We present a novel approach to out-of-core time-varying isosurface visualization. We attempt to interactively visualize time-varying datasets which are too large to fit into main memory using a technique which is dramatically different from existing algorithms. Inspired by video encoding techniques, we examine the data differences between time steps to extract isosurface information. We exploit span space extraction techniques to retrieve operations necessary to update isosurface geometry from neighboring time steps. Because only the changes between time steps need to be retrieved from disk, I/O bandwidth requirements are minimized. We apply temporal compression to further reduce disk access and employ a point-based previewing technique that is refined in idle interaction cycles. Our experiments on computational simulation data indicate that this method is an extremely viable solution to large time-varying isosurface visualization. Our work advances the state-of-the-art by enabling all isosurfaces to be represented by a compact set of operations.     

Constructing Isosurfaces from 3D Data Sets Taking Account of Depth Sorting of Polyhedra

Creating and rendering intermediate geometric primitives is one of the approaches to visualisze data sets in 3D space.Some algorithms have been developed to construct isosurface from uniformly distributed 3D data sets.These algorithms assume that the function value varies linearly along edges of each cell.But to irregular 3D data sets,this assumption is inapplicable.Moreover,the detth sorting of cells is more complicated for irregular data sets,which is indispensable for generating isosurface images or semitransparent isosurface images,if Z-buffer method is not adopted.In this paper,isosurface models based on the assumption that the function value has nonlinear distribution within a tetrahedron are proposed.The depth sorting algorithm and data structures are developed for the irregular data sets in which cells may be subdivided into tetrahedra.The implementation issues of this algorithm are discussed and experimental results are shown to illustrate potentials of this technique.     

基于距离倒数加权法的等值面绘制简化算法

对常用的几种等值面绘制算法进行了分析,考查了其计算的复杂度,提出一种基于距离倒数加权的简易算法.该算法的基本思想是:利用计算机图像的像素离散性,结合实际工程应用上有一些情况中采样点位置稳定不变的特点,不需要先生成等值线,而是逐一扫描所有像素,以简单的函数计算其等值面彩色值.通过与已知曲面函数的理想等值面对比分析表明,该算法在采样点达到一定密度时拟合较好.给出了主要数据结构和算法的C语言实现.     

Convex contouring of volumetric data

In this paper, we present a fast, table-driven isosurface extraction technique on volumetric data. Unlike Marching Cubes or other cell-based algorithms, the proposed polygonization generates convex negative space inside individual cells, enabling fast collision detection on the triangulated isosurface. In our implementation, we are able to perform over 2 million point classifications per second. The algorithm is driven by an automatically constructed lookup table that stores compact decision trees by sign configurations. The decision trees determine triangulations dynamically by values at cell corners. Using the same technique, we can perform fast, crack-free multiresolution contouring on nested grids of volumetric data. The method can also be extended to extract isosurfaces on arbitrary convex, space-filling polyhedra.     

交互式三维医学图像可视化系统MedVis

本文介绍了我们开发的三维医学图像可视化系统ＭｅｄＶｉｓ。绘制的实时性和系统的交互性是设计ＭｅｄＶｉｓ的两个重要原则。     

基于MC算法的医学建模方法与研究

针对现有医学图像特点,提出了一种医学三维建模的新方法.该方法基于传统MC算法,结合种子填充思想进行等值面扩展,并利用DMC方法进行插值位置取代,最后直接连接等值点生成多边形网,从而减少了面片数量,很好的解决了二义性问题.实验表明,该方法较传统方法在拓扑结构、存储空间和处理速度方面均有较大改善.