基于区域分割的点云骨架提取算法

针对L_1中值骨架提取方法存在迭代次数较多、相邻区域较紧密时骨架易跨越区域等问题,提出一种分区提取骨架的算法。结合点云区域的连通性及局部相关性,采用马尔科夫随机场模型,将给定点云分割成不同区域。在相同标号的区域根据区域大小和点集数自适应地计算不同的初始收缩邻域尺度,用L_1中值不断收缩迭代提取各区域的骨架分支,通过主成分分析及连接角判定骨架连接方式,并根据该连接方式将骨架分支连接成完整的点云骨架。实验结果表明,该算法能够自适应地提取点云骨架,减少点云收缩的迭代次数,保持模型原有的拓扑结构,对于含有区域紧密度不均匀的模型有较好的效果。     

基于蚁群和自适应滤波的模糊聚类图像分割

为了改进模糊C均值聚类(FCM)算法对初始聚类中心敏感、抗噪性能较差、运算量大的问题,提出一种新的基于蚁群和自适应滤波的模糊聚类图像分割方法(ACOAFCM).首先,该方法利用改进的蚁群算法确定初始聚类中心,作为FCM初始参数,克服FCM算法对初始聚类中心的敏感;其次,采用自适应中值滤波抑制图像噪声干扰,增强算法的鲁棒性;最后,用直方图特征空间优化FCM目标函数,对图像进行分割,减少运算量.实验结果表明,该方法克服了FCM算法对初始聚类中心的依赖,抗噪能力强,收敛速度快,分割精度高.     

保特征的点云骨架提取算法

三维模型的骨架提取是计算机图形学中一个重要的研究方向。对于有噪声的点云模型,曲线骨 架提取的难点在于保持正确的拓扑结构以及良好的中心性;对于无噪声的点云模型,曲线骨架提取的难点在于 对模型细节特征的保留。目前主流的点云骨架提取方法往往无法同时解决这 2 个难点。算法在最优传输理论的 基础之上结合聚类的思想,将点云骨架提取的问题转化为一个最优化问题。首先使用最优传输得到原始点云与 采样点云之间的传输计划。然后使用聚类的思想将原始点云进行分割,采样点即成为了簇的中心。接着通过簇 与簇之间的调整与合并减少聚类个数,优化聚类结果。最后通过迭代的方式得到粗糙的骨架并使用插点操作进 行优化。大量实验结果表明,该算法在有噪声与无噪声的三维点云模型上均能提取出质量良好的曲线骨架并保 留模型的特征。     

基于狮群优化的改进K-Means聚类算法研究

针对K-Means聚类算法对初始聚类中心选择依赖性强的问题,利用狮群优化算法的快速收敛性及易于获取全局最优解的优势,提出了一种基于狮群优化的改进K-Means聚类算法。通过狮群优化算法对狮王不断迭代更新,优化狮王位置,将算法停止执行时的狮王最优解作为聚类中心,替代传统算法经过随机初始化得到具有不确定因素的聚类中心。选择UCI数据集进行验证,实验结果表明,改进算法的聚类效果较好,有效降低了K-Means对初始聚类中心的依赖。将改进的K-Means聚类算法应用于点云精简过程,获得了较好的点云精简效果。     

自适应三维美工树木骨架提取算法

提出了一种自适应三维美工树木骨架提取算法。该算法主要由前处理、骨架提取和后处理三个步骤组成。前处理阶段依次完成预计算操作,包括对具有几何相似性的子枝进行聚类,自适应生成每个子枝点云的聚类长度阈值,确定子枝之间的父子关系等;骨架提取阶段实现对每个子枝点云的聚类,及其对应骨架点、骨架曲线的生成等操作;后处理阶段完成孤立骨架节点去除,整棵树所有骨架曲线光滑化等处理。该树木骨架提取过程完全由计算机自动完成,不需要用户的任何干预。实验结果表明,采用该算法得到的美工树木骨架既能完整地保持树木模型的形状,又能正确地实现树木模型的拓扑结构。     

一种新的虚拟血管镜自动导航路径生成方法

血管的中心路径提取是虚拟血管镜的重要组成部分, 它提供了自动导航的路径. 本文提出一种新的内窥路径生成方法, 用改进L1中值算法对体素点云化的脑血管数据进行骨架的提取. 首先,对核磁共振成像(Magnetic resonance imaging, MRI)增强血管数据进行基于统计的分割算法进行分割; 其次,对推广的Roberts算子在体素空间分割出的单体素点边界进行体素点的点云化, 生成点云模型; 最后,在点云空间中运用基于法向信息的L1中值算法进行骨架提取. 该过程克服了传统方法在体素中进行骨架提取时对数据缺失、孤点敏感的局限性, 并且对下采样后的点云化数据提取的骨架效率高, 骨架居中性较好, 最终把骨架用作脑血管虚拟内窥的自动漫游路径, 实现自动导航.     

K-means算法的初始聚类中心的优化

传统的K-means算法对初始聚类中心敏感,聚类结果随不同的初始输入而波动,针对K-means算法存在的问题,提出了基于密度的改进的K-means算法,该算法采取聚类对象分布密度方法来确定初始聚类中心,选择相互距离最远的K个处于高密度区域的点作为初始聚类中心,理论分析与实验结果表明,改进的算法能取得更好的聚类结果。     

基于等级划分的复杂点云骨架提取算法

对于复杂点云的骨架提取,由于原始点云的遮挡、缺失、分布不均、分支复杂等原因,所提取骨架会产生断裂、拓扑结构错误等问题.针对复杂结构点云的骨架提取,提出了一种基于等级划分的复杂点云骨架提取算法(multilevel divided skeleton extraction,MDSE).使用L1-medial提取初始骨架点,将初始骨架点连接成单分支骨架线,通过对单分支结构的初始骨架线进行等级划分,利用连通分支的平均分叉角确定骨架线断裂位置,由底至项修补断裂骨架线;最后采用Cardinal样条曲线改善骨架形态,形成完整且符合原始点云拓扑结构的骨架线.实验结果表明,该算法能够从复杂点云中提取出较为完整、拓扑结构正确的骨架线.     

基于自适应蒙皮变形的点云姿态迁移

为避免全局平滑系数的DDM在点云姿态迁移时出现撕裂、扭曲以及姿态学习不充分等问题,提出一种自适应权重蒙皮变形点云姿态迁移方法.首先利用改进的拉普拉斯收缩骨架提取方法提取源点云模型和参考点云模型的同构骨架,用聚类优化关节点位置,并计算2个同构骨架之间的关节点的几何变换;然后根据顶点变形程度和聚类划分改进DDM的逐点平滑系数,利用骨架层次信息对源姿态进行刚性蒙皮权重绑定;最后将蒙皮问题重新表达成求解刚性变换矩阵,实现姿态迁移.在现有MPI DYNA的人体点云模型和MIT的动物点云模型上进行骨架提取与蒙皮变形实验,实验结果表明,所提方法可生成无冗余分支和关节点的同构骨架,得到细节保持良好、姿态学习较充分的目标姿态模型.     

k中心点聚类算法在层次数据的应用

探讨了近年来提出的聚类概念与聚类过程、k中心点聚类的算法,在此基础上提出了一种基于层次数据模型的k中心聚类的改进算法.该算法一方面针对层次变量提出了相关的中值点概念;另一方面对传统k中心点算法进行了改进.最后对改进算法的复杂度进行了分析,由分析结果得出改进算法要比传统k中心点算法每次迭代耗费时间略少,但在总耗费时间上远远小于k中心点算法,大幅度提高了算法的整体性能.     

Curve skeleton extraction by coupled graph contraction and surface clustering

In this paper, we present a practical algorithm to extract a curve skeleton of a 3D shape. The core of our algorithm comprises coupled processes of graph contraction and surface clustering. Given a 3D shape represented by a triangular mesh, we first construct an initial skeleton graph by directly copying the connectivity and geometry information from the input mesh. Graph contraction and surface clustering are then performed iteratively. The former merges certain graph nodes based on computation of an approximate centroidal Voronoi diagram, seeded by subsampling the graph nodes from the previous iteration. Meanwhile, a coupled surface clustering process serves to regularize the graph contraction. Constraints are used to ensure that extremities of the graph are not shortened undesirably, to ensure that skeleton has the correct topological structure, and that surface clustering leads to an approximately-centered skeleton of the input shape. These properties lead to a stable and reliable skeleton graph construction algorithm.Experiments demonstrate that our skeleton extraction algorithm satisfies various desirable criteria. Firstly, it produces a skeleton homotopic with the input (the genus of both shapes agree) which is both robust (results are stable with respect to noise and remeshing of the input shape) and reliable (every boundary point is visible from at least one curve-skeleton location). It can also handle point cloud data if we first build an initial skeleton graph based on k-nearest neighbors. In addition, a secondary output of our algorithm is a skeleton-to-surface mapping, which can e.g. be used directly for skinning animation.Highlights(1) An algorithm for curve skeleton extraction from 3D shapes based on coupled graph contraction and surface clustering. (2) The algorithm meets various desirable criteria and can be extended to work for incomplete point clouds.     

应用遗传模糊聚类实现点云数据区域分割

为了准确地实现点云数据的区域分割,将基于遗传算法的模糊聚类算法应用于逆向工程中的点云数据区域分割中。首先估算出法矢量、高斯曲率和平均曲率,并与坐标一起组成八维特征向量,用加权距离代替欧氏距离,然后通过遗传算法获得全局最优解的近似解;最后将近似解作为模糊聚类的初始解进行迭代,实现点云数据的区域分割,从而避免传统FCM算法的局部性和对初始解的敏感性,减少了迭代次数。以汽车钣金件为例,证明了应用遗传模糊聚类实现点云数据区域分割的有效性,并验证了该方法能快速、准确地实现点云数据的区域分割。     

Research on geometric features and point cloud properties for tree skeleton extraction

To solve skeleton extraction problems in the tree point cloud model, branch geometric features and local properties of point cloud are utilized to optimize tree skeleton extraction. First of all, according to the attribute information estimation and normal vector adjustment of point cloud neighbor domain, branch segmentation is made by estimated values and geometric features. Skeleton nodes are extracted in the branch subset in segmentations. Then, a graph is constructed based on skeleton node set and tree skeleton is reconstructed in this weighted directed graph. Finally, according to the tree growth characteristics, cubic Hermite curves are utilized to optimize the skeleton curve. This method is applied in the point cloud model of three-kind trees and it is compared with the skeleton extraction method based on voxel switch and point cloud contraction. The experiment results show that this method displays strong anti-interference and high-precision characteristics at branch bifurcation and crossed ending parts of fine tree branches. Thus, features of tree branches can be described more perfectly, obtaining the skeleton curve closer to the main axis.     

Skeleton-based intrinsic symmetry detection on point clouds

We present a skeleton-based algorithm for intrinsic symmetry detection on imperfect 3D point cloud data. The data imperfections such as noise and incompleteness make it difficult to reliably compute geodesic distances, which play essential roles in existing intrinsic symmetry detection algorithms. In this paper, we leverage recent advances in curve skeleton extraction from point clouds for symmetry detection. Our method exploits the properties of curve skeletons, such as homotopy to the input shape, approximate isometry-invariance, and skeleton-to-surface mapping, for the detection task. Starting from a curve skeleton extracted from an input point cloud, we first compute symmetry electors, each of which is composed of a set of skeleton node pairs pruned with a cascade of symmetry filters. The electors are used to vote for symmetric node pairs indicating the symmetry map on the skeleton. A symmetry correspondence matrix (SCM) is constructed for the input point cloud through transferring the symmetry map from skeleton to point cloud. The final symmetry regions on the point cloud are detected via spectral analysis over the SCM. Experiments on raw point clouds, captured by a 3D scanner or the Microsoft Kinect, demonstrate the robustness of our algorithm. We also apply our method to repair incomplete scans based on the detected intrinsic symmetries.     

基于改进K-means算法的关键帧提取

为克服传统聚类算法在关键帧提取过程中对初始参数较为敏感的问题,提出一种基于改进K-means算法的关键帧提取算法。在人工鱼群算法中,依据人工鱼群体相似度对提取的特征向量进行自组织聚类,采用进步最大原则使人工鱼聚集在几个极值点位置,以每个极值点群体相似度最高的人工鱼为初始聚类中心,执行K-means算法,得到聚类结果,并提取关键帧。实验结果表明,该算法的准确率较高,能较好地表达视频的主要内容。     

基于互信息和散度改进K-Means在交通数据聚类中的应用

K-means算法是一种常用的聚类算法,已应用于交通热点提取中.但是,由于聚类数目和初始聚类中心的主观设置,已有的聚类方法提取的交通热点往往难以满足要求.利用互信息和相对熵,提出SK-means算法,并应用于交通热点提取中.在所提方法中,基于不同点之间的互信息寻找初始聚类中心;此外,基于互信息和散度的比值,确定聚类数目.将所提方法应用于成都某段时间交通热点提取中,并与传统的K-means比较,实验结果表明,所提方法具有更高的聚类精度,提取的热点更符合实际.     

基于曲率法线流的树点云骨架提取方法

针对树木点云拓扑结构复杂、特征细节繁多等问题,提出一种基于点云收缩提取曲线骨架的算法。首先,为了在点云表面直接应用网格收缩算法,对点云进行局部主成分分析和Delaunay三角剖分;其次,针对树木点云拓扑结构复杂和末枝细节繁多等问题,用曲率法线流算子对点云进行收缩,针对树木枝条细长且弯曲幅度平缓等特点,利用改进后的QEM网格简化方法将三角网格折叠成一维曲线骨架;最后,将得到的曲线骨架进行连通和居中处理。该算法直接在点云上进行操作,不需要额外的信息和预处理操作,对噪声和残缺点云有良好的鲁棒性。实验证明,该算法提取的树木点云骨架充分表达了树木在自然环境下的生物性结构和特征,相对于rosa、L1-中轴等经典算法,在树木点云的骨架提取速度上提高3倍以上,枝条重建度提高25%。     

SkelTre

Terrestrial laser scanners capture 3D geometry of real world objects as a point cloud. This paper reports on a new algorithm developed for the skeletonization of a laser scanner point cloud. The skeletonization algorithm proposed in this paper consists of three steps: (i) extraction of a graph from an octree organization, (ii) reduction of the graph to a skeleton, and (iii) embedding of the skeleton into the point cloud. For these three steps, only one input parameter is required. The results are validated on laser scanner point clouds representing 2 classes of objects; first on botanic trees as a special application and secondly on popular arbitrary objects. The presented skeleton found its first application in obtaining botanic tree parameters like length and diameter of branches and is presented here in a new, generalized version. Its definition as Reeb Graph, proofs the usefulness of the skeleton for applications like shape analysis. In this paper we show that the resulting skeleton contains the Reeb Graph and investigate the practically relevant parameters: centeredness and topological correctness. The robustness of this skeletonization method against undersampling, varying point density and systematic errors of the point cloud is demonstrated on real data examples.