Perception of 3-D surfaces from 2-D contours

Inference of 3-D shape from 2-D contours in a single image is an important problem in machine vision. The authors survey classes of techniques proposed in the past and provide a critical analysis. They show that two kinds of symmetries in figures, which are known as parallel and skew symmetries, give significant information about surface shape for a variety of objects. They derive the constraints imposed by these symmetries and show how to use them to infer 3-D shape. They also discuss the zero Gaussian curvature (ZGC) surfaces in depth and show results on the recovery of surface orientation for various ZGC surfaces     

Fast generation of spherical slicing surfaces for irregular volume rendering

An efficient algorithm for generating a set of concentric spherical slicing surfaces for volume rendering of irregular volume datasets is presented. Our original algorithm, which approximates volume rendering by accumulating concentric spherical slicing surfaces from back to front, generates these surfaces by means of a conventional isosurface generation algorithm. However, this causes a performance bottleneck. To solve the problem, we propose a proliferous generation of slicing surfaces from seed cells, which are automatically determined according to the extremum points of the values of distances from a viewing point. A benchmark test shows that this approach can improve the performance significantly. In addition, we compare this algorithm with a raycasting algorithm that we proposed previously, and discuss a criterion for selecting which one to use for maximizing the performance     

Automatic mesh generation in 2-D and 3-D objects

The object of the paper is to propose a simple method of mesh generation for objects with complicated boundary configurations and present a program which can generate the element data required for Finite Element Analysis based on these methods. The area to be meshed is considered as a combination of different sub-areas which are further sub-divided into the required number of triangular elements. The main part of the program developed in FORTRAN is included in this paper.     

Interpolation techniques for 3-D object generation

The technique of interpolation (or blending) and its generalization is considered in this paper. A unifying model for generating 3-D objects using this technique is presented. Various factors which affect the shape of generated objects are identified. Several illustrative examples of 3-D objects generated by this technique, using linear as well as non-linear interpolation, are presented. Although many of the objects have complex shapes, they are represented by simple closed form mathematical equations.     

Methods for electronic 3-D moving pictures without glasses

Approaches are described for image acquisition and playback for 3-D computer graphics, 3-D television and 3-D theatre movies without special glasses. Projection lamps, spatial light modulators, CRTs and dynamic scanning are all eliminated by the application of an active image array, all static components and a semispecular screen. The resulting picture shows horizontal parallax with a wide horizontal view field (up to 360°), giving a holographic appearance in full colour with smooth, continuous viewing without speckle. Static component systems are compared with dynamic component systems using both linear and circular arrays. Computer graphic systems are shown, which allow complex shaded colour images to extend from the viewer's eyes to infinity. Large screen systems visible by hundreds of people are feasible by the use of low f-stops and high-gain screens in projecttion. Screen geometries and special screen properties are shown.     

Retrieving articulated 3-D models using medial surfaces

We consider the use of medial surfaces to represent symmetries of 3-D objects. This allows for a qualitative abstraction based on a directed acyclic graph of components and also a degree of invariance to a variety of transformations including the articulation of parts. We demonstrate the use of this representation for 3-D object model retrieval. Our formulation uses the geometric information associated with each node along with an eigenvalue labeling of the adjacency matrix of the subgraph rooted at that node. We present comparative retrieval results against the techniques of shape distributions (Osada et al.) and harmonic spheres (Kazhdan et al.) on 425 models from the McGill Shape Benchmark, representing 19 object classes. For objects with articulating parts, the precision vs recall curves using our method are consistently above and to the right of those of the other two techniques, demonstrating superior retrieval performance. For objects that are rigid, our method gives results that compare favorably with these methods. A preliminary version of this article was published in EMMCVPR 2005. In this extended version we have included results on the significantly larger McGill Shape Benchmark, making a stronger case for the advantages of our method for models with articulating parts. We have also included expanded introduction, medial surface computation, matching, indexing, experimental results, and discussion sections, along with several new figures.     

Modeling deformable surfaces with level sets

This article describes how to use level sets to represent and compute deformable surfaces. A deformable surface is a sequence of surface models obtained by taking an initial model and incrementally modifying its shape. Typically, we can parameterize the deformation over time, and thus we can imagine that a surface moves or flows under the influence of a vector field. The surface flow, v, can be determined as a function of spatial position (and time), or it can depend on the shape of the surface itself. The latter is called a geometric flow. Deformable surfaces have been used to solve a variety of problems in image processing, computer vision, visualization, and graphics. In graphics, for instance, deformable surface models have been used to form sequences of shapes that animate the morphing of one object into another. They have also been used to denoise or smooth surface models derived from a set of noisy 3D measurements.     

Fast algorithm for 3-D vascular tree modeling

In this short paper, accelerated three-dimensional computer simulations of vascular trees development, preserving physiological and haemodynamic features, are reported. The new computation schemes deal: (i). with the geometrical optimization of each newly created bifurcation; and (ii). with the recalculation of blood pressures and radii of vessels in the whole tree. A significant decrease of the computation time is obtained by replacing the global optimization by the fast updating algorithm allowing more complex structure to be simulated. A comparison between the new algorithms and the previous one is illustrated through the hepatic arterial tree.     

Touch-enabled haptic modeling of deformable multi-resolution surfaces

Currently, interactive data exploration in virtual environments is mainly focused on vision-based and non-contact sensory channels such as visual/auditory displays. The lack of tactile sensation in virtual environments removes an important source of information to be delivered to the users. In this paper, we propose the touch-enabled haptic modeling of deformable multi-resolution surfaces in real time. The 6-DOF haptic manipulation is based on a dynamic model of Loop surfaces, where the dynamic parameters are computed easily without subdividing the control mesh recursively. A local deforming scheme is developed to approximate the solution of the dynamics equations, thus the order of the linear equations is reduced greatly. During each of the haptic interaction loop, the contact point is traced and reflected to the rendering of updated graphics and haptics. The sense of touch against the deforming surface is calculated according to the surface properties and the damping-spring force profile. Our haptic system supports the dynamic modeling of deformable Loop surfaces intuitively through the touch-enabled interactive manipulation.     

基于侧影轮廓的三维模型快速重建

提出一种基于侧影轮廓进行三维模型重建的新方法,将传统的三维锥形交叉问题转换成二维轮廓交叉问题。首先,将不同视角下的二维侧影轮廓反投影到若干个平行的三维平面上,然后在三维平面上计算所有反投影轮廓的交叉轮廓,最后对相邻三维平面上的交叉轮廓进行匹配并重建物体的表面。理论分析和实验结果表明该算法的时间复杂度和视角数目呈线性关系。由于该方法主要以增加视角数目来提高模型的精确度,所以比三维锥形交叉的方法能更快速地重建物体精确的三维模型。     

Animation of deformable models using implicit surfaces

The paper presents a general approach for designing and animating complex deformable models with implicit surfaces. Implicit surfaces are introduced as an extra layer coating any kind of structure that moves and deforms over time. Offering a compact definition of a smooth surface around an object, they provide an efficient collision detection mechanism. The implicit layer deforms in order to generate exact contact surfaces between colliding bodies. A simple physically based model approximating elastic behavior is then used for computing collision response. The implicit formulation also eases the control of the object's volume with a new method based on local controllers. We present two different applications that illustrate the benefits of these techniques. First, the animation of simple characters made of articulated skeletons coated with implicit flesh exploits the compactness and enhanced control of the model. The second builds on the specific properties of implicit surfaces for modeling soft inelastic substances capable of separation and fusion that maintain a constant volume when animated     

Monocular 3D tracking of deformable surfaces using sequential second order cone programming

Reconstructing structures of deformable objects from monocular image sequences is important for applications like visual servoing and augmented reality. In this paper, we propose a method to recover 3D shapes of deformable surfaces using sequential second order cone programming (SOCP). The key of our approach is to represent the surface as a triangulated mesh and introduce two sets of constraints, one for model-to-image keypoint correspondences which are SOCP constraints, another for retaining the original lengths of the mesh edges which are non-convex constraints. In the process of tracking, the surface structure is iteratively updated by solving sequential SOCP feasibility problems in which the non-convex constraints are replaced by a set of convex constraints over a local convex region. The shape constraints used in our approach is more generic than previous methods, that enables us to reliably recover surface shapes with smooth, sharp and other complex deformations. The capability and efficiency of our approach are evaluated quantitatively with synthetic image sequences and qualitatively with real image sequences.     

超宽带穿墙雷达三维快速成像算法

超宽带穿墙雷达是一种能够隔墙探测和定位的新型实时成像雷达系统,在城区巷战,反恐斗争和人质救援中应用非常广泛.穿墙雷达对成像的实时性要求非常高,传统的成像算法已不能满足计算时间上的要求.本文将基于逆边界散射变换的快速成像算法应用到穿墙雷达系统中,利用FDTD数值仿真验证了对隐藏在墙后目标的三维成像结果,并分析了墙壁对目标定位误差的影响.研究表明,与传统的后向投影成像算法相比,基于逆边界散射变换的成像算法计算效率高,实时性好,且能对目标边界形状清晰成像.     

一种快速三维散乱点云的三角剖分算法

改进了一种三维散乱点云三角剖分算法。三角剖分是点云数据曲面重构的主要算法之一,但针对三维散乱点云的三角剖分存在剖分效率不高,剖分得到的三角曲面形状无法控制,细节特征表现不足的问题。提出了基于空间栅格划分的三角剖分算法,并提出了一个新的评价函数,以控制三角网格曲面的生长。实验证明,改进后的算法极大的提高了剖分效率,而且能保证最终生成的三角网格曲面平滑而保有丰富的细节特征,适用于在虚拟现实、曲面重构等领域推广使用。     

基于FDK法的三维CT快速计算方法

在三维CT的图像重建过程中,单圆轨迹锥形束扫描是一种常用的方法,其算法普遍采用滤波反投影的形式(FBP)实现。由于滤波可以用FFT快速实现,因此反投影部分占据了计算的主要时间。论文提出同时从四个视角计算插值并作反投影累加,利用三角函数的周期性,减少传统算法中反投影阶段的乘法和正、余弦的计算次数,从而加快计算速度。分析和实验结果表明该方法对减少反投影计算所需的时间是行之有效的。     

基于Harris的快速3-D特征点检测算子

图像匹配是数字摄影测量和计算机视觉领域中的关键技术.目前,基于特征点的匹配广泛应用于图像匹配中,至关重要的是如何定位特征点,高精度的特征点产生高精度的匹配结果.本文提出了3-D Harris特征点检测算子,分两个步骤实现:采用高斯算子平滑灰度突变点和利用Harris算子提出视频中的像素角点.实验结果表明了3-D Harris算子的高效性和精确性.     

一种快速的可变形物体的碰撞检测算法

为实现虚拟环境中可变形物体与刚体间实时的碰撞检测,提出了一种快速的基于混合包围盒层次结构的并行碰撞检测算法。算法充分利用包围盒在检测速度和精度上的不同侧重,对可变形物体建立Sphere和AABB混合包围盒层次树,对刚体建立Sphere和OBB混合包围盒层次树;每个物体的混合包围盒层次树又分成上层、中层和下层,每层使用不同的包围盒;在碰撞检测遍历时,上层使用Sphere和Sphere相交检测快速排除不相交物体,在中层使用Sphere和OBB的相交检测进一步排除物体相交的可能性,在下层使用AABB和OBB的相交检测较精确地确定物体是否相交;采用多线程技术,在多核设备上实现并行碰撞检测算法。实验结果表明,与经典的AABB算法相比较,该算法在效率方面具有明显优势,能够满足可变形物体与刚体的碰撞检测要求。     

Matching 3-D anatomical surfaces with non-rigid deformations using octree-splines

This paper presents a new method for determining the minimal non-rigid deformation between two 3-D surfaces, such as those which describe anatomical structures in 3-D medical images. Although we match surfaces, we represent the deformation as a volumetric transformation. Our method performs a least squares minimization of the distance between the two surfaces of interest. To quickly and accurately compute distances between points on the two surfaces, we use a precomputed distance map represented using an octree spline whose resolution increases near the surface. To quickly and robustly compute the deformation, we use a second octree spline to model the deformation function. The coarsest level of the deformation encodes the global (e.g., affine) transformation between the two surfaces, while finer levels encode smooth local displacements which bring the two surfaces into closer registration. We present experimental results on both synthetic and real 3-D surfaces.     

Dynamic interaction between deformable surfaces and nonsmooth objects

In this paper, we introduce new techniques that enhance the computational performance for the interactions between sharp objects and deformable surfaces. The new formulation is based on a time-domain predictor-corrector model. For this purpose, we define a new kind of (/spl pi/, /spl beta/, I)-surface. The partitioning of a deformable surface into a finite set of (/spl pi/, /spl beta/, I)-surfaces allows us to prune a large number of noncolliding feature pairs. This leads to a significant performance improvement in the collision detection process. The intrinsic collision detection is performed in the time domain. Although it is more expensive compared to the static interference test, it avoids portions of the surfaces passing through each other in a single time step. In order to resolve all the possible collision events at a given time, a penetration-free motion space is constructed for each colliding particle. By keeping the velocity of each particle inside the motion space, we guarantee that the current colliding feature pairs will not penetrate each other in the subsequent motion. A static analysis approach is adopted to handle friction by considering the forces acting on the particles and their velocities. In our formulation, we further reduce the computational complexity by eliminating the need to compute repulsive forces.     

基于霍特林变换的三维医学图像快速配准算法

提出了一种新的基于霍特林变换的三维医学图像快速配准算法,这是将数据压缩技术用于图像配准的一种创新性尝试。传统的基于灰度的方法需要考虑整个三维数据的灰度信息,计算复杂度大,无法满足临床需要。论文将Otus算法与互信息量技术相结合提出了一种新的图像分割算法,用于提取待配准物体,从而得到物体的向量表示;然后通过霍特林变换的平移和旋转性质完成配准。实验结果表明此方法能准确,快速地处理图像刚性配准问题,特别适用于三维医学图像的配准。