• Title/Summary/Keyword: error of graph

Search Result 179, Processing Time 0.028 seconds

Triangulation Based Skeletonization and Trajectory Recovery for Handwritten Character Patterns

  • Phan, Dung;Na, In-Seop;Kim, Soo-Hyung;Lee, Guee-Sang;Yang, Hyung-Jeong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.1
    • /
    • pp.358-377
    • /
    • 2015
  • In this paper, we propose a novel approach for trajectory recovery. Our system uses a triangulation procedure for skeletonization and graph theory to extract the trajectory. Skeletonization extracts the polyline skeleton according to the polygonal contours of the handwritten characters, and as a result, the junction becomes clear and the characters that are touching each other are separated. The approach for the trajectory recovery is based on graph theory to find the optimal path in the graph that has the best representation of the trajectory. An undirected graph model consisting of one or more strokes is constructed from a polyline skeleton. By using the polyline skeleton, our approach accelerates the process to search for an optimal path. In order to evaluate the performance, we built our own dataset, which includes testing and ground-truth. The dataset consist of thousands of handwritten characters and word images, which are extracted from five handwritten documents. To show the relative advantage of our skeletonization method, we first compare the results against those from Zhang-Suen, a state-of-the-art skeletonization method. For the trajectory recovery, we conduct a comparison using the Root Means Square Error (RMSE) and Dynamic Time Warping (DTW) in order to measure the error between the ground truth and the real output. The comparison reveals that our approach has better performance for both the skeletonization stage and the trajectory recovery stage. Moreover, the processing time comparison proves that our system is faster than the existing systems.

2-step Phase-shifting Digital Holographic Optical Encryption and Error Analysis

  • Jeon, Seok-Hee;Gil, Sang-Keun
    • Journal of the Optical Society of Korea
    • /
    • v.15 no.3
    • /
    • pp.244-251
    • /
    • 2011
  • We propose a new 2-step phase-shifting digital holographic optical encryption technique and analyze tolerance error for this cipher system. 2-step phase-shifting digital holograms are acquired by moving the PZT mirror with phase step of 0 or ${\pi}$/2 in the reference beam path of the Mach-Zehnder type interferometer. Digital hologram with the encrypted information is Fourier transform hologram and is recorded on CCD camera with 256 gray-level quantized intensities. The decryption performance of binary bit data and image data is analyzed by considering error factors. One of the most important errors is quantization error in detecting the digital hologram intensity on CCD. The more the number of quantization error pixels and the variation of gray-level increase, the more the number of error bits increases for decryption. Computer experiments show the results to be carried out encryption and decryption with the proposed method and the graph to analyze the tolerance of the quantization error in the system.

Fast Sampling Set Selection Algorithm for Arbitrary Graph Signals (임의의 그래프신호를 위한 고속 샘플링 집합 선택 알고리즘)

  • Kim, Yoon-Hak
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.15 no.6
    • /
    • pp.1023-1030
    • /
    • 2020
  • We address the sampling set selection problem for arbitrary graph signals such that the original graph signal is reconstructed from the signal values on the nodes in the sampling set. We introduce a variation difference as a new indirect metric that measures the error of signal variations caused by sampling process without resorting to the eigen-decomposition which requires a huge computational cost. Instead of directly minimizing the reconstruction error, we propose a simple and fast greedy selection algorithm that minimizes the variation differences at each iteration and justify the proposed reasoning by showing that the principle used in the proposed process is similar to that in the previous novel technique. We run experiments to show that the proposed method yields a competitive reconstruction performance with a substantially reduced complexity for various graphs as compared with the previous selection methods.

A Modeling of Proportional Pressure Control Valve and its Control (비례전자 감압밸브의 모델링과 제어)

  • Yang, K.U.;Lee, I.Y.
    • Journal of Power System Engineering
    • /
    • v.6 no.3
    • /
    • pp.71-77
    • /
    • 2002
  • In this study, a dynamic model of proportional pressure control valve using the bond graph and a predictive controller are presented in the form of dynamic matrix control which is concerned with a design method of digital controller for the electro hydraulic servo system. The bond graph can be utilized for all types of systems which involve power and energy, and it is applied to a propotional pressure control valve in this study. Recently, many researchers suggested that better control performance could be obtained by means of the predictive controls with future reference input, future control output and future control error. The Predictive controller is very practical because the controller can be easily applicable to a personal computer or a microprocessor. This study investigates through numerical simulations that hydraulic system with the predictive controller shows very good control performances.

  • PDF

Improvement on the Speed-Response of DC Motor Using Bond Graph Modeling Method (본드그래프모델링 방식을 이용한 직류전동기의 속도응답개선에 관한 연구)

  • 신위재;하홍곤
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.16 no.4
    • /
    • pp.309-318
    • /
    • 1991
  • In this paper, the integrator used to reduce the error between the reference signal and response, and DC motor are constructed by bond graph. Then the model following servo controller which have the high adaptation with respect to inertia, disturbance and/or load variation in the speed control system of DC motor is designed by the bond graph, and then the usefullness of this modeling method is confirmed in operating analysis and design on controller.

  • PDF

Error Analysis for Optical Security by means of 4-Step Phase-Shifting Digital Holography

  • Lee, Hyun-Jin;Gil, Sang-Keun
    • Journal of the Optical Society of Korea
    • /
    • v.10 no.3
    • /
    • pp.118-123
    • /
    • 2006
  • We present an optical security method for binary data information by using 4-step phase-shifting digital holography and we analyze tolerance error for the decrypted data. 4-step phase-shifting digital holograms are acquired by moving the PZT mirror with equidistant phase steps of ${\pi}/2$ in the Mach-Zender type interferometer. The digital hologram in this method is a Fourier transform hologram and is quantized with 256 gray level. The decryption performance of the binary data information is analyzed. One of the most important errors is the quantization error in detecting the hologram intensity on CCD. The greater the number of quantization error pixels and the variation of gray level increase, the more the number of error bits increases for decryption. Computer experiments show the results for encryption and decryption with the proposed method and show the graph to analyze the tolerance of the quantization error in the system.

An Iterative Approach to Graph-based Word Sense Disambiguation Using Word2Vec (Word2Vec을 이용한 반복적 접근 방식의 그래프 기반 단어 중의성 해소)

  • O, Dongsuk;Kang, Sangwoo;Seo, Jungyun
    • Korean Journal of Cognitive Science
    • /
    • v.27 no.1
    • /
    • pp.43-60
    • /
    • 2016
  • Recently, Unsupervised Word Sense Disambiguation research has focused on Graph based disambiguation. Graph-based disambiguation has built a semantic graph based on words collocated in context or sentence. However, building such a graph over all ambiguous word lead to unnecessary addition of edges and nodes (and hence increasing the error). In contrast, our work uses Word2Vec to consider the most similar words to an ambiguous word in the context or sentences, to rebuild a graph of the matched words. As a result, we show a higher F1-Measure value than the previous methods by using Word2Vec.

  • PDF

A Study on the Understanding and Errors of the Logarithmic Function in High School Students (고등학교 학생들의 로그함수에 대한 이해도 및 오류에 관한 연구)

  • 이경숙;김승동
    • Journal of the Korean School Mathematics Society
    • /
    • v.5 no.1
    • /
    • pp.111-122
    • /
    • 2002
  • The purpose of this study was to examine high school second graders' understanding of the basic nature of logarithm, the major type of error they made about logarithmic function and the cause of such an error, and to seek ways to instruct it better. For that purpose, three research questions were posed: 1. Investigate how much high school students in their second year comprehend the nature of logarithm. 2. Analyze what type of error they make about logarithmic function. 3. Analyze the cause of their error according to the selected error models and how it could be taught more efficiently. The findings of this study were as below: First, the natural science students had a better understanding of the basic nature of logarithm than the academic students. What produced the widest gap between the two groups' understanding was applying the nature of logarithm to the given problems, and what caused the smallest gap was the definition of logarithm and the condition of base. Second, the academic students had a poorer understanding of the basic nature of logarithmic function graph and of applying the nature of logarithm to the given problems. Third, the natural science students didn't comprehend well the basic nature of logarithmic function graph, the nature of characteristics and mantissa. Fourth, for all the students from academic and natural science courses, the most common errors were caused by the poor understanding of theorem or nature of the [E4] model. Fifth, the academic students made more frequent errors due to the unfamiliar signs of the [El] model, the imperfect understanding of theorem or nature of the [E4] model, and the technical part of the [E6] model. Sixth, the natural science students made more frequent errors because of the improper problem interpretation of the [E2] model and the logically improper inference of the [E3] model.

  • PDF

Resistance Performance Simulation of Simple Ship Hull Using Graph Neural Network (그래프 신경망을 이용한 단순 선박 선형의 저항성능 시뮬레이션)

  • TaeWon, Park;Inseob, Kim;Hoon, Lee;Dong-Woo, Park
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.59 no.6
    • /
    • pp.393-399
    • /
    • 2022
  • During the ship hull design process, resistance performance estimation is generally calculated by simulation using computational fluid dynamics. Since such hull resistance performance simulation requires a lot of time and computation resources, the time taken for simulation is reduced by CPU clusters having more than tens of cores in order to complete the hull design within the required deadline of the ship owner. In this paper, we propose a method for estimating resistance performance of ship hull by simulation using a graph neural network. This method converts the 3D geometric information of the hull mesh and the physical quantity of the surface into a mathematical graph, and is implemented as a deep learning model that predicts the future simulation state from the input state. The method proposed in the resistance performance experiment of simple hull showed an average error of about 3.5 % throughout the simulation.

Comparison of Code Similarity Analysis Performance of funcGNN and Siamese Network (funcGNN과 Siamese Network의 코드 유사성 분석 성능비교)

  • Choi, Dong-Bin;Jo, In-su;Park, Young B.
    • Journal of the Semiconductor & Display Technology
    • /
    • v.20 no.3
    • /
    • pp.113-116
    • /
    • 2021
  • As artificial intelligence technologies, including deep learning, develop, these technologies are being introduced to code similarity analysis. In the traditional analysis method of calculating the graph edit distance (GED) after converting the source code into a control flow graph (CFG), there are studies that calculate the GED through a trained graph neural network (GNN) with the converted CFG, Methods for analyzing code similarity through CNN by imaging CFG are also being studied. In this paper, to determine which approach will be effective and efficient in researching code similarity analysis methods using artificial intelligence in the future, code similarity is measured through funcGNN, which measures code similarity using GNN, and Siamese Network, which is an image similarity analysis model. The accuracy was compared and analyzed. As a result of the analysis, the error rate (0.0458) of the Siamese network was bigger than that of the funcGNN (0.0362).