一种包括隐含图形信息提取的工程图识别算法

工程图识别应该模仿人阅读工程图，把隐含图形信息提取出来，文中提出一种由稀疏的行程段直接提取整条图线，包括隐含图形信息提取的工程图识别算法，该算法首先提取整条图线的信息，再确定图线交点，通过分析线素，间隔等的规律确定线型，最后，基于工程图知识对图线拓扑关系进行校正。     

基于对角线行程的直线生成算法研究

提出了一种基于对角线行程的直线生成算法。针对现有基于行程模式的直线生成算法在直线斜率大于1/2时效率极剧下降的问题,提出将在同一45°对角线上的连续点亮的像素点个数作为行程计算。算法详细分析了决定对角线行程长度的所有因素,对于满足一定条件的特殊直线,算法不需要进行偏差判断,可直接生成整条直线;对普通直线,仅使用一次加法运算和判零运算即可得到对角线行程长度,改善了行程算法的效率,弥补了直线行程算法长期以来存在的缺点。     

基于连通段匹配的光栅直线整体提取方法

随着ＣＡＤ技术的不断发展并走向实用，工程图的智能输入已受到国内外学术界与工程界的普遍关注。在工程图的识别中，直线的提取与识别是最基本的处理方式。本文提出了一种基于邻接行程段匹配的直线整体提取方法。它直接从图像入手，进行图像邻接行程段的匹配分析，从整体上提取任意方向的直线，同时最大限度地保持直线的宽度信息。     

二维工程图中基于分数傅里叶变换的盲水印算法

提出了一种基于二维工程图的水印算法。该方法提取二维工程图中线段的相对坐标向量,构造一维复数信号。通过分数傅里叶变换得到复数信号的变换系数,根据水印的大小和分数傅里叶变换系数的之间的关系,对变换系数的幅值进行调整来嵌入水印。该方法是盲水印算法,在提取水印时不需要原始工程图。实验表明,该算法对平移、旋转、缩放等攻击具有良好的鲁棒性,同时具有良好的安全性。     

多段DDA直线扫描转换算法

在传统DDA直线扫描转换算法的基础上,提出了一种新的加速算法,该算法通过寻找直线的最小生成段,利用最小生成段的平移复制,从而提高了整条直线扫描转换的速度。     

基于差值扩大的2维工程图可逆水印算法

针对2维工程图版权保护问题,提出了一种基于差值扩大法的2维工程图的水印嵌入算法。该算法对差值扩大法进行改进解决了工程图线段顶点坐标值相关性差的问题,通过修改线段端点的坐标值来嵌入水印信息。由于修改量非常小,不会产生视觉冗余。提取时可以精确地恢复原始工程图,满足了工程图加工精度高的要求,并且实现了盲提取。实验结果表明该算法达到了较好的效果,并且易于实现,适用于工程图的版权保护领域。     

一种基于字符点阵式编码的工程图信息隐藏算法

针对工程图的版权保护和现有相关算法鲁棒性不强的特点,提出了一种基于字符点阵式编码的工程图信息隐藏算法.该算法首先对隐藏信息进行点阵式编码处理,然后根据使用Logistic混沌系统产生的二值化混沌序列选择其中部分线段实体,结合HVS和隐藏信息对工程图的线宽进行微小修改,从而实现信息隐藏.实验结果显示该算法对工程图的平移、...     

基于趋势优先跟踪方向的直线矢量化算法

直线是工程图纸中最常使用的图元,并且工程图中常出现的圆、圆弧、曲线都可以用直线段来生成,因此,对直线的矢量化是工程图识别中一个非常重要的研究方向。针对工程图的特点,提出了一种基于趋势优先跟踪方向的直线矢量化算法,在细化后的单像素宽度图形上,根据直线的斜率趋势确定优先跟踪方向,较好地解决了在交叉点处长直线断裂的问题。同时结合跟踪过程中使用的边跟踪边检测方法,可以有效抑制短小直线段过多地产生,实现小斜率直线和大斜率直线的整体识别。     

一种基于特征的二维工程图信息隐藏算法

针对数字工程图的版权保护问题,基于二维工程图的特征提出了一种信息隐藏算法。该算法先获得工程图中的有序线段集并进行乱序处理,然后将待嵌入的信息转化为伪随机序列,并以此为依据并结合人体视觉系统特征对乱序线段集中线段的线型按序进行修改,从而实现信息的隐藏。试验结果表明,该信息隐藏算法对旋转、平移以及均匀缩放等攻击具有较好的鲁棒性。     

一种采用最优二叉查找树的二维工程图内容认证零水印算法

为了对二维工程图内容的完整性进行认证,提出一种基于最优二叉查找树的零水印算法.首先对二维工程图中各个实体的拓扑结构进行编码,再与实体的句柄值相结合,进行小波分解后利用细节系数构造零水印.试验与分析表明该算法对不改变二维工程图内容的整体缩放、旋转、平移等操作具有较好的鲁棒性,对改变二维工程图内容的操作,如局部平移、实体删除、实体添加等恶意操作极度敏感,同时该算法还能够对二维工程图内容的篡改具有一定的定位能力.     

基于图形约束的工程图扫描图象直线整体识别方法

本文在分析现有工程图纸扫描图象识别算法与识别系统所存在的问题的基础上，提出了与现有局部识别算法完全不同的工程图纸整体识别的理论与算法，该算法已经在ＣＡＤ＆ＣＧ国家重点实验室调试成功，试验表明，基于图形约束的直线整体识别算法符合技术人员读图的规律，具有局部识别算法无可比拟的优越之处。     

Finding perceptually closed paths in sketches and drawings

Closed or nearly closed regions are an important form of perceptual structure arising both in natural imagery and in many forms of human-created imagery including sketches, line art, graphics, and formal drawings. We present an effective algorithm especially suited for finding perceptually salient, compact closed region structure in hand-drawn sketches and line art. We start with a graph of curvilinear fragments whose proximal endpoints form junctions. The key problem is to manage the search of possible path continuations through junctions in an effort to find paths satisfying global criteria for closure and figural salience. We identify constraints particular to this domain for ranking path continuations through junctions, based on observations of the ways that junctions arise in line drawings. In particular, we delineate the roles of the principle of good continuation versus maximally turning paths. Best-first bidirectional search checks for the cleanest, most obvious paths first, then reverts to more exhaustive search to find paths cluttered by blind alleys. Results are demonstrated on line drawings from several sources including line art, engineering drawings, sketches on whiteboards, as well as contours from photographic imagery.     

Animated 3D Line Drawings with Temporal Coherence

Producing traditional animation is a laborious task where the key drawings are first drawn by artists and thereafter inbetween drawings are created, whether it is by hand or computer‐assisted. Auto‐inbetweening of these 2D key drawings by computer is a non‐trivial task as 3D depths are missing. An alternate approach is to generate all the drawings by extracting lines directly from animated 3D models frame by frame, concatenating and rendering them together into an animation. However, animation quality generated using this straightforward method bears two problems. Firstly, the animation contains unsatisfactory visual artifacts such as line flickering and popping. This is especially pronounced when the lines are extracted using high‐order derivatives, such as ridges and valleys, from 3D models represented in triangle meshes. Secondly, there is a lack of temporal continuity as each drawing is generated without taking its neighboring drawings into consideration. In this paper, we propose an improved approach over the straightforward method by transferring extracted 3D line drawings of each frame into individual 3D lines and processing them along the time domain. Our objective is to minimize the visual artifacts and incorporate temporal relationship of individual lines throughout the entire animation sequence. This is achieved by creating correspondent trajectory of each line from each frame and applying global optimization on each trajectory. To realize this target, we present a fully automatic novel approach, which consists of (1) a line matching algorithm, (2) an optimizing algorithm, taking into account both the variations of numbers and lengths of 3D lines in each frame, and (3) a robust tracing method for transferring collections of line segments extracted from the 3D models into individual lines. We evaluate our approach on several animated model sequences to demonstrate its effectiveness in producing line drawing animations with temporal coherence.     

Line Drawing Vectorization via Coarse-to-Fine Curve Network Optimization

Vectorizing line drawings is a fundamental component of the workflow in various applications such as graphic design and computer animation. A practical vectorization tool is desired to produce high-quality curves that are faithful to the original inputs and close to the connectivity of human drawings. The existing line vectorization approaches either suffer from low geometry accuracy or incorrect connectivity for noisy inputs or detailed complex drawings. We propose a novel line drawing vectorization framework based on coarse-to-fine curve network optimization. Our technique starts with an initial curve network generated by an existing tracing method. It then performs a global optimization which fits the curve network to image centrelines. Finally, our method performs a finer optimization in local junction regions to achieve better connectivity and curve geometry around junctions. We qualitatively and quantitatively evaluate our system on line drawings with varying image quality and shape complexity, and show that our technique outperforms existing works in terms of curve quality and computational time.     

工程扫描图象的直线整体识别算法

利用工程图纸的整体形状特性，提出了对扫描图象的直线整体识别算法，该算法对图象线条轮廓上的关键点进行了精确记录，并对它们进行了分析和处理。该算法不必单独处理线的交叉问题，但交叉点处的效果明显。它的基本思想是：首先检测原图象线宽，然后依据原图象线条的不同线宽，把原图象转化为一些由梯形块组成的条块图，并对不同的条块图分别进行整体识别     

3D reconstruction of complex curved objects from line drawings

An active research topic in computer vision and graphics is developing algorithms that can reconstruct the 3D surface of curved objects from line drawings. There are a number of algorithms have been dedicated to solve this problem, but they can't solve this problem when the geometric structure of a curved object becomes complex. This paper proposes a novel approach to reconstructing a complex curved 3D object from single 2D line drawings. Our approach has three steps:(1) decomposing a complex line drawing into several simpler line drawings and transforming them into polyhedron;(2) reconstructing the 3D wireframe of curved object from these simpler line drawings and generating the curved faces;(3) combining the 3D objects into the complete objects. A number of examples are given to demonstrate the ability of our approach to successfully perform reconstruction of curved objects which are more complex than previous methods.     

Labeling Line Drawings with Hidden-Part-Drawn of Planar Object with Trihedral Vertices

Although line drawings consist of only line segments on a plane, they convey much information about the three-dimensional object structures. For a computer interpreting line drawings, some intelligent mechanism is required to extract three-dimensional information from the two-dimensional line drawings. In this paper, a new labeling theory and method are proposed for the two-dimensional line drawing with hidden-part-draw of a three-dimensional planar object with trihedral vertices. Some rules for labeling line drawing are established. There are 24 kinds of possible junctions for line drawing with hidden-part-draw, in which there are 8 possible Y and 16 W junctions. The three problems are solved that Sugihara's line drawing labeling technique exists. By analyzing the projections of the holes in manifold planar object, we have put forward a labeling method for the line drawing. Our labeling theory and method can discriminate between correct and incorrect hidden-part-draw natural line drawings. The hidden-part-draw natural line drawings can be labeled correctly by our labeling theory and method, whereas the labeling theory of Sugihara can only label the hidden-part-draw unnatural line drawings in which some visible lines must be drawn as hidden lines, and some invisible lines must be drawn as continuous lines.     

A Knowledge-Aided Line Network Oriented Vectorisation Method for Engineering Drawings

Vectorisation is the foundation in recognising engineering components from paper form drawings. Due to the complexity of problems and the difficulty of techniques, the vectorisation method relying merely on the image itself cannot get satisfactory results. It is now widely agreed that the knowledge must be applied more or less to aid the vectorisation. The capability of the vectorisation method itself should also be thus improved. This paper analyses the problems of existing vectorisation methods, introduces the complete concept of global vectorisation, and proposes a whole new line network oriented global vectorisation method. This method uses global information to vectorise a line in one step, and carries out the global vectorisation of line networks. Therefore, the problem of separating one line is solved, and a complex analysis of crossings is avoided. The performance of vectorisation is improved clearly. Furthermore, it can vectorise lines in any orientations well, and can vectorise a dashed line in one step. Aided by the related knowledge, local details of vectorisation are refined. A performance evaluation compared with other vectorisation methods is also included.     

曲面立体线图的补线技术研究

文中根据已有的曲面立体自然线图的标记原理，得到了曲面立体画隐线图的标记原理和方法。曲面立体的不完整线图中的L型节点是曲面立体完整线图中W型节点的退化。基于曲面立体画出隐藏线的完整线图标记原理和方法，详细分析并建立了曲面立体不完整线图中L型节点与曲面立体完整线图中W型节点的对应关系。提出了曲面立体不完整线图的标记和补线方法，结合算例详细论述了曲面立体不完整线图的标记和补线过程，从曲面立体不完整线图获得了合理的曲面立体完整线图。     

具有相切面的曲面立体线画图标记研究

为了更好地理解三维景物，介绍了前人对线画图标记的研究成果，同时建立了一种标记具有相切面的曲面立体线画图的方法，并给出了具有相切面的曲面立体线画图的标记规则。由于线画图中的节点是由三面角构成的顶点的投影，因此对于画出隐藏线的具有相切面的曲面立体线画图，其合法的节点标记形式有38种，其中Y型节点有6种，W型节点有18种，V型节点有14种。新的标记方法适用于由平面立体和曲面立体组合而成的复杂立体线画图。