• The KIPS Transactions:PartB
• /
• v.12B no.2 s.98
• /
• pp.115-122
• /
• 2005

The sub-mage matching problem in which one image contains some part of the other image, has been mostly investigated on natural images. In this paper, we propose two sub-image matching techniques: mesh-based method and correlation-based method, that are efficiently used to match text images. Mesh-based method consists of two stages, box alignment and similarity measurement by extracting the mesh feature from the two images. Correlation-based method determines the similarity using the correlation of the two images based on FFT function. We have applied the two methods to the text verification in a postal automation system and observed that the accuracy of correlation-based method is $92.7\%$ while that of mesh-based method is $90.1\%$.

• Transactions of Materials Processing
• /
• v.31 no.4
• /
• pp.200-206
• /
• 2022

The finite element analysis is one of the representative methods for predicting the materials behavior for experiments that are difficult to perform empirically. Constitutive equations are essential for reducing computation time and sharing data because they enable finite element analysis simulations through simple formulae. However, it is difficult to derive accurate flow curves for all materials as most constitutive equations are not formulated based on their physical meaning. Also, even if the constitutive equation is a good representation of the flow curve to the experimental results, some fundamental issues remain unresolved, such as the effect of mesh size on the calculation results. In this study, a new constitutive equation was proposed to predict various materials by modifying the combined Swift-Voce model, and the calculation results with various mesh sizes were compared to better simulate the experimental results.

• Economic and Environmental Geology
• /
• v.19 no.spc
• /
• pp.227-237
• /
• 1986

The Duk-Eum mine located in Kongsan-myeon, Naju-gun, Cheolanamdo is producing silver ore mainly, with rare gold association. The grade-up and recovery of the concentrates have been concerned to the main problem. And then, this study aimed at applying the basic data for ore processing. In the first half of the study, the attempts were made to identify the ore minerals, this followed by determination of the mineral texture, paragenesis, grain size, and size distribution by employing the microscopical method and the etching test. The results of the study are as follows: 1. The ore deposit is composed of the hydrothermal fissure linked veins, and filling cavities are mostly tensile fractures or joints, in rhyolitic rocks as a wall rock. 2. The principle ore minerals are native silver, acanthite, canfieldite, pyrargyrite, galena, tetrahedrite, sphalerite, pyrrhotite, chalcopyrite, chalcocite, covellite, zincite, and the gangue minerals are quartz and calcite. 3. The grain size of each ore minerals before grinding are; max. $2\frac{1}{2}$ mesh, medium 48-100 mesh(main size, contained over 80%), min. 3200mesh. And the grain size of each ore minerals after grinding is; max. 42mesh, medium 65-250mesh(main size, contained over 80%), min. 3200mesh. 4. The properties of the mineral texture effected on the ore dressing are follows; a) Inclusion texture; the fine grains of chalcopyrite is included in most acanthite, and rarely, that of galena included in acanthite. b) Exsolution texture; pyrargyrite is exsolved in acanthite. c) Replacement texture; native silver replaced pyrargyrite, and acanthite replaced galena. d) Interlocking paragenetic texture; the interlocking paragenetic minerals are pyrite, chalcopyrite, chalcocite, canfieldite. e) Fissure filling texture; chalcopyrite was filled along the cracks in acanthite. Among of the above texture, it is impossible to liberate the grains of a), and more difficult to liberate those of b) and c), while easy to liberate those of d) and e).

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.5
• /
• pp.335-343
• /
• 2009

The crossed cube has received great attention because it has equal or superior properties compared to the hypercube that is widely known as a versatile parallel processing system. It has been known that disjoint two copies of a mesh of size $4{\times}2^m$ or disjoint four copies of a mesh of size $8{\times}2^m$ can be embedded into a crossed cube with dilation 1 and expansion 1 [Dong, Yang, Zhao, and Tang, 2008]. However, it is not known that disjoint multiple copies of a mesh with more than eight rows and columns can be embedded into a crossed cube with dilation 1 and expansion 1. In this paper, we show that disjoint $2^{n-1}$ copies of a mesh of size $2^n{\times}2^m$ can be embedded into a crossed cube with dilation 1 and expansion 1 where $n{\geq}1$ and $m{\geq}3$. Our result is optimal in terms of dilation and expansion that are important measures of graph embedding. In addition, our result is practically usable in allocating multiple jobs of mesh structure on a parallel computer of crossed cube structure.

• The KIPS Transactions:PartA
• /
• v.16A no.4
• /
• pp.223-226
• /
• 2009

The twisted cube has received great attention as an interconnection network of parallel systems because it has several superior properties, especially in diameter, to the hypercube. It was recently known that, for even m, a mesh of size $2{\times}2^m$ can be embedded into a twisted cube with dilation 1 and expansion 1 and a mesh of size $4{\times}2^m$ with dilation 1 and expansion 2 [Lai and Tsai, 2008]. However, as we know, it has been a conjecture that a mesh with more than eight rows and columns can be embedded into a twisted cube with dilation 1. In this paper, we show that a mesh of size $2^n{\times}2^m$ can be embedded into a twisted cube with dilation 1 and expansion $2^{n-1}$ for even m and with dilation 1 and expansion $2^n$ for odd m where $1{\leq}n{\leq}m$.

• The KIPS Transactions:PartA
• /
• v.15A no.4
• /
• pp.189-198
• /
• 2008

In this paper, we prove mesh-like networks can be embedded into Petersen-Torus(PT) networks. Once interconnection network G is embedded in H, the parallel algorithm designed in Gcan be applied to interconnection network H. The torus is embedded into PT with dilation 5, link congestion 5 and expansion 1 using one-to-one embedding. The honeycomb mesh is embedded into PT with dilation 5, link congestion 2 and expansion 5/3 using one-to-one embedding. Additional, We derive average dilation. The embedding algorithm could be available in both wormhole routing system and store-and-forward routing system by embedding the generally known Torus and honeycomb mesh networks into PT at 5 or less of dilation and congestion, and the processor throughput could be minimized at simulation through one-to-one.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.1
• /
• pp.149-159
• /
• 2008

In this paper, we propose a blind watermarking algorithm of 3d mesh model using spherical parameterization. Spherical parameterization is a useful method which is applicable to 3D data processing. Especially, orthogonal coordinate can not analyse the feature of the vertex coordination of the 3D mesh model, but this is possible to analyse and process. In this paper, the centroid center of the 3D model was set to the origin of the spherical coordinate, the orthogonal coordinate system was transformed to the spherical coordinate system, and then the spherical parameterization was applied. The watermark was embedded via addition/modification of the vertex after the feature analysis of the geometrical information and topological information. This algorithm is robust against to the typical geometrical attacks such as translation, scaling and rotation. It is also robust to the mesh reordering, file format change, mesh simplification, and smoothing. In this case, the this algorithm can extract the watermark information about $90{\sim}98%$ from the attacked model. This means it can be applicable to the game, virtual reality and rapid prototyping fields.

• Journal of Internet of Things and Convergence
• /
• v.9 no.6
• /
• pp.125-134
• /
• 2023

The purpose of this paper is to propose a method to improve the performance of the previous research is characterized by recognizing facial gestures from the 3D coordinates of seven landmarks selected from the MediaPipe Face Mesh model, generating corresponding user events, and executing corresponding commands. The proposed method applied adaptive moving average processing to the cursor positions in the process to stabilize the cursor by alleviating microtremor, and improved performance by blocking temporary opening/closing discrepancies between both eyes when opening and closing both eyes simultaneously. As a result of the usability evaluation of the proposed facial gesture interface, it was confirmed that the average recognition rate of facial gestures was increased to 98.7% compared to 95.8% in the previous research.

• Journal of computational fluids engineering
• /
• v.17 no.2
• /
• pp.35-41
• /
• 2012

This paper presents incompressible Navier-Stokes solution algorithm for 2D Free-surface flow problems on the Cartesian mesh, which was implemented to run on Graphics Processing Units(GPU). The INS solver utilizes the variable arrangement on the Cartesian mesh, Finite Volume discretization along Constrained Interpolation Profile-Conservative Semi-Lagrangian(CIP-CSL). Solution procedure of incompressible Navier-Stokes equations for free-surface flow takes considerable amount of computation time and memory space even in modern multi-core computing architecture based on Central Processing Units(CPUs). By the recent development of computer architecture technology, Graphics Processing Unit(GPU)'s scientific computing performance outperforms that of CPU's. This paper focus on the utilization of GPU's high performance computing capability, and presents an efficient solution algorithm for free surface flow simulation. The performance of the GPU implementations with double precision accuracy is compared to that of the CPU code using an representative free-surface flow problem, namely. dam-break problem.

• Korean Journal of Materials Research
• /
• v.3 no.2
• /
• pp.103-110
• /
• 1993

Abstract It has been attempted to make the copper-graphite composites by deposition of copper on the surface of graphite through the hydrogen reduction of copper chlorides. Both KISH and natural graphites of less than 325 mesh were used as substrates and the hydrogen reduction also was conducted in the range of 350-50$0^{\circ}C$. The distribution of copper on the surface of graphite was found to increase with the decrease of reduction temperature. In addition. the partial pressure of hydrogen played an important role in the overall rate of reduction which was substantially dominated by the chemical reaction on the surface of each particle. It was concluded that the reduction temperature should be maintained as low as possible to accomplish the well distribution of copper in the composites.