An end-to-end model for chinese calligraphy generation

Multimedia Tools and Applications - A Chinese calligraphy copybook usually has a limited number of Chinese characters, far from a whole set of characters needed for typesetting. Therefore, there is...     

An interactive grading and learning system for chinese calligraphy

Chinese calligraphy is an oriental art. In this paper, an interactive calligraphic guiding system is first proposed to grade the score of written characters by using the image processing and the fuzzy inference techniques. The written documents are automatically segmented. Three quantized features, the center, the size and the projections of each written character, are extracted to measure the score of calligraphy. The system also gives some improving instructions for users. Some experimental results are given to show the validity and effectiveness of our proposed system. Through this useful system, users could learn and practice Chinese calligraphy at home.     

Artistic features extraction from chinese calligraphy works via regional guided filter with reference image

Chinese calligraphy is a unique visual art, and and is one of the material basis of China’s traditional cultural heritage. However, time had caused the old calligraphy works to weathering and damages, so it is necessary to utilize advanced technologies to protect those works. One of those technologies is digital imaging, and the obtained images by digital imaging can preserve the visual information of calligraphy works better, furthermore, they can be used in further researches. While the basic works for those researches are to extract the artistic features which include two elements, i.e., form and spirit. However, most of the existing methods only extract the form and ignore the characters’ spirit, especially they are insensitive to the slight variation in complex ink strokes. To solve these problems, this paper proposes an extraction method based on regional guided flter (RGF) with reference images, which is generated by KNN matting and used as the input image for RGF. Since RGF is sensitive to the slight variation of ink, so the detailed information of the inside of strokes can be detected better. Besides, unlike the past works, which filter the whole strokes, RGF filters the inside of strokes and edges in different windows respectively, which results in that the edges are preserved accurately. Results from a deployment of several famous Chinese calligraphy works demonstrate that our method can extract more accurate and complete form and spirit with lower error rate.     

Automatic Test Suite generation

A Test Suite (TS) is typically a collection of Natural Language sentences against which the coverage of a Natural Language Processing system can be evaluated. We describe a method by which such suites can be produced automatically, involving a modification and extension of the Definite Clause Grammar formalism, and describe some of the advantages of the method over the traditional method of manual construction.     

Automatic generation of tourist brochures

We present a novel framework for the automatic generation of tourist brochures that include routing instructions and additional information presented in the form of so‐called detail lenses. The first contribution of this paper is the automatic creation of layouts for the brochures. Our approach is based on the minimization of an energy function that combines multiple goals: positioning of the lenses as close as possible to the corresponding region shown in an overview map, keeping the number of lenses low, and an efficient numbering of the lenses. The second contribution is a route‐aware simplification of the graph of streets used for traveling between the points of interest (POIs). This is done by reducing the graph consisting of all shortest paths through the minimization of an energy function. The output is a subset of street segments that enable traveling between all the POIs without considerable detours, while at the same time guaranteeing a clutter‐free visualization.     

Automatic generation of interlocking shapes

This paper describes methods of automatically generating interlocking shapes on a plane surface. Each shape will nest perfectly (without gaps) when it is repeated over a flat surface according to the stated mathematical rules. Symmetry is the key to these shapes. Interlocking shapes can be used in metal stamping, flame cutting, and packaging to conserve material.There are nine principal types of interlocking shapes. Linear methods of generating all of them are presented. Every shape generated is scrap-free. Furthermore, every possible interlocking shape can be generated by one of the nine methods. An actual computer program using any of the methods would consist of four parts: (1) vertex computation, (2) line input, (3) shape generation, and (4) duplication. Nine computer programs have been written to test the algorithms. The programs are in FORTRAN with subroutines supplied by the Graphics Compatibility System (GCS, developed by the U.S. Military Academy). The programs interact with the user on a Tektronix 4010 terminal and they assume no particular mathematical knowledge from the user.     

Automatic generation of self-scheduling programs

Techniques are described for the automatic generation of self-scheduling parallel programs. Both scheduling algorithms and the concurrent components of applications are expressed in a high-level concurrent language. Partitioning and data dependency information are expressed by simple control statements, which may be generated either automatically or manually. A self-scheduling compiler, implemented as a source-to-source transformation, takes application code, control statements, and scheduling routines and generates a new program that can schedule its own execution on a parallel computer. The approach has several advantages compared to previous proposals. It generates programs that are portable over a wide range of parallel computers. There is no need to embed special control structures in application programs. The use of a high-level language to express applications and scheduling algorithms facilitates the development, modification, and reuse of parallel programs     

Automatic generation of explanations: AGE

Explaining how engineering devices work is important to students, engineers, and operators. In general, machine generated explanations have been produced from a particular perspective. This paper introduces a system called automatic generation of explanations (AGE) capable of generating causal, behavioral, and functional explanations of physical devices in natural language. AGE explanations can involve different user selected state variables at different abstraction levels. AGE uses a library of engineering components as building blocks. Each component is associated with a qualitative model, information about the meaning of state variables and their possible values, information about substances, and information about the different functions each component can perform. AGE uses: (i) a compositional modeling approach to construct large qualitative models, (ii) causal analysis to build a causal dependency graph, (iii) a novel qualitative simulation approach to efficiently obtain the system's behavior on large systems, and (iv) decomposition analysis to automatically divide large devices into smaller subsystems. AGE effectiveness is demonstrated with different devices that range from a simple water tank to an industrial chemical plant.     

Automatic generation of visual programming environments

We have developed the visual language compiler-compiler (VLCC) system to automatically generate visual programming environments. VLCC is a grammar based system that can support implementation of any visual language by assisting the language designer in defining the language's graphical objects, syntax, and semantics. The final result of the generation process includes an integrated environment with a visual editor and a compiler for the defined visual language. In VLCC, graphical tools define visual languages to create both graphical objects and composition rules. Visual editors enable language designers to directly and visually manipulate the syntax of these languages. To capture the widest range of visual languages, the VLCC system can be configured for a specific language class. Different language classes can be characterized depending on their graphical objects' structure and on the way they can be composed. Also, box and arrow diagrams are defined for primitive objects with attaching points and for composition rules to join boxes and arrows at those attaching points. After choosing the visual language type to create, the designer can concentrate on language definition details. VLCC uses the positional grammar model as its underlying grammar formalism     

Automatic generation of IDEF0 models

This paper looks into a new area for knowledge-based system application, that of manufacturing modelling. Manual generation of IDEF0 models of manufacturing systems is time-consuming and inconsistent. However, the process can be automated to improve timeliness and consistency. In this paper, a knowledge-based manufacturing modelling system for the automatic generation of IDEF0 models is proposed. The system will not only greatly reduce the IDEF0 modelling time but will also eliminate the inconsistency problem of conventional IDEF0 modelling systems. The paper explains the knowledge-based approach and identifies the kinds of domain knowledge that are required for the construction of the knowledge-based manufacturing modelling system.     

具有反射群对称性的球面图案自动生成

等变映射方法在生成艺术图案中具有构造困难,受对称群阶数瓶颈限制等缺点。借鉴有限反射群不变论的结论,提出不变映射方法生成具有正多面体反射群对称性的球面艺术图案,建立了一种可生成无穷无尽球面图案的自动化方法。该方法不仅实施容易,且可类似地推广到高维空间中。     

消息传递并行程序的自动生成

针对分布内存结构的并行化将串行程序转变为在各处理节点上运行的SPMD并行程序,节点程序包含该节点所执行的运算和与其它节点交换信息的通信操作。讨论了在已知数据分解和计算划分的前提下生成分布内存结构下的消息传递并行程序的算法,以Lam提出的线性不等式基本框架为基础,在Paraguin工作基础上进行了有效的改进：第一在代码生成算法中引入了数据分布;第二将处理器空间由一维扩展到多维;第三将虚拟处理器到物理处理器的映射关系引入代码生成算法,从而减少了节点间通信的数量,提高了生成并行代码的性能。     

Automatic generation of finite element meshes

This paper describes a new algorithm for the automatic generation of finite element meshes of arbitrary multiply connected domains. The strategy is based upon the construction of a mapping from the generated mesh into a regular one. The scheme is designed for maximum flexibility and is able to generate meshes of triangular or quadrilateral curved elements. Several examples are presented to illustrate the applicability of the algorithm.     

Automatic generation of process flow diagrams

An algorithm which automates the generation of process flow diagrams for distributed programs has been developed. The algorithm maps a graph specification to a graph diagram. The implementation of a graphics monitor uses process flow diagrams to monitor execution of distributed programs on an experimental multiprocessor system. Process states are superimposed onto process flow diagrams to enhance visualization of the execution sequence. Techniques of clustering and unclustering processes are also described.     

非线性循环不变式的自动生成

提出了一个自动生成非线性循环不变式的算法。循环不变式可以表示成一个带参数的多项式的形式,根据断言的归纳特性,将循环不变式的生成问题转变成一个约束求解问题,这个约束求解问题的每个解对应于一个循环不变式,如果约束求解问题仅有零解,则说明不存在该参数多项式形式的循环不变式。该算法在Maple中得到了实现,并通过一些实例说明了该算法的有效性。     

Automatic generation of matter-of-opinion video documentaries

In this paper we describe a model for automatically generating video documentaries. This allows viewers to specify the subject and the point of view of the documentary to be generated. The domain is matter-of-opinion documentaries based on interviews. The model combines rhetorical presentation patterns used by documentary makers with a data-driven approach. Rhetorical presentation patterns provide the viewer with an engaging viewing experience, while a data-driven approach can be applied to growing media repositories. To date, the modeling of rhetoric has been achieved in a top-down manner using closed repositories, while data-driven generation approaches were unable to implement non-trivial rhetorical presentation patterns. We describe an implementation of our model in a system, Vox Populi, and apply it to an online documentary shot by a group of independent amateur documentarists.