一种有效的秦俑碎块匹配算法

针对秦俑碎块的三维网格数据模型,提出了一种基于特征轮廓线的碎块断裂面匹配算法.首先,对数据模型进行纹理贴图、去噪、补洞、简化数据模型等预处理,然后提取碎块的主轮廓线和次轮廓线,进而提取出碎块的特征轮廓线,最后根据角点对特征轮廓线进行分段,并采用计算最长公共子序列的方法对分段曲线进行匹配,完成特征轮廓线的匹配,从而实现碎块断裂面的匹配.实验结果表明,该算法是一种有效的、精确的秦俑碎块匹配方法.     

一种双向层间轮廓线线性插值方法

CT和MRI图像断层之间的距离通常大于断层内部间的像素的距离,为了实现断层图像层间的合理过度,需要对轮廓线进行线性插值。文中提出了一种双向的断层轮廓线线性插值方法。该方法首先对轮廓多边形进行逼近,然后从两个方向寻找最佳匹配点对,最后进行线性插值。该方法易于实现,执行速度快。实验结果表明这种方法不仅对形状相似的轮廓线插值效果好,对形状差异大的轮廓线也能得到令人满意的结果。     

一种双向层间轮廓线线性插值方法

CT和MRI图像断层之间的距离通常大于断层内部间的像素的距离,为了实现断层图像层间的合理过度,需要对轮廓线进行线性插值.文中提出了一种双向的断层轮廓线线性插值方法.该方法首先对轮廓多边形进行逼近,然后从两个方向寻找最佳匹配点对,最后进行线性插值.该方法易于实现,执行速度快.实验结果表明这种方法不仅对形状相似的轮廓线插值效果好,对形状差异大的轮廓线也能得到令人满意的结果.     

一种快速的复杂多边形匹配算法

提出了一种能够快速进行复杂形状多边形匹配的算法，该算法基于正切空间表示，先对复杂多边形进行离散曲线演化，再将得到的简化多边形分为一系列最大凸/凹弧线，并选择每段最大凸弧线的起点作为匹配的起始点进行匹配。实验结果证明该算法不但能够对复杂多边形快速而精确的匹配，而且具有不受噪声影响的优点。     

基于弹性匹配活动轮廓模型心脏超声图像分割

超声医学图像由于受成像机理的影响,图像对比度不高、边缘不明显.基于传统活动轮廓线模型(snake模型)的分割方法可能产生过分割或泄漏问题.由于医学图像中拓扑结构已知,因此基于先验知识的活动轮廓线分割方法是解决这个问题的一个有效途径.建立一种新的基于弹性匹配活动轮廓线模型,该方法将待分割曲线的形状与原型曲线用弹性匹配测量变形量或相似度.曲线在演化过程中,根据变形量或相似度,可以准确分割模糊的边缘,同时保持整体目标分割形状.通过对二维小儿超声心脏图像的左心房内壁进行分割,经比较,基于弹性匹配活动轮廓线分割比传统活动轮廓线分割的误差有显著减少,避免了传统活动轮廓线的过分割或泄漏问题.     

物体轮廓线的多边形拟合

本文讨论了在给定数字轮廓线顶点数目为N的情况下,从其上选择k个点来构造拟和多边形来近似原图,使得物体轮廓线的形状丢失最小。本文的贡献在于1)本文的轮廓线拟和是以物体轮廓线的形状的信息丢失最小为目标的。而传统的方法是以拟和多边形和原图的面积差距最小。2)本文认为每一个点具有一定的形状信息,然后建立了一个以丢失的形状信息最小的0-1规划模型;3)使用了两种方法对轮廓线进行了多边形拟合,并把两个结果进行了比较。     

计算机辅助青铜器纹饰特征线识别方法研究

摘 要：针对青铜器纹饰特征轮廓线识别关键算法和技术,分析了当下纹饰数字化设计的 基本现状。基于计算机辅助技术和三角网格基础理论,结合图像聚类和阈值方法,提出特征轮 廓线识别关键技术由轮廓角点、特征曲线段、分段轮廓线匹配和空间曲线匹配 4 个环节构成。 构建了纹饰目标特征识别算法和流程,采用曲率最大值识别轮廓角点,通过特征曲线段对轮廓 曲线进行表述和投影,采用曲线弦长法对特征曲线进行匹配与拼接。建立了青铜器纹饰特征识 别方法,基于计算机辅助技术,从纹饰特征识别到空间曲线的匹配与拼接完整流程。计算机辅 助设计技术的青铜器纹饰特征识别方法具有数字化、智能化和高效化特征。根据实验结果,该 方法在目标对象纹饰识别和提取方面具有广阔的应用前景。      

物体轮廓线的多边形拟合

本文讨论了在给定数字轮廓线顶点数目为N的情况下，从其上选择k个点来构造拟和多边形来近似原图，使得物体轮廓线的形状丢失最小。本文的贡献在于1）本文的轮廓线拟和是以物体轮廓线的形状的信息丢失最小为目标的。而传统的方法是以拟和多边形和原图的面积差距最小。2）本文认为每一个点具有一定的形状信息，然后建立了一个以丢失的形状信息最小的0—1规划模型：3）使用了两种方：去对轮廓线进行了多边形拟合，并把两个结果进行了比较。     

带自由曲面的三视图重建算法研究

针对蕴含自由曲面的三视图,提出了通过恢复边界线和轮廓线进而根据这些恢复 的空间曲线重建自由曲面的算法。首先分析并证明了自由曲面在三视图中的投影性质,从而提 出边界投影和轮廓投影的匹配算法。针对视图中存在的被打断的样条曲线,提出了分段样条曲 线的爬坡算法来解决此类曲线不能匹配的问题。然后基于投影匹配序列重建出自由曲面的边界 线,再由边界投影上的点和轮廓投影端点的对应关系重建出空间轮廓线。由轮廓线等参采样构 造截面线并和边界线一起蒙皮生成最终自由曲面。本文提出的算法扩展了工程图的重建域。     

基于骨架的断层间复杂轮廓线的三角片曲面重构

提出了一个基于轮廓线骨架点的三角片曲面重构的算法,首先对散乱骨架点进行拓扑连接,得到一个由骨架点构成的多边形,然后分析骨架多边形得到所需的特征骨架点,进而得到断层间轮廓线的相似特征部分,把断层间轮廓线分割为相对应的简单曲线段,最后,重构的曲面由这些分段重构的子曲面拼接而成。     

一种基于ICA的多边形曲线水印算法

首先采用边缘跟踪算法获取矢量图形的轮廓曲线坐标;然后对坐标数据进行独立元分析处理,以获取仿射不变描述子,根据提取的仿射不变描述子生成与之正交的水印,并将水印加性嵌入到不变描述子中;最后通过上述过程的逆过程恢复出嵌有水印的多边形曲线.实验结果证明了文中算法的有效性,尤其对于仿射变换攻击、检测水印时不需要获得仿射变换参数,是一种鲁棒性很强的算法.     

Adaptive generation of surfaces in volume data

A widespread approach to generating polygonal approximations of iso-surfaces or contour surfaces in volume data is the socalled marching-cubes algorithm. This algorithm, however, has the disadvantage that the number of polygonal chains generated is considerable. The splitting-box algorithm presented here reduces the number of polygonal chains by adapting their size to the shape of the surface. The resulting polygonal chains offer a wide spectrum for representing the contour surface. An exact representation is achieved by a new type of generic patches calculated from the polygonal chains. Approximations of different quality may be obtained by combining the algorithm generating the patches with simple triangulations.     

Geometric algorithm for dominant point extraction from shape contour

In this paper we propose a new algorithm for extracting dominant points from the real contour of a digital shape. A polygonal approximation of the shape can be obtained by the set of dominant points. In the proposed algorithm, in the first step before searching for dominant points, the real contour is made sparse using a geometric concept, named convex deficiency tree. This helps to select a set of candidate points from real contour. In comparison with break points (which are initial points in many algorithms), the set of candidate points is more heuristic and the ratio of them to the all points of the contour is lower. In the second step of the proposed algorithm, the less informative candidate points are removed in an iterative manner. After removing one candidate point, its adjacent positions are searched to find more stable position for its neighbors. The comparative result of the proposed algorithm with others shows its efficiency. The algorithm finds an effective polygonal approximation for digital shapes especially for the real contours, which makes the method more practical.     

A new measurement for assessing polygonal approximation of curves

This paper presents a novel method for assessing the accuracy of unsupervised polygonal approximation algorithms. This measurement relies on a polygonal approximation called the “reference approximation”. The reference approximation is obtained using the method of Perez and Vidal [11] by an iterative method that optimizes an objective function. Then, the proposed measurement is calculated by comparing the reference approximation with the approximation to be evaluated, taking into account the similarity between the polygonal approximation and the original contour, and penalizing polygonal approximations with an excessive number of points. A comparative experiment by using polygonal approximations obtained with commonly used algorithms showed that the proposed measurement is more efficient than other proposed measurements at comparing polygonal approximations with different number of points.     

Parallel computation of contour properties

Some contour properties can be derived in parallel by a string or cycle of automata in linear time, faster than can be done with a single processor. In particular, the intersection points of two contours, the straightness of a line, the union or intersection of two contours, and polygonal approximations of a contour are computed in linear time.     

一种排样图像轮廓线生成方法

针对传统基于聚合的多边形拟合法对皮革图像边缘毛刺敏感和对所围面积无法控制的问题,提出了一种排样图像的轮廓线生成方法。该方法通过将距离误差由绝对值改为带符号值,并对非利用面积误差施加约束,使获得的排样轮廓线既抑制了毛刺的干扰,又是真实轮廓线的最大内接多边形,皮料面积得到了充分利用。实例计算和应用结果表明了本文方法的有效性和科学合理性,且对其他工业排样问题也具有一定的参考价值。     

Contour analysis of a fine structure in an electroencephalogram

An electroencephalogram (EEG) is examined as an image limited by a polygonal contour. A sequence of elementary vectors presented in analytical form, which approximates the contour line, is accepted as an electroencephalogram model. A concept on a fine structure in the electroencephalogram as a set of elementary vectors that defines the segmented parts obtained as a result of electroencephalogram decomposition is introduced. The expressions for a measure of similarity of two segments of the fine structure in a form of magnitude of their normalized scalar product are obtained. An example on detecting and analyzing the “Sleep Spindle” pattern, which is observed in the frequency range of 9–13 Hz, by using the contour model, is presented.     

基于矩的数字图像多边形逼近方法

提出了两种基于矩的数字图像的多边形逼近方法。通过比较原始图形和近似图形之间几体矩或Legendre矩的偏差的大小,选择一个最佳的近似结果,进一步可以得到一个顶点数递减的近似多边形序列。与现存的方法比较,这种方法有效地避免了逼近这结果依赖于起始点的选取的缺陷。     

Singularities and regularities on line pictures via symmetricaltrapezoids

An algorithm that decomposes a line image into singular and regular regions is presented. We define a contour trapezoid as the building block of regular regions, and postulate a maximal trapezoid set as the core of regular regions. Then, we describe an algorithm that calculates a maximal trapezoid set of a polygon and show how to use it to find a skeleton of a polygonal approximation of a contour. Experiments are explained to show the behavior of the new concept on real images as compared to previous algorithms