• Title/Summary/Keyword: Direction Map

Search Result 542, Processing Time 0.024 seconds

Z-map Model Using Triangular Grids (삼각 격자를 이용한 Z-map 모델)

  • Park, Pae-Yong;Ahn, Jeong-Ho
    • Proceedings of the KSME Conference
    • /
    • 2000.11a
    • /
    • pp.824-828
    • /
    • 2000
  • Prior to the downloading of the NC codes to a machining center, the NC tool-path can be verified in a computer. The Z-map is one of the tools for the verification of NC tool-path. The Z-map is a two dimensional array in which the height values of the Z-axis direction vectors are stored. The Z-axis direction vectors are arranged in a rectangular grid pattern on the XY plane. The accuracy of the simulation comes from the grid interval. In the rectangular Z-map, the distances between the grid points are different. The distance in diagonal direction is larger than those in X or Y axis directions. For the rendering of the Z-map, a rectangular grid is divided into two triangular facets. Depending on the selection of a diagonal, there are two different cases. In this paper, triangular Z-map, in which the Z-axis direction vectors are arranged in a triangular grid pattern on XY plane, is proposed. In the triangular Z-map, the distances between grid points are equal. There is no ambiguity to make triangular facets for the rendering.

  • PDF

Generalized Cylinder based on Linear Interpolation by Direction Map

  • Kim, Hyun;Kim, Hyoung-Sun;Lee, Joo-Haeng
    • International Journal of CAD/CAM
    • /
    • v.3 no.1_2
    • /
    • pp.77-83
    • /
    • 2003
  • We propose two algorithms to generate (1) polygonal meshes and (2) developable surface patches far generalized cylinders defined by contours of discrete curves. To solve the contour blending problem of generalized cylinder, the presented algorithms have adopted the algorithm and related properties of LIDM (linear interpolation by direction map) that interpolate geometric shapes based on direction map merging and group scaling operations. Proposed methods are fast to compute and easy to implement.

Efficient Computation and Control of Geometric Shape Morphing based on Direction Map (방향지도 기반 기하모핑의 효율적인 계산 및 제어 방법)

  • Lee, J.H.;Kim, H.;Kim, H.S.
    • Korean Journal of Computational Design and Engineering
    • /
    • v.8 no.4
    • /
    • pp.243-253
    • /
    • 2003
  • This paper presents a new geometric morphing algorithm for polygons based on a simple geometric structure called direction map, which is mainly composed of a circular list of direction vectors defined by two neighboring vertices of a polygon. To generate a sequence of intermediate morphing shapes, first we merge direction maps of given control shapes based on a certain ordering rule of direction vectors, and scale the length of each direction vectors using Bezier or blossom controls. We show that the proposed algorithm is an improvement of the previous methods based on Minkowski sum (or convolution) in th aspects of computational efficiency and geometric properties.

Automatic detection of the optimal ejecting direction based on a discrete Gauss map

  • Inui, Masatomo;Kamei, Hidekazu;Umezu, Nobuyuki
    • Journal of Computational Design and Engineering
    • /
    • v.1 no.1
    • /
    • pp.48-54
    • /
    • 2014
  • In this paper, the authors propose a system for assisting mold designers of plastic parts. With a CAD model of a part, the system automatically determines the optimal ejecting direction of the part with minimum undercuts. Since plastic parts are generally very thin, many rib features are placed on the inner side of the part to give sufficient structural strength. Our system extracts the rib features from the CAD model of the part, and determines the possible ejecting directions based on the geometric properties of the features. The system then selects the optimal direction with minimum undercuts. Possible ejecting directions are represented as discrete points on a Gauss map. Our new point distribution method for the Gauss map is based on the concept of the architectural geodesic dome. A hierarchical structure is also introduced in the point distribution, with a higher level "rough" Gauss map with rather sparse point distribution and another lower level "fine" Gauss map with much denser point distribution. A system is implemented and computational experiments are performed. Our system requires less than 10 seconds to determine the optimal ejecting direction of a CAD model with more than 1 million polygons.

Map Detection using Deep Learning

  • Oh, Byoung-Woo
    • Journal of Advanced Information Technology and Convergence
    • /
    • v.10 no.2
    • /
    • pp.61-72
    • /
    • 2020
  • Recently, researches that are using deep learning technology in various fields are being conducted. The fields include geographic map processing. In this paper, I propose a method to infer where the map area included in the image is. The proposed method generates and learns images including a map, detects map areas from input images, extracts character strings belonging to those map areas, and converts the extracted character strings into coordinates through geocoding to infer the coordinates of the input image. Faster R-CNN was used for learning and map detection. In the experiment, the difference between the center coordinate of the map on the test image and the center coordinate of the detected map is calculated. The median value of the results of the experiment is 0.00158 for longitude and 0.00090 for latitude. In terms of distance, the difference is 141m in the east-west direction and 100m in the north-south direction.

A Search on the New Direction of Meridian Study (경락 연구의 새로운 방향 탐색 - 경락 연구의 로드맵 작성을 중심으로 -)

  • Choi, Hwan-Soo
    • Korean Journal of Acupuncture
    • /
    • v.21 no.3
    • /
    • pp.1-20
    • /
    • 2004
  • Objective : Today, a study about the meridian is at a standstill because there is no any fundamental study to verify an essence of meridian or to take advantage of meridain. It searched the direction of new meridain study by making out road-map about meridain study to overcome the standstill. Method : It has had a through grasp of the problem of meridian study through analysis of papers for degrees and academy journals of study in connection with meridian published till now. It has made out road-map of Meridian study under a principle establishing road-map because of these problems. Results : The major problems of former studies about meridain are as follows. One is not to have any cooperation with other medical fields. The other is not to have any practical study. It searched the direction of new meridian study by road-map detailed as well as overall to overcome the difficulties. Conclusions : The new direction of meridian study is to build ideal methodical frame and modern meridian model through studying of among school systems. It will interpret newly and modernize traditional meridian theory with being connected with science technology.

  • PDF

A Single Field Deinterlacing Algorithm Using Edge Map in the Image Block (영상 블록에서의 에지 맵을 이용한 단일 필드 디인터레이싱 알고리듬)

  • Kang, Kun-Hwa;Jeon, Gwang-Gil;Jeong, Je-Chang
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.4C
    • /
    • pp.355-362
    • /
    • 2009
  • A new intra field deinterlacing algorithm with edge map in the image block is introduced. Conventional deinterlacing methods usually employ edge-based line average algorithm within pixel-by-pixel approach. However, it is sensitive to variation of intensity. To reduce this shortcoming, we proposed edge direction vector computed by edge map, and also its interpolation technique. We first introduce an edge direction vector, which is computed by Sobel mask, so that finer resolution of the edge direction can be acquired. The proposed edge direction vector oriented deinterlacer operates by identifying small pixel variations in five orientations, while weighted averaging to estimate missing pixel. According to the edge direction of the direction vector, we calculate weights on each edge direction. These weight values multiplied by the candidate deinterlaced pixels in order to successively build approximations of the deinterlaced sequence.

Plain Fingerprint Classification Based on a Core Stochastic Algorithm

  • Baek, Young-Hyun;Kim, Byunggeun
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.5 no.1
    • /
    • pp.43-48
    • /
    • 2016
  • We propose plain fingerprint classification based on a core stochastic algorithm that effectively uses a core stochastic model, acquiring more fingerprint minutiae and direction, in order to increase matching performance. The proposed core stochastic algorithm uses core presence/absence and contains a ridge direction and distribution map. Simulations show that the fingerprint classification accuracy is improved by more than 14%, on average, compared to other algorithms.

Cognitive Map Analysis on the Policy of SMEs and Ventures in the Field of Information Technology (정보통신분야 중소벤처기업 지원정책에 관한 인지지도 분석)

  • Lee, Jungmann;Hwang, Guehee
    • The Journal of the Korea Contents Association
    • /
    • v.13 no.11
    • /
    • pp.347-355
    • /
    • 2013
  • This study analyzed President Lee's speeches of Korea and the policy of SMES and ventures in the field of information technology using cognitive map analysis. The relationship analysis between policy tool variables and policy goal variables was employed to derive policy direction of IT SMEs and ventures. This paper suggests growth competence reinforcement, investment revitalization, revitalization of start-up companies, enhancement of technology competition, globalization and job creation to the policy direction of IT SMEs and ventures. In this paper, we constructed a cognitive map on the policy vision of SMEs and ventures in the field of information technology. This study also showed that this cognitive map could be characterized by a scarcity of feedback loops and a strong emphasis on the positive loops in the structure of virtuous circle.

Generation of Digital Orthoimage using ADS40 Images (ADS40영상에 의한 수치정사영상 생성)

  • Lee, Jun-Hyuk;Lee, Young-Jin
    • Spatial Information Research
    • /
    • v.16 no.3
    • /
    • pp.317-330
    • /
    • 2008
  • In this paper, the acquisition of digital imagery and the orthoimage generation were performed to set up working process. And another purpose of this thesis is to evaluate the accuracy of orthoimage by overlapping digital topographic map and digital cadastral map on it. The digital topographic map and digital cadastral map were superimposed on the orthoimage to check the accuracy as another approach of evaluation. The RMSE is ${\pm}0.364m$ in X direction and ${\pm}0.413m$ in Y direction with digital topographical maps(1/5,000). And the RMSE is ${\pm}1.283m$ in X direction and ${\pm}1.085m$ in Y direction with digital cadastral map. It is necessary for the application of a newly developed digital aerial camera to make an exact synchronization between GPS/IMU data and image data, use a technology for setting a standard image resolution and the number of ground control points.

  • PDF