一种由轮廓线重建物体表面的方法

针对基于轮廓线拼接重建物体表面所出现的轮廓对应和分叉问题,提出了一种通过体数据转换由轮廓线实现重建物体表面的方法。在分析体数据构造中出现逼近精度问题的前提下,通过提高轮廓线上点的密度,生成精确度较高的体数据。该方法通过对相邻层轮廓线区域的集合运算,只对处于集合运算解中的像素点进行距离函数值的计算。采用MC（Marching Cubes）算法生成等值面,完成物体的表面重建。实验结果表明,该方法能顺利解决基于轮廓线拼接重建物体表面中出现的轮廓对应问题和分叉问题,既提高重建表面精确度,又加快整个表面的重建速度,是一种可行的方法。     

像素的移动体素面绘制算法

移动立方体算法是最具影响力的等值面构造算法。本文以移动立方体算法为基础,提出了像素点移动体素面绘制算法。根据物体表面的显示特性和体素特点,利用像素点组成的边界体素绘制物体的等值面,实现物体表面的三维重建。在实验中,对一组CT图像中的骨骼组织进行三维表面重建和显示,并与用Matlab绘制函数重建的三维结果进行比较。实验分析表明,该算法能对物体进行三维重建,避免了二义性问题,但重建表面不光滑,重建花费的时间较长。     

一种无需包围盒的自适应采样可见外壳生成算法

针对可见外壳的体构造方法需要事先知道包围盒和转成三角面表示时低曲率区域存在大量小三角面的问题,本文提出一种基于体素生长的自适应采样可见外壳构造方法.将物体三维表面视为等值面,用多目立体匹配的方法求得等值面附近的一个空间点;然后以该点为中心构造体素,将体素在等值面上生长直至遍历整个等值面;同时根据体素的曲率变化控制下一个生长体素的大小.实验结果表明本文方法在不知道物体包围盒大小的情况下能够计算出可见外壳,而自适应采样可解决过多小三角面的问题.     

三维人体表面重建

人体的形状比较复杂,存在多个分支,从扫描得到的序列轮廓线重构人体表面会存在空洞。通过定义场函数将一系列平面上的多条轮廓线转换为体数据,并采用Marching Cubes方法抽取等值面,将多轮廓线间的形体重构转化为体数据中的等值面构造。采用该方法重建的人体表面完整,光滑且符合精度要求。     

海量散乱点的曲面重建算法研究

基于海量散乱点的曲面重建在机械产品测量造型、计算机视觉、根据切片数据的医学图像重建等领域中有重要应用.给出了一种以物体表面上不附加任何几何和拓扑信息(包括测点法矢、曲面边界信息)的散乱点集为处理对象,自动生成物体表面的三角网格模型的算法.该算法首先根据测点的邻近测点估算曲面在该测点处的法矢,并采用优化的顺序对法矢方向进行调整以使各测点处的法矢都指向曲面外侧,最后用步进立方体算法输出三角网格模型.采用新的方法计算切平面,不但进一步提高了效率,而且改善了曲面边界及尖锐棱边区域的重建效果.还提出并解决了法矢方向传播中可能出现的局部“孤岛”问题.同时,提出了一种对海量数据进行空间划分的算法,从而大大提高了海量数据的处理效率.应用实例表明,算法效果良好     

等值面的高质量显示算法实现三维物体表面的重建

介绍了一个能有效消除等值面显示中易出现的锯齿状走样现 象,可以生成非常细腻的三维物体表面图象的等值面高质量显示算法。论述了采用体素级的 等值面直接显示算法实现三维物体表面重构的基本方法。     

基于医学体数据生成四面体网格的方法

为了从医学体数据直接构造四面体网格,提出一种基于栅格的网格生成算法.该算法的主要思想是从背景栅格中提取并填充代表区域边界的等值面.首先,对医学体数据进行预处理与采样,构建一个背景栅格.其次,用对偶方法从栅格提取三角表面网格,用于分段线性逼近等值面.然后,对栅格中所有位于等值面之内或与等值面相交的立方体,用预定义的模板分解成四面体单元.最后,用Laplacian平滑技术优化四面体网格.在均匀网格的基础上,研究了自适应网格生成算法,在保持网格几何精度的同时精简单元数量,以提高有限元计算效率.给出了从CT数据生成人体股骨远端四面体网格的实例,该网格模型被用于虚拟膝关节镜手术.     

一种医学图像的3-D表面重建方法

等值面绘制算法是医学图像表面重建的一种重要方法,但是它需要用户根据经验设定阈值。本文运用OTSU算法来获取体数据各类组织的灰度阈值,由此求得各类组织的灰度均值,并以此作为等值面阈值。在VTK中的重建实例表明,该方法能够体现出不同组织影像的灰度分布特点,使重建后的图像信息更丰富、表面更平滑。     

医学图像3维重建模型的虚拟剖切算法

对医学图像体数据及重构几何模型进行虚拟剖切,可以方便地看到内部的组织,便于观察和诊断,可用于医疗放射治疗规划.针对医学图像重建的表面几何模型,提出了对模型进行平面剖切、立体开窗及任意交互切割的算法.平面剖切和开窗是用剖切面或剖切体对重建模型施以剖切,在剖切面上生成边序列及顶点序列;由此边序列和顶点序列生成封闭的边界轮廓,确定各轮廓的包含关系;对封闭轮廓包围的截面区域进行Delaunay三角剖分,得到完整的剖切后的表面模型.任意交互切割过程是交互生成切割路径,确定切割边界,并沿切割边界对表面模型进行切割.实验结果证明了本文算法的有效性.采用本文算法可得到良好的虚拟剖切效果.     

一种基于深度和颜色的3D表面重建方法

为了快速、有效地对三维物体的表面进行重建，提出了一种基于深度和颜色的3D表面重建方法。该方法利用同一物体在空间稀疏分布的不同视点下的多幅深度图像，根据3D物体表面同一点在不同深度图像上颜色和纹理的一致性，通过逆投影变换，可将图像中像素点映射到三维空间中的正确位置。然后在以物体为中心的单个坐标系下，进行数据融合，可得到三维物体表面各点的三维数据。实验结果表明该方法具有复杂度恒定、获取图像真实感强等优点，适用于形状、结构草杂的物体重建。     

Reconstruction and Simplification of Surfaces from Contours

In this paper we consider the problem of reconstructing triangular surfaces from given contours. An algorithm solving this problem must decide which contours of two successive slices should be connected by the surface (branching problem) and, given that, which vertices of the assigned contours should be connected for the triangular mesh (correspondence problem). We present a new approach that solves both tasks in an elegant way. The main idea is to employ discrete distance fields enhanced with correspondence information. This allows us not only to connect vertices from successive slices in a reasonable way but also to solve the branching problem by creating intermediate contours where adjacent contours differ too much. Last but not least we show how the 2D distance fields used in the reconstruction step can be converted to a 3D distance field that can be advantageously exploited for distance calculations during a subsequent simplification step.     

Discontinuity-preserving and viewpoint invariant reconstruction ofvisible surfaces using a first order regularization

This paper describes the application of a first order regularization technique to the reconstruction of visible surfaces. Our approach is a computationally efficient first order method that simultaneously achieves approximate invariance and preservation of discontinuities. It is also robust with respect to the smoothing parameter λ. The robustness property to λ allows a free choice of λ without struggling to determine an optimal λ that provides the best reconstruction. A new approximately invariant first order stabilizing function for surface reconstruction is obtained by employing a first order Taylor expansion of a nonconvex invariant stabilizing function that is expanded at the estimated value of the squared gradient instead of at zero. The data compatibility measure is the squared perpendicular distance between the reconstructed surface and the constraint surface. This combination of stabilizing function and data compatibility measure is necessary to achieve invariance with respect to rotations and translations. Sharp preservation of discontinuities is achieved by a weighted sum of adjacent pixels. The results indicate that the proposed methods perform well on sparse noisy range data. In addition, the volume between two surfaces normalized by the surface area (interpreted as average distance between two surfaces) is proposed as an invariant measure for the comparison of reconstruction results     

一种改进的薄壁文物碎片特征轮廓线提取技术

针对使用一般的边界提取方法提取三维网格模型特征轮廓线不完整问题,提出一 种新的薄壁文物碎片特征轮廓线提取的综合算法。区别了特征轮廓线和轮廓线的概念,引入主 轮廓线和次轮廓线以及二级邻接生长曲面的概念。主轮廓线的提取使用改进的基于边重数判断 的提取方法;提出次轮廓线的一种新的提取方法：首先对三维网格曲面分割并识别断裂面,然 后对断裂面的二级邻接生长曲面进行曲面扫描,提取次轮廓线;最后从主轮廓线和次轮廓线中 得到三维模型的特征轮廓线。使用该算法准确地提取了文物碎片的特征轮廓线,实验结果表明 此方法稳定且准确。     

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

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

基于轮廓形变的复杂表面重构

本文提出了一种基于自由形变（Free-Form Deformation, FFD）及外轴投影（External Axes Projection, EAP）的复杂表面重构算法.该算法以目标形状的切片轮廓作为输入数据,此后轮廓被嵌入到高维空间有向距离场中,在此隐式空间中,算法主要分为以下三步：生成计算序列,计算序列由计算单元组成,每一个计算单元包含上下相邻的两个轮廓;根据相邻轮廓间的拓扑关系,进行外轴投影（EAP）,以解决潜在的分支问题;在每个计算单元中,根据轮廓长度决定自由形变方向,并进行自由形变,根据自由形变结果,建立轮廓间顶点的一一对应关系,并以此进行表面重构.该方法具有以下特点：输入轮廓可具有任意拓扑结构;所生成表面与输入轮廓完全贴合,生成表面准确,无自我重叠,拓扑关系不发生改变;算法高度并行,执行效率高.实验结果证明,该算法可以解决复杂表面的重构问题.     

A new unsupervised cube-based algorithm for iso-surface generation

This paper introduces a new algorithm which automatically produces polygonal representations of 3D structures within a volume data set built from a stack of parallel cross-sections. Several methods of 3D surface reconstruction have already been proposed ranging from heuristic approaches for constructing 3D surfaces from 2D contours to the Marching Cubes (MC) approach where the different configurations are checked systematically. Instead, we define a cube-to-cube connection based upon geometrical closeness provided by convex hulls computation. We further evaluate the precision of 3D models reconstructed from synthetic and real data obtained in confocal microscopy and compare it with the conventional MC algorithm. We also discuss improvements that allow to reduce the number of generated surface patches and the ability to be used in 3D quantitative tasks.     

Three-dimensional reconstruction of biological objects using a graphics engine

A common problem in the study of biological material is the determination of three-dimensional structure from serial sections. The large number of sections required to obtain sufficient internal detail of a structure results in enormous processing requirements. These requirements can now be satisfied by current graphics engine technology in combination with image-digitizing hardware. The previously onerous tasks of manipulating and displaying 3D objects become routine with this combination of technologies. We report a computer-assisted reconstruction system on a graphics engine-based workstation. The system accepts images from any video source and includes a utility for aligning adjacent video images. Also available is an editor for geometric object entry and editing. More novel in our approach is the use of video interiors in 3D displays in addition to contours and tiled surfaces. Video interiors is a form of display in which digitized pixels interior to objects are revealed by cutaway blocks.     

Speeding up isosurface extraction using interval trees

The interval tree is an optimally efficient search structure proposed by Edelsbrunner (1980) to retrieve intervals on the real line that contain a given query value. We propose the application of such a data structure to the fast location of cells intersected by an isosurface in a volume dataset. The resulting search method can be applied to both structured and unstructured volume datasets, and it can be applied incrementally to exploit coherence between isosurfaces. We also address issues of storage requirements, and operations other than the location of cells, whose impact is relevant in the whole isosurface extraction task. In the case of unstructured grids, the overhead, due to the search structure, is compatible with the storage cost of the dataset, and local coherence in the computation of isosurface patches is exploited through a hash table. In the case of a structured dataset, a new conceptual organization is adopted, called the chess-board approach, which exploits the regular structure of the dataset to reduce memory usage and to exploit local coherence. In both cases, efficiency in the computation of surface normals on the isosurface is obtained by a precomputation of the gradients at the vertices of the mesh. Experiments on different kinds of input show that the practical performance of the method reflects its theoretical optimality     

Surface measures for accuracy evaluation in 3d face reconstruction

In this paper, we propose surface based metrics to evaluate the accuracy of the 3D face reconstruction algorithms. The continuous 3D surfaces obtained due to reconstruction algorithms for a 3D face is considered to obtain a numerical estimate. The surface based measures namely the volume of difference, average edge distance and intercept edge distance metrics are proposed. These measures are computed by considering continuous 3D surfaces to ascertain the quality of the reconstruction techniques. Experimental validation of the proposed approach is performed using the data acquired by 2D cameras and 3D scanning technologies.