Consistent segmentation of 3D models

This paper proposes a method to segment a set of models consistently. The method simultaneously segments models and creates correspondences between segments. First, a graph is constructed whose nodes represent the faces of every mesh, and whose edges connect adjacent faces within a mesh and corresponding faces in different meshes. Second, a consistent segmentation is created by clustering this graph, allowing for outlier segments that are not present in every mesh. The method is demonstrated for several classes of objects and used for two applications: symmetric segmentation and segmentation transfer.     

COBRA: Compression of the Basis for PCA Represented Animations

In this paper, we present an extension of dynamic mesh compression techniques based on PCA. Such representation allows very compact representation of moving 3D surfaces; however, it requires some side information to be transmitted along with the main data. The biggest part of this information is the PCA basis, and since the data can be encoded very efficiently, the size of the basis cannot be neglected when considering the overall performance of a compression algorithm.
We present a new work in this area, as none of the papers about PCA based compression really addresses this issue. We will show that for an efficient and accurate encoding there are better choices than even sophisticated algorithms such as LPC.
We will present results showing that our approach can reduce the size of the basis by 90% with respect to direct encoding, which can lead to approximately 25% increase of performance of the compression algorithm without any significant loss of accuracy. Such improvement moves the performance of the PCA encoder beyond the performance of current state of the art dynamic mesh compression algorithms, such as the recently adopted MPEG standard, FAMC.     

Generating Segmented Quality Meshes from Images

Techniques devoted to generating triangular meshes from intensity images either take as input a segmented image or generate a mesh without distinguishing individual structures contained in the image. These facts may cause difficulties in using such techniques in some applications, such as numerical simulations. In this work we reformulate a previously developed technique for mesh generation from intensity images called Imesh. This reformulation makes Imesh more versatile due to an unified framework that allows an easy change of refinement metric, rendering it effective for constructing meshes for applications with varied requirements, such as numerical simulation and image modeling. Furthermore, a deeper study about the point insertion problem and the development of geometrical criterion for segmentation is also reported in this paper. Meshes with theoretical guarantee of quality can also be obtained for each individual image structure as a post-processing step, a characteristic not usually found in other methods. The tests demonstrate the flexibility and the effectiveness of the approach.

光纤Mesh网络动态组播业务疏导算法

针对当前低速组播业务请求与光网络高速波长传输容量的问题,基于光网络组播业务疏导模型,提出动态组播业务疏导算法,将新的组播业务请求疏导到已建立的光组播树上,达到提高网络资源的利用率、降低组播业务连接阻塞概率的目的。仿真结果表明,该算法可有效地改善网络性能。     

基于DSDV的无线Mesh网络跨层路由设计

在DSDV协议的基础上,提出一种跨层路由设计的方法,选择一条具有合理长度和最小重传概率的路由进行测试。该链路质量机制可应用到基于IEEE802.11x的无线Mesh网络中,无须对现有的MAC层进行修改,即可作为一个单独模块加入到现有协议。在多跳网络中使用该跨层方案进行路由选择,能节省系统开销,优化系统的整体性能。     

Mesh网络中两跳邻居地址借用策略

IEEE 802.15.5标准提供了mesh联网功能,它为节点绑定逻辑地址,因而具有不需要路由表进行路由的优点。在一个动态性很强的mesh网络中,节点加入或离开网络会造成孤儿节点问题,即新来节点因其父节点无剩余地址可分配导致其无法加入网络。提出了适用于mesh网络的两跳邻居节点地址借用策略以克服孤儿节点问题,提高节点加入成功率和地址利用率。理论分析和仿真表明,所提出的地址借用策略在节点加入成功率、地址利用率和能耗方面均优于已有地址分配方案。     

基于改进Marching Cubes算法的乳腺MRI肿块三维重建

核磁共振成像MRI(Magnetic Resonance Imaging)是目前乳腺癌肿块诊断的常用辅助手段,对图像的正确解析是关键,针对传统MC(Marching Cubes)面绘制算法应用于乳腺MRI图像的不足,提出了改进方法。首先利用乳腺MRI序列图相邻帧间图像灰度分布的相似,肿块组织形状相近等相关性,在RSF(Region-Scalable Fitting)模型的基础上利用初始轮廓迭代的方法提取肿块区域。接着将多组参数下获得的结果,依据每一帧与其前后帧的重叠面积越大越好作为条件进行筛选,使提取的等值面最优化。最后采用基于加权二次误差度量的三角形折叠方法,对面绘制产生的大量三角网格进行了简化。将所提出的改进方法应用于30例乳腺MRI序列图,实验结果表明,对于乳腺MRI肿块的三维重建在精度和绘制速度上都比使用传统MC算法有很大提高。     

Multiple levels of cell by cell Adaptive Mesh Refinement in the Lagrangian step of the ALE code CORVUS

A multi-level cell by cell Adaptive Mesh Refinement (AMR) hydrodynamics capability has been developed for the Lagrangian step of the 2D Arbitrary Lagrangian Eulerian (ALE) code CORVUS. Connectivity arrays are used rather than a hierarchical data structure. We solve only on the dynamic unstructured mesh rather than on every level of a refinement hierarchy. The strength, artificial viscosity, slide and programmed burn methods have been generalised to work with AMR. Results are presented for a range of Lagrangian test problems.     

Paint Mesh Cutting

We present a novel progressive painting‐based mesh cut out tool, called Paint Mesh Cutting, for interactive mesh segmentation. Different from the previous user interfaces, the user only needs to draw a single stroke on the foreground region and then obtains the desired cutting part at an interactive rate. Moreover, the user progressively paints the region of interest using a brush and has the instant feedback on cutting results as he/she drags the mouse. This is achieved by efficient local graph‐cut based optimizations based on the Gaussian mixture models (GMM) on the shape diameter function (SDF) metric of the shape. We demonstrate a number of various examples to illustrate the flexibility and applicability of our system and present a user study that supports the advantages of our user interface.