基于Snake的点模型谷脊线提取与优化

基于主动轮廓模型(Snake模型),提出一种点模型的谷脊线提取与优化方法。首先构建点模型的局部隐式曲面,并求出采样点的曲率值;然后通过求解主曲率极值点得到潜在谷脊点,依据特征点的主方向连接谷脊点生成谷脊折线段;最后利用主动轮廓模型对谷脊折线段进行优化。实验结果表明,算法是鲁棒的且能够生成光滑的谷脊线。     

基于谷脊线特征的三维网格模型简化方法

已有的网格简化算法容易丢失大量褶皱、边界等明显几何特征,导致简化后的模型在视觉上失真,为此提出一种基于谷脊线特征的三维网格模型简化方法.首先基于隐式曲面提取网格模型的谷脊线,得到体现重要性几何信息的模型特征点;然后利用层次化的紧支撑径向基函数(CS-RBFs)将上述模型特征点恢复成隐式曲面,得到简化后的三维网格模型.与N-Garland方法对比的实验结果表明,文中方法能显著地减少网格模型顶点数,生成的模型精确度高,生成过程高效.     

全局各向异性四边形主导网格重建方法

四边形网格的结构特点要求网格单元满足全局一致性,难以取得网格质量与表达效率之间的平衡.为此,提出一种基于全局的各向异性四边形主导网格重建方法,可生成网格质量好且冗余程度低的四边形网格.重建过程以主曲率线为基本采样单元,首先计算模型表面的主曲率场并对主曲率场积分,得到密集的主曲率线采样;再根据贪心算法,利用几何形体自身的各向异性找出冗余度最高的主曲率线并予以删除;如此循环,直至达到理想的采样密度.该重建方法适用于任意拓扑网格模型,所得到的各向异性四边形主导网格在网格模型分辨率下降时,由于始终保留重要主曲率线,从而可以更好地保持模型特征.同时,在基于贪心算法的渐进式主曲率线删除过程中,可产生分辨率连续可调的四边形主导网格.     

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

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

遥感影像分割边界的平滑方法

为了解决遥感影像分割对象边界的“栅格现象”问题,获取相对真实的分割地物对象边界,提高后续分类精度,提出了一套完整高效的平滑方法.该方法的主要流程是:对分割后所得到的每个对象的边界进行按节点拆分;对每个边界段进行断点筛选等预处理;再通过DP算法提取代表边界信息的特征点;使用3次B样条拟合所得到的特征点,完成边界平滑.实验结果表明,该方法能够获得满意的平滑效果.     

基于三维点云模型的特征线提取算法

针对以往算法存在无法区分尖锐和非尖锐特征点、提取的特征点与视角有关、特征点未连线等问题, 提出一种基于高斯映射和曲率值分析的三维点云模型尖锐特征线提取算法。该算法先进行点云数据点的离散高斯映射, 并将映射点集聚类; 然后使用自适应迭代过程得到两个或多个面的相交线上曲率值和法向量发生突变的尖锐特征点, 这些点与视角无关; 最后, 用改进的特征折线生长算法, 将特征点连接, 得到光顺特征线。实验证明, 该算法具有良好的自适应性、抗噪性和准确性, 是一种有效的三维模型特征线提取算法。     

一种采用脊线特征的指纹模糊匹配方法

针对目前指纹识别系统主要采用手指上细节点的分布来表征和匹配指纹,提出了一种采用指纹脊线特征的匹配算法,以提高细节点数量较少情况下的匹配精度.在特征提取阶段,通过脊线采样,只存储脊线采样点集以降低存储量;在匹配时,对欲匹配的两指纹利用细节特征配准脊线集,在重合区域内对两指纹脊线统一进行编码,通过编码的比较确定相似脊线;以相似脊线的相同位置编码为论域,以相同位置编码的相似程度为隶属度,建立衡量脊线相似程度的模糊集,采用加权平均法对多个相似脊线模糊集进行综合评判得到两指纹脊线总体相似度.最后将脊线匹配相似度与细节点匹配相似度进行加权融合得到两指纹最终的相似度.在FVC2004指纹库上的实验表明该算法能够有效提高指纹匹配的准确性.     

全局各向异性四边形主导网格重建方法?

四边形网格的结构特点要求网格单元满足全局一致性,难以取得网格质量与表达效率之间的平衡。为此,提出一种基于全局的各向异性四边形主导网格重建方法,可生成网格质量好且冗余程度低的四边形网格。重建过程以主曲率线为基本采样单元,首先计算模型表面的主曲率场并对主曲率场积分,得到密集的主曲率线采样;再根据贪心算法,利用几何形体自身的各向异性找出冗余度最高的主曲率线并予以删除;如此循环,直至达到理想的采样密度。该重建方法适用于任意拓扑网格模型,所得到的各向异性四边形主导网格在网格模型分辨率下降时,由于始终保留重要主曲率线,从而可以更好地保持模型特征。同时,在基于贪心算法的渐进式主曲率线删除过程中,可产生分辨率连续可调的四边形主导网格。     

基于符号曲面变化度与特征分区的点云特征线提取算法

特征线对三维模型的表达和识别具有重要意义,提出了符号曲面变化度的概念,其具备同时表达曲面弯曲程度和凹凸类型的能力,可以作为曲面曲率的良好近似.在此基础上,提出了一种基于符号曲面变化度与特征分区的特征线提取算法.首先选取点云中符号曲面变化度绝对值大于一定阈值的点作为潜在特征点;然后将符号曲面变化度作为区域增长限定条件对潜在特征点进行分割,并在通过局部曲面重建确定区域边界点后,采用基于曲面变化度和距离加权的双边滤波算法迭代细化边界点,以确定特征点真实位置;最后通过建立特征点的最小生成树实现特征线连接.实验结果表明,该算法能很好地识别、分割点云中的特征点,提取到准确、完整的特征线.     

基于"主中心点"脊线跟踪的指纹分类算法

通过分析分割算法,结合区域跟踪算法和腐蚀膨胀算法,对基于方向场置信度的分割算法进行了改进;然后,结合一阶对称复数滤波,验证基于传统Poincarê指数法所提取得到奇异点的准确性;在此基础上提出了一种基于"主中心点"脊线跟踪的指纹分类方法,该方法根据"主中心点"附近的脊线信息以及奇异点的数目和相关位置来确定指纹纹型.     

Feature line extraction from unorganized noisy point clouds using truncated Fourier series

The detection of feature lines is important for representing and understanding geometric features of 3D models. In this paper, we introduce a new and robust method for extracting feature lines from unorganized point clouds. We use a one-dimensional truncated Fourier series for detecting feature points. Each point and its neighbors are approximated along the principal directions by using the truncated Fourier series, and the curvature of the point is computed from the approximated curves. The Fourier coefficients are computed by Fast Fourier Transform (FFT). We apply low-pass filtering to remove noise and to compute the curvature of the point robustly. For extracting feature points from the detected potential feature points, the potential feature points are thinned using a curvature weighted Laplacian-like smoothing method. The feature lines are constructed through growing extracted points and then projected onto the original point cloud. The efficiency and robustness of our approach is illustrated by several experimental results.     

Feature aligned quad dominant remeshing using iterative local updates

In this paper we present a new algorithm which turns an unstructured triangle mesh into a quad dominant mesh with edges well aligned to the principal directions of the underlying surface. Instead of computing a globally smooth parameterization or integrating curvature lines along a tangent vector field, we simply apply an iterative relaxation scheme which incrementally aligns the mesh edges to the principal directions. We further obtain the quad dominant mesh by dropping the not-aligned diagonal edges from the triangle mesh. A post-processing stage is introduced to further improve the results. The major advantage of our algorithm is its conceptual simplicity since it is merely based on elementary mesh operations such as edge collapse, flip, and split. Various results are presented in the paper; they show a good alignment to surface features and rather uniform distribution of mesh vertices. This makes them well suited, e.g., as Catmull-Clark Subdivision control meshes.     

Normal Vector Voting: Crease Detection and Curvature Estimation on Large,Noisy Meshes

This paper describes a robust method for crease detection and curvature estimation on large, noisy triangle meshes. We assume that these meshes are approximations of piecewise-smooth surfaces derived from range or medical imaging systems and thus may exhibit measurement or even registration noise. The proposed algorithm, which we call normal vector voting, uses an ensemble of triangles in the geodesic neighborhood of a vertex—instead of its simple umbrella neighborhood—to estimate the orientation and curvature of the original surface at that point. With the orientation information, we designate a vertex as either lying on a smooth surface, following a crease discontinuity, or having no preferred orientation. For vertices on a smooth surface, the curvature estimation yields both principal curvatures and principal directions while for vertices on a discontinuity we estimate only the curvature along the crease. The last case for no preferred orientation occurs when three or more surfaces meet to form a corner or when surface noise is too large and sampling density is insufficient to determine orientation accurately. To demonstrate the capabilities of the method, we present results for both synthetic and real data and compare these results to the G. Taubin (1995, in Proceedings of the Fifth International Conference on Computer Vision, pp. 902–907) algorithm. Additionally, we show practical results for several large mesh data sets that are the motivation for this algorithm.     

关键点选取的最小二乘渐进迭代逼近

目的 最小二乘渐进迭代逼近（LSPIA）方法多以均匀参数化或弦长参数化的形式均匀地确定初始控制点,虽然取得了良好效果,但在处理复杂曲线时,迭代速度相对较慢且误差精度不一定能达到预期设定值。为了进一步提高迭代效率和误差精度,本文提出了基于关键点（局部曲率最大点和极端曲率点）的最小二乘渐进迭代逼近方法。方法 首先计算所有数据点的离散曲率,筛选出局部曲率最大点;接着设定初始的曲率下限,筛选出极端曲率点;然后将关键点与均匀选取的控制点按参数顺序化,并将其作为迭代的初始控制点;最后利用LSPIA方法对数据点进行拟合。结果 对同一组数据点,分别采用LSPIA方法和基于关键点的LSPIA方法,本文方法较好地提高了收敛速度;在相同的控制点数目下,与LSPIA算法相比,本文方法的误差精度较小。结论 本文方法适合于比较复杂的曲线,基于曲率分布的关键点的选取,可以更好地反映曲线的几何信息。数值实例表明,结合关键点筛选策略的LSPIA算法提高了计算效率,取得了更好的拟合效果。     

二值图像中基于陡变度的拐角点集检测方法

文章认为目前流行的拐角点检测方法有三个缺点：一是在数字图像空间中曲率存在计算误区,因而用曲率定位拐角点不合适;二是导致图像边缘产生拐角的不仅有单点,还有点集,因此不求拐角点集是不妥的;三是大曲率点不等价于拐角点。鉴于此,文章提出一种基于陡变度的拐角点集检测方法,其思想是：在二值图像中,图像边缘可看成是一维流形,陡变点集将一维流形分割成大小不等的光滑流形段,如果光滑流形通过该陡变点集后方向发生急剧改变,则此陡变点集是拐角点集。通过实验对比,文章中提出的算法检测结果优于目前流行算法的检测结果。     

结合插值细分和径向基函数的3维扫描数据孔洞修补

目的 逆向工程中3维扫描数据通常产生孔洞影响逆向造型精度.针对已有算法补洞会导致的边界突变问题,提出基于插值细分和基于径向基函数的孔洞修复算法。方法 首先,对有噪声孔洞边界进行拉普拉斯平滑预处理;其次,通过快速重心插值细分孔洞;然后,结合孔洞周围曲率信息,利用边界和法线约束点进行隐式曲面求解;最后,利用求得的隐式曲面方程,利用梯度下降法调整孔洞插值点,获得平滑修补孔洞结果。结果 对3维经典造型以及实际机械工件等两类不同的数据进行扫描并进行孔洞修补实验。由于算法针对有噪声孔洞结合了孔洞周围曲率信息并通过插值细分进行约束求解,保证了补洞效果的平滑性。实验结果表明,本文算法使得基于径向基函数隐式曲面对有噪声孔洞的适应性更强,其修补结果更加平滑,符合周围曲率变化,改进了已有孔洞修补的边缘突变和修补痕迹明显问题。结论 本文算法针对基于径向基函数的隐式曲面求解对噪声敏感的局限性,进行平滑预处理,结合孔洞周围曲率,提高了孔洞修补效果。由于基于径向基函数的隐式曲面对光顺的流形曲面模拟较好,所以算法对特征孔洞的修补存在一定的不足,快速重心插值法针对不规则孔洞也有一定的局限性。     

Inferring surface trace and differential structure from 3-D images

Early image understanding seeks to derive analytic representations from image intensities. The authors present steps towards this goal by considering the inference of surfaces from three-dimensional images. Only smooth surfaces are considered and the focus is on the coupled problems of inferring the trace points (the points through which the surface passes) and estimating the associated differential structure given by the principal curvature and direction fields over the estimated smooth surfaces. Computation of these fields is based on determining an atlas of local charts or parameterizations at estimated surface points. Algorithm robustness and the stability of results are essential for analyzing real images; to this end, the authors present a functional minimization algorithm utilizing overlapping local charts to refine surface points and curvature estimates, and develop an implementation as an iterative constraint satisfaction procedure based on local surface smoothness properties. Examples of the recovery of local structure are presented for synthetic images degraded by noise and for clinical magnetic resonance images     

An effective quad-dominant meshing method for unorganized point clouds

To perform quad meshing on raw point clouds, existing algorithms usually require a time-consuming parameterization or Voronoi space partition process. In this paper, we propose an effective method to generate quad-dominant meshes directly from unorganized point clouds. In the proposed method, we first apply Marinov’s curvature tensor optimization to the input point cloud to reduce the umbilical regions in order to obtain a smooth curvature tensor. We then propose an efficient marching scheme to extract the curvature lines with controllable density from the point cloud. Finally, we apply a specialized K-Dimension (KD) tree structure, which converts the nearest neighbor searching problem into a sorting problem, to efficiently estimate the intersections of curvature lines and recover the topology of the quad-dominant meshes. We have tested the proposed method on different point clouds. Our results show that the proposed method produces good quality meshes with high computational efficiency and low memory requirement.     

Robust estimation of adaptive tensors of curvature by tensor voting

Although curvature estimation from a given mesh or regularly sampled point set is a well-studied problem, it is still challenging when the input consists of a cloud of unstructured points corrupted by misalignment error and outlier noise. Such input is ubiquitous in computer vision. In this paper, we propose a three-pass tensor voting algorithm to robustly estimate curvature tensors, from which accurate principal curvatures and directions can be calculated. Our quantitative estimation is an improvement over the previous two-pass algorithm, where only qualitative curvature estimation (sign of Gaussian curvature) is performed. To overcome misalignment errors, our improved method automatically corrects input point locations at subvoxel precision, which also rejects outliers that are uncorrectable. To adapt to different scales locally, we define the RadiusHit of a curvature tensor to quantify estimation accuracy and applicability. Our curvature estimation algorithm has been proven with detailed quantitative experiments, performing better in a variety of standard error metrics (percentage error in curvature magnitudes, absolute angle difference in curvature direction) in the presence of a large amount of misalignment noise.