• Proceedings of the Korean Society of Tribologists and Lubrication Engineers Conference
• /
• 2002.10b
• /
• pp.83-84
• /
• 2002

For estimation of chain-matching phenomena between normal paraffin as a solvent and straight-chain fatty acid as an additive, the density measurement of n-dodecane, n-tetradecane and n-hexadecane were carried out at oil temperature 313K and pressure up to 1.3 GPa. Their solidification pressure were easily determined by the appearance of molecular crystal, abrupt volumetric contraction and generation of heat of solidification and showed minima under the matching condition. The bulk modulus K of molecular crystal was evaluated using phase diagram. The bulk modulus showed maxima under the each matching condition. The chain matching effect on the bulk modulus beyond the scope of the interfacial phenomena are confirmed.

• Journal of Intelligence and Information Systems
• /
• v.13 no.4
• /
• pp.35-44
• /
• 2007

This paper proposes a new method of weighted template matching for machine-printed numeral recognition. The proposed weighted template matching, which emphasizes the feature of a pattern using adaptive Hamming distance on local feature areas, improves the recognition rate while template matching processes an input image as one global feature. Template matching is vulnerable to random noises that generate ragged outlines of a pattern when it is binarized. This paper offers a method of chain code trimming in order to remove ragged outlines. The method corrects specific chain codes within the chain codes of the inner and the outer contour of a pattern. The experiment compares confusion matrices of both the template matching and the proposed weighted template matching with chain code trimming. The result shows that the proposed method improves fairly the recognition rate of the machine-printed numerals.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.311-311
• /
• 2000

We propose a DP-based formulation for matching line patterns by defining a robust and stable geometric representation that is based on the conceptual organizations. Usually, the endpoint proximity and collinearity of image lines, as two main conceptual organization groups, are useful cues to match the model shape in the scene. As the endpoint proximity, we detect junctions from image lines. We then search for junction groups by using geometric constraint between the junctions. A junction chain similar to the model chain is searched in the scene, based on a local comparison. A Dynamic Programming-based search algorithm reduces the time complexity for the search of the model chain in the scene. Our system can find a reasonable matching, although there exist severely distorted objects in the scene. We demonstrate the feasibility of the DP-based matching method using both synthetic and real images.

• Journal of Intelligence and Information Systems
• /
• v.13 no.4
• /
• pp.65-78
• /
• 2007

This paper proposes a new method of weighted template matching for machine-printed numeral recognition. The proposed weighted template matching, which emphasizes the feature of a pattern using adaptive Hamming distance on local feature areas, improves the recognition rate while template matching processes an input image as one global feature. Template matching is vulnerable to random noises that generate ragged outlines of a pattern when it is binarized. This paper offers a method of chain code trimming in order to remove ragged outlines. The method corrects specific chain codes within the chain codes of the inner and the outer contour of a pattern. The experiment compares confusion matrices of both the template matching and the proposed weighted template matching with chain code trimming. The result shows that the proposed method improves fairly the recognition rate of the machine-printed numerals.

• Coupled systems mechanics
• /
• v.7 no.3
• /
• pp.255-268
• /
• 2018

Stability of MBC1, a specific matching boundary condition, is proved for atomic simulations of a diatomic chain. The boundary condition and the Newton equations that govern the atomic dynamics form a coupled system. Energy functions that decay along with time are constructed for both the boundary with the same type atoms and the one with different type atoms. For a nonlinear chain, MBC1 is also shown stable. Numerical verifications are presented. Moreover, MBC1 is proved to be stable for a two dimensional square lattice.

• Journal of Industrial Technology
• /
• v.29 no.A
• /
• pp.47-54
• /
• 2009

In this paper, we proposed hand detection and hand gesture recognition from USB camera video. Firstly, we extract hand region extraction using skin color information from a difference images. Background image is initially stored and extracted from the input images in order to reduce problems from complex backgrounds. After that, 16-directional chain code sequence is computed from the tracking of hand motion. These chain code sequences are compared with pre-trained models using DP matching. Our hand gesture recognition system can be used to control PowerPoint slides or applied to multimedia education systems. We got 92% hand region extraction accuracy and 82.5% gesture recognition accuracy, respectively.

• Journal of Soil and Groundwater Environment
• /
• v.20 no.3
• /
• pp.51-64
• /
• 2015

In the present study, we develop two history matching techniques based on Markov chain Monte Carlo method where radial basis function and Gaussian distribution generated by unconditional geostatistical simulation are employed as the random walk transition kernels. The Bayesian inverse methods for aquifer characterization as the developed models can be effectively applied to the condition even when the targeted information such as hydraulic conductivity is absent and there are transient hydraulic head records due to imposed stress at observation wells. The model which uses unconditional simulation as random walk transition kernel has advantage in that spatial statistics can be directly associated with the predictions. The model using radial basis function network shares the same advantages as the model with unconditional simulation, yet the radial basis function network based the model does not require external geostatistical techniques. Also, by employing radial basis function as transition kernel, multi-scale nested structures can be rigorously addressed. In the validations of the developed models, the overall predictabilities of both models are sound by showing high correlation coefficient between the reference and the predicted. In terms of the model performance, the model with radial basis function network has higher error reduction rate and computational efficiency than with unconditional geostatistical simulation.

• Proceedings of the KOSOMBE Conference
• /
• v.1996 no.05
• /
• pp.31-35
• /
• 1996

This paper presents a real time algorithm for monitoring of the arrythmia of ECG signal. A real time monitoring, following by detecting a QRS complex, is the most important. Using 2-dimensional time-delay coordinates which are reconstructed by the phase portrait plotting special trajectory, we detect QRS complexes. In this study, arrythmias are detected by matching the past standard template with tile present pattern when changing abruptly In order to matching with each other, we propose modified chain coding algorithm which applies vetor table consisting of eight orthonormal code(=binary code) to the phase portraits. This algorithm using logical function increases the weight if exceeding to the threshold determinded by correlation value and the distance from a straight line(y=x). Evaluating the performance of the proposed algorithm, we use standard MIT/BIH database. The results are fellowing, 1) Improve the speed of matching template than that of cross-correlation ever has been used. 2) Because the proposed algorithm is robust to varing fiducial point, it is possible to monitor the ECG signal with irregular RR interval. 3) In spite of baseline wandering owing to the low frequency noise, monitoring performance is not reduced.

• Proceedings of the KIEE Conference
• /
• 1988.07a
• /
• pp.659-661
• /
• 1988

SPM is MDC Processor for string pattern expressed in directional chain code. In this paper we consider the string pattern matching algorithm (Leve-nstein Algorithm) whitch is portion of Dynamic Programing, and propose architecture of SPM and simulate it on the R-T level to evaluate its architecture. We used the C language as the hardware description language, and developed it on the IBM PC/AT Zenix system V OS environment.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.375-377
• /
• 2003

In this study, we employ the control patches, which have been created in previous photogrammetric projects, serving for the candidates of the control points that are likely to be found in the newly taken photos by utilizing image matching technique. Among others, the successful implementation of the above idea lies in the underlying factors: (1). Predicting the control patches and projecting them onto new photos; (2). Alignment of control patches with respect to the new photos; (3). Generating the equivalent ground elements of control patches versus the new photos for the purpose of correlation; (4). Developing effective matching methods and matching strategy; (5). Refining the exterior orientation parameters. What may show significance in this work comparing to traditional aerial-triangulation chain is that whenever at least three matched control patches succeed in a single photo, it follows that single photo orientation is applicable. The experiments suggest the potential efficiency of automatic control point measurement from control patch database and photo orientation by the proposed workflow.