• Title/Summary/Keyword: drawing algorithm

Search Result 226, Processing Time 0.023 seconds

A General Tool Surface Contact Search and its Application to 3-D Sheet Forming (일반적인 금형면에서의 접촉탐색과 3차원 박판성형에의 응용)

  • 서의권;심현보
    • Proceedings of the Korean Society for Technology of Plasticity Conference
    • /
    • 1997.03a
    • /
    • pp.121-124
    • /
    • 1997
  • In the present study, a general tool surface contac search ad check algorithm is proposed. A general tool surface is described by triangular FE mesh. To check a proposed algorithm, clover cup and L-shape cup deep drawing processes are calculated. The elastic-plastic FEM using SEAM (Shear Energy Augmented Membrane) element is adapted for numerical stability.

  • PDF

The Orthogonal Drawing Algorithm with no bend for Binary Trees (이진트리의 굴곡점이 없는 수직 도시 알고리즘)

  • 허혜정;이정민;이주영
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2000.10a
    • /
    • pp.578-580
    • /
    • 2000
  • 본 논문에서는 n개의 정점들로 이루어진 이진트리를 상향과 비상향에 대한 수직 도시 방법으로 기존의 연구에서의 최소 면적인 O(nlog logn) 영역에 굴곡점이 없이 도시하는 알고리즘을 개발하였다.

  • PDF

A study on the Realtime Update of the Digital-Map by the General Survey Map (일반측량성과도에 의한 수치지도의 수시갱신방법 연구)

  • Lee, Sang-Gil;Kwon, Jay-Hyoun;Jeon, Jae-Han
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.15 no.3
    • /
    • pp.19-26
    • /
    • 2007
  • The renewal update of the digital map constructed through NGIS has been conducted for the enhancement of usage, maintenance so that the latest data is guaranteed. The total update has been done every five years for five regions of the country using aerial photographs and satellite images. By launching the third phase of NGIS, the updating plan was changed from total to total or partial update including the real time update scheme. Furthermore, the update period was improved from five to two years and four years for a large and a small city, respectively. Therefore, it is necessary to develope a matching technique which combines various geographic information (such as drawing map, surveying drawing and map) with exact position on the digital map. In this study, we developed a matching algorithm based on central point and suggested a method which uses general surveying drawing for revision/update of the digital map. The general survey is conducted when a civilian development on lands are approved. Thus, the outcome from the survey, which is the general survey drawing, contains the latest various contents such as road, building, water pipe and manhole. A consistent and efficient method using the general survey drawing for near real time update of the digital map by applying the developed matching algorithm is presented.

  • PDF

Application of object detection algorithm for psychological analysis of children's drawing (아동 그림 심리분석을 위한 인공지능 기반 객체 탐지 알고리즘 응용)

  • Yim, Jiyeon;Lee, Seong-Oak;Kim, Kyoung-Pyo;Yu, Yonggyun
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.26 no.5
    • /
    • pp.1-9
    • /
    • 2021
  • Children's drawings are widely used in the diagnosis of children's psychology as a means of expressing inner feelings. This paper proposes a children's drawings-based object detection algorithm applicable to children's psychology analysis. First, the sketch area from the picture was extracted and the data labeling process was also performed. Then, we trained and evaluated a Faster R-CNN based object detection model using the labeled datasets. Based on the detection results, information about the drawing's area, position, or color histogram is calculated to analyze primitive information about the drawings quickly and easily. The results of this paper show that Artificial Intelligence-based object detection algorithms were helpful in terms of psychological analysis using children's drawings.

Gene Algorithm of Crowd System of Data Mining

  • Park, Jong-Min
    • Journal of information and communication convergence engineering
    • /
    • v.10 no.1
    • /
    • pp.40-44
    • /
    • 2012
  • Data mining, which is attracting public attention, is a process of drawing out knowledge from a large mass of data. The key technique in data mining is the ability to maximize the similarity in a group and minimize the similarity between groups. Since grouping in data mining deals with a large mass of data, it lessens the amount of time spent with the source data, and grouping techniques that shrink the quantity of the data form to which the algorithm is subjected are actively used. The current grouping algorithm is highly sensitive to static and reacts to local minima. The number of groups has to be stated depending on the initialization value. In this paper we propose a gene algorithm that automatically decides on the number of grouping algorithms. We will try to find the optimal group of the fittest function, and finally apply it to a data mining problem that deals with a large mass of data.

Trimming Line Design of Auto-body Panel with Complex Shape Using Finite Element Inverse Method (유한요소 역해석을 이용한 복잡한 자동차 판넬의 트리밍 라인 설계)

  • Song, Y.J.;Hahn, Y.H.;Park, C.D.;Chung, W.J.
    • Transactions of Materials Processing
    • /
    • v.15 no.6 s.87
    • /
    • pp.459-466
    • /
    • 2006
  • Trimming line design plays an important role in obtaining accurate edge profile after flanging. Compared to the traditional section-based method, simulation-based method can produce more accurate trimming line by considering deformation mechanics. Recently, the use of a finite element inverse method is proposed to obtain optimal trimming line. By analyzing flanging inversely from the final mesh after flanging, trimming line can be obtained from initial mesh on the drawing die surface. Initial guess generation fer finite element inverse method is obtained by developing the final mesh onto drawing tool mesh. Incremental development method is adopted to handle irregular mesh with various size and undercut. In this study, improved incremental development algorithm to handle complex shape is suggested. When developing the final mesh layer by layer, the algorithm which can define the development sequence and the position of developing nodes is thoroughly described. Flanging of front fender is analyzed to demonstrate the effectiveness of the present method. By using section-based trimming line and simulation-based trimming line, incremental finite element simulations are carried out. In comparison with experiment, it is clearly shown that the present method yields more accurate edge profile than section-based method.

Development of the Simulation Tool for The Modeling and Traffic Control of a AGV System (AGV 시스템의 모델링 및 교통제어를 위한 Simulation Tool 개발)

  • Hong, Hyun-Ju;Ro, Young-Shick;Kang, Hee-Jun;Suh, Young-Soo;Kim, Tai-Hoo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.14 no.4
    • /
    • pp.499-505
    • /
    • 2004
  • In this paper, we studied about AGVs modeling and material handling automation simulation using a virtual AGV. The proposed virtual AGV model that operates independently each other is based on a real AGV. Continuous straight-line and workstation model using vector drawing method that could easily, rapidly work system modeling are suggested. Centralized traffic control, which could collision avoidance in intersection and should not stop AGV as possible, and algorithm for detour routing which performs when another AGV is working in pre-routed path are proposed. The traffic control and the algorithm have been proved efficience by simulation.

A study on the insertion & extraction for the simple DXF File Watermark (간단한 DXF파일에 워터마크삽입과 추출에 관한 연구)

  • Kang, Hwan-Il;Kim, Kab-Il;Jeong, Cheol-Gyun;Lee, Sung-Ui;Park, Kyung-Yong;Park, Kui-Tae
    • Proceedings of the KIEE Conference
    • /
    • 2001.07d
    • /
    • pp.2777-2781
    • /
    • 2001
  • This paper presents an algorithm of the watermark insertion and extraction on the vector image. Most parts of the vector image consist of the array of the coordinate values. The vector watermarking method by Sakamoto et al [1] uses the mask within which all the coordinate values of all the vertices are changed depending on the value of the watermark. The proposed algorithm is the change of the vector image file instead of the change of the coordinate values on the vector image. We use the Drawing Exchange Format (DXF) files since the DXF file is one of the general files in the field of the vector image.

  • PDF

Painterly Rendering using Density of Edges (에지 밀도를 이용한 회화적 렌더링)

  • Lee, Ho-Chang;Park, Young-Sup;Yoon, Kyung-Hyun
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.2
    • /
    • pp.187-199
    • /
    • 2007
  • The purpose of painterly rendering is to express real painting work from input image. For expression of real pain ting impression, drawing condition is one of main element. In this paper, we propose new algorithm for using density of edges. Drawing condition of new algorithm uses color difference and density of edges. And for finding next position from current position, we used dynamic grid. We did direction interpolation for coherence direction. Also using various texture brush, we express the feel of a material effective. We show results of images rendered more realistic oil painting effect, and discuss long-term goals for more effective result.

  • PDF