A highly solid model boundary preserving method for large-scale parallel 3D Delaunay meshing on parallel computers

In this paper, we propose a novel parallel 3D Delaunay triangulation algorithm for large-scale simulations on parallel computers. Our method keeps the 3D boundary representation model information during the whole parallel 3D Delaunay triangulation process running on parallel computers so that the solid model information can be accessed dynamically and the meshing results can be very approaching to the model boundary with the increase of meshing scale. The model is coarsely meshed at first and distributed on CPUs with consistent partitioned shared interfaces and partitioned model boundary meshes across processors. The domain partition aims at minimizing the edge-cuts across different processors for minimum communication cost and distributing roughly equal number of mesh vertices for load balance. Then a parallel multi-scale surface mesh refinement phase is iteratively performed to meet the mesh density criteria followed by a parallel surface mesh optimization phase moving vertices to the model boundary so as to fit model geometry feature dynamically. A dynamic load balancing algorithm is performed to change the partition interfaces if necessary. A 3D local non-Delaunay mesh repair algorithm is finally done on the shared interfaces across processors and model boundaries. The experimental results demonstrate our method can achieve high parallel performance and perfect scalability, at the same time preserve model boundary feature and generate high quality 3D Delaunay mesh as well.     

任意拓扑三角形网格的全局参数化

提出了一种零亏格的任意拓扑流形三角形网格自动全局参数化方法 .算法首先采用顶点对合并的网格简化方法构造一个网格的累进表示 ,在进行网格简化的同时 ,对被删除的顶点相对于顶点合并操作所得到的新顶点的邻域进行局部参数化 ,由此得到一个带局部参数化信息的累进网格 ;然后将网格简化所得到的基网格进行中心投影到一个单位球面上 ,并采用累进恢复的方法将删除的顶点按与删除时相反的顺序逐次添加回网格上来 ,所添加顶点的坐标不再是其删除前的坐标值 ,而是由局部参数化信息计算得到 ,并且保证是位于单位球面上的 .由此得到原始网格的单位球面参数化网格     

结合整体一致性和局部差异性的图像目标显著性检测

目的 为准确描述图像的显著信息,提出一种结合整体一致性和局部差异性的显著性检测方法,并将显著性特征融入到目标分割中。方法 首先,利用频率调谐法(IG)对目标整体特征的一致性进行显著性检测。然后,引入NIF算法检测显著目标的局部差异性。最后结合两种算法形成最终的显著性检测方法,并应用于图像目标分割。结果 在公认的Weizmann数据集上验证本文方法显示目标的绝对效率并与其他算法对比,实验结果表明本文方法在精确率,召回率,F1-measure(分别为0.445 6,0.751 2,0.576 4)等方面优于当前流行的算法。并且在融合显著性的图像目标分割中,取得满意的实验结果。结论 提出一种新的显著性检测算法,综合体现目标的整体和局部特征,并在公开数据集上取得较高的统计评价。实验结果表明,该算法能够对自然图像进行较准确的显著性检测,并成功地应用于自然图像的目标分割。     

基于正则化一维卷积神经网络的网格模型显著性检测

三维形状的显著性在形状分析与处理中有不可忽视的作用.现有的三角网格显著性检测方法大多依赖某种人工设计的几何特征,缺乏灵活性.为此,提出一种基于特征融合学习的显著区域检测方法,以适应不同类别的形状.首先计算形状的多种几何特征,然后把多尺度的低层次特征输入到一维卷积神经网络中;通过优化中心正则化损失函数,得到高层次、可判别的特征向量,同时也得到显著区域检测结果.在普林斯顿网格数据集上的实验结果表明,该方法适用于不同形状的显著性检测,检测结果具有一致性,并且相比对照算法具有更好的视觉效果和定量化指标评价.     

三角网格曲面角点的鲁棒性检测算法

为有效检测三角网格曲面上的角点特征,提出一种基于最小主曲率的角点检测算法.首先通过计算网格顶点处的最小主曲率,利用加权最小主曲率定义角点特征函数,并计算角点特征值;然后利用迭代阈值法自动产生检测阈值,以去除噪声和特征不明显的角点;最后采用非极大值抑制法消除局部邻域内的角点聚簇获取特征明显的角点.在此基础上,在多个尺度下分别计算每个网格顶点处的角点特征值,并通过加权将其合并成多尺度角点特征值,新的角点特征值使得角点检测算法具有较高的稳定性和鲁棒性.通过重复检测率实验和部分重叠曲面的配准实验,验证了文中算法的有效性与实用性.     

3D point of interest detection via spectral irregularity diffusion

This paper presents a method for detecting points of interest on 3D meshes. It comprises two major stages. In the first, we capture saliency in the spectral domain by detecting spectral irregularities of a mesh. Such saliency corresponds to the interesting portions of surface in the spatial domain. In the second stage, to transfer saliency information from the spectral domain to the spatial domain, we rely on spectral irregularity diffusion (SID) based on heat diffusion. SID captures not only the information about neighbourhoods of a given point in a multiscale manner, but also cues related to the global structure of a shape. It thus preserves information about both local and global saliency. We finally extract points of interest by looking for global and local maxima of the saliency map. We demonstrate the advantages of our proposed method using both visual and quantitative comparisons based on a publicly available benchmark.     

光学遥感图像低可观测区域舰船检测

海洋区域受云雾和气流影响导致其光学遥感图像局部对比度低、能见度差,给舰船监视带来困难。针对这一问题,首先利用多尺度相位谱对低可观测图像进行重构生成舰船目标的显著图,然后采用全局阈值快速提取具有较高显著度的感兴趣区域(ROI)。对各个ROI,首先利用其外部环状窗口各区间平均亮度的有序统计量来估计阈值对其进行二值分割,然后分别提取平均显著度、形状复杂度和空间扩展度特征,训练最小距离分类器对ROI进行鉴别,得到最终的检测结果。用大量受云雾影响的SPOT4全色影像进行实验,结果表明该算法能够满足应用要求。     

基于融合显著图和高效子窗口搜索的红外目标分割

为了快速精确地分割红外图像目标,提出一种基于融合显著图和高效子窗口搜索的红外目标分割方法.在获取图像超像素的基础上,提取每个区域增强的Sigma特征,并考虑邻域对比度、背景对比度、空间距离和区域大小的影响,构建局部显著图,接着利用全局核密度估计构建全局显著图,然后融合局部和全局显著图实现图像显著性检测,最后应用高效子窗口搜索方法检测和筛选目标,实现红外目标分割.实验结果表明,新方法的显著图结果目标区域一致高亮且边缘清晰,背景杂波抑制效果好,可实现快速精确的目标分割.     

一种保持纹理的网面简化算法

在计算机视觉领域,三维网面的简化不仅要求保持物体形状和拓扑关系,还要求保持物体表面法线,纹理,颜色和边缘等物体特征,以使计算机视觉系统能有效地表示,描述,识别和理解物体和场景,为此讨论了一种基于边操作（边收缩,边分裂）,并具有颜色或灰度纹理特征保持的三维网面的简化算法,该算法将网面不对称最大距离作为形状改变测度,将邻域内颜色或灰度最大改变量作为纹理改变测试,从而在大量简化模型数据的同时,有效地保持了模型的几何形状,拓扑关系,颜色或灰度特征,以及网面顶点均匀分布。     

An approach to automated decomposition of volumetric mesh

Mesh decomposition is critical for analyzing, understanding, editing and reusing of mesh models. Although there are many methods for mesh decomposition, most utilize only triangular meshes. In this paper, we present an automated method for decomposing a volumetric mesh into semantic components. Our method consists of three parts. First, the outer surface mesh of the volumetric mesh is decomposed into semantic features by applying existing surface mesh segmentation and feature recognition techniques. Then, for each recognized feature, its outer boundary lines are identified, and the corresponding splitter element groups are setup accordingly. The inner volumetric elements of the feature are then obtained based on the established splitter element groups. Finally, each splitter element group is decomposed into two parts using the graph cut algorithm; each group completely belongs to one feature adjacent to the splitter element group. In our graph cut algorithm, the weights of the edges in the dual graph are calculated based on the electric field, which is generated using the vertices of the boundary lines of the features. Experiments on both tetrahedral and hexahedral meshes demonstrate the effectiveness of our method.     

A new feature-preserving mesh-smoothing algorithm

We present a novel mesh denoising and smoothing method in this paper. Our approach starts by estimating the principal curvatures and mesh saliency value for each vertex. Then, we calculate the uniform principal curvature of each vertex based on the weighted average of local principal curvatures. After that, we use the weighted bi-quadratic Bézier surface to fit the neighborhood of each vertex using the least-square method and obtain the new vertex position by adjusting the parameters of the fitting surface. Experiments show that our smoothing method preserves the geometric feature of the original mesh model efficiently. Our approach also prevents the volume shrinkage of the input mesh and obtains smooth boundaries for non-closed mesh models.     

HexBox: Interactive Box Modeling of Hexahedral Meshes

We introduce HexBox, an intuitive modeling method and interactive tool for creating and editing hexahedral meshes. Hexbox brings the major and widely validated surface modeling paradigm of surface box modeling into the world of hex meshing. The main idea is to allow the user to box-model a volumetric mesh by primarily modifying its surface through a set of topological and geometric operations. We support, in particular, local and global subdivision, various instantiations of extrusion, removal, and cloning of elements, the creation of non-conformal or conformal grids, as well as shape modifications through vertex positioning, including manual editing, automatic smoothing, or, eventually, projection on an externally-provided target surface. At the core of the efficient implementation of the method is the coherent maintenance, at all steps, of two parallel data structures: a hexahedral mesh representing the topology and geometry of the currently modeled shape, and a directed acyclic graph that connects operation nodes to the affected mesh hexahedra. Operations are realized by exploiting recent advancements in grid-based meshing, such as mixing of 3-refinement, 2-refinement, and face-refinement, and using templated topological bridges to enforce on-the-fly mesh conformity across pairs of adjacent elements. A direct manipulation user interface lets users control all operations. The effectiveness of our tool, released as open source to the community, is demonstrated by modeling several complex shapes hard to realize with competing tools and techniques.     

A parallel log-barrier method for mesh quality improvement and untangling

The development of parallel algorithms for mesh generation, untangling, and quality improvement is of high importance due to the need for large meshes with millions to billions of elements and the availability of supercomputers with hundreds to thousands of cores. There have been prior efforts in the development of parallel algorithms for mesh generation and local mesh quality improvement in which only one vertex is moved at a time. But for global mesh untangling and for global mesh quality improvement, where all vertices are simultaneously moved, parallel algorithms have not yet been developed. In our earlier work, we developed a serial global mesh optimization algorithm and used it to perform mesh untangling and mesh quality improvement. Our algorithm moved the vertices simultaneously to optimize a log-barrier objective function that was designed to untangle meshes as well as to improve the quality of the worst quality mesh elements. In this paper, we extend our work and develop a parallel log-barrier mesh untangling and mesh quality improvement algorithm for distributed-memory machines. We have used the algorithm with an edge coloring-based algorithm for synchronizing unstructured communication among the processes executing the log-barrier mesh optimization algorithm. The main contribution of this paper is a generic scheme for global mesh optimization, whereby the gradient of the objective function with respect to the position of some of the vertices is communicated among all processes in every iteration. The algorithm was implemented using the OpenMPI 2.0 parallel programming constructs and shows greater strong scaling efficiency compared to an existing parallel mesh quality improvement technique.     

基于多尺度特征点识别与局部谱特征的离散数据匹配

为了实现部分重叠且不同视角的测量数据配准,提出多尺度特征点检测算法,可以从大量的原始数据中提取少量特征点。该算法包括离散曲率计算、双边滤波和特征点计算等步骤,特征点个数可以由尺度参数粗略控制。提出局部形状谱描述器来描述每个特征点的局部形状特性,首先利用局域点的距离和曲率信息构造关系矩阵,然后通过计算关系矩阵的特征值来构造谱描述器,利用该描述器可以方便地计算不同点集中各个特征点的对应关系,进而实现两个数据点集的配准。通过实例验证了该算法有较好的抗噪性和运行速度。