三角化曲面的Faradian采样分割
Farthest sampling segmentation of triangulated surfaces
摘要:
在本文中,我们介绍Faradian采样分割(FSS),一种新的方法,用于分割的三角形表面,它包括两个基本步骤:计算的一个子矩阵$W^k$的亲和矩阵$W$和应用的k-均值聚类算法的行的$W^k$。子矩阵$W^k$是通过计算所有三角形和少数特殊三角形之间的亲和度得到的:这些三角形在定义的度量中是最远的。这相当于选择$W$列的样本,但未完全构建它。所提出的方法是计算成本低于其他分割算法,因为它只计算几列的$W$,它不需要特征分解的$W$或任何子矩阵的$W$。我们证明了$W$在由$W^k$的列生成的空间上的正交投影与$W$在由使用$W^k$的列作为$W$的样本的Nyström方法计算的$k$特征向量生成的空间上的正交投影重合。此外,示出了对于增加的尺寸$k$,$W^k$的行之间的邻近关系倾向于忠实地反映$W$的对应行之间的邻近。FSS方法不依赖于必须手动调整的参数,并且非常灵活,因为它可以处理任何度量来定义三角形之间的距离。数值实验与几个度量和各种各样的三维三角形网格表明,得到的分割计算小于10%的列$W$是一样好的,从聚类的行的全矩阵$W$。
英文摘要:
In this paper we introduce Farthest Sampling Segmentation (FSS), a new method for segmentation of triangulated surfaces, which consists of two fundamental steps: the computation of a submatrix $W^k$ of the affinity matrix $W$ and the application of the k-means clustering algorithm to the rows of $W^k$. The submatrix $W^k$ is obtained computing the affinity between all triangles and only a few special triangles: those which are farthest in the defined metric. This is equivalent to select a sample of columns of $W$ without constructing it completely. The proposed method is computationally cheaper than other segmentation algorithms, since it only calculates few columns of $W$ and it does not require the eigendecomposition of $W$ or of any submatrix of $W$. We prove that the orthogonal projection of $W$ on the space generated by the columns of $W^k$ coincides with the orthogonal projection of $W$ on the space generated by the $k$ eigenvectors computed by Nyström's method using the columns of $W^k$ as a sample of $W$. Further, it is shown that for increasing size $k$, the proximity relationship among the rows of $W^k$ tends to faithfully reflect the proximity among the corresponding rows of $W$. The FSS method does not depend on parameters that must be tuned by hand and it is very flexible, since it can handle any metric to define the distance between triangles. Numerical experiments with several metrics and a large variety of 3D triangular meshes show that the segmentations obtained computing less than the 10% of columns $W$ are as good as those obtained from clustering the rows of the full matrix $W$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。