• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2044-2047
• /
• 2003

In this paper, we propose efficient motion vector refinement algorithm for frame-rate reduction transcoding. The proposed algorithm is to set the search range for motion refinement based on the incoming motion vector. The algorithm calculates the importance of motion vector of the skipped frame and then selects two motion vector to set search range. Through this process, we determine the accuracy of incoming motion vector and set the search range lot refinement adaptively by means of the accuracy. In experiments, we show efficiency of our algorithm to reduce the search points for refinement.

• Korean Journal of Computational Design and Engineering
• /
• v.22 no.2
• /
• pp.110-117
• /
• 2017

Delaunay refinement algorithm is a classical method to generate quality triangular meshes when point cloud and/or constrained edges are given in two- or three-dimensional space. It computes the Delaunay triangulation for given points and edges to obtain an initial solution, and update the triangulation by inserting steiner points one by one to get an improved quality triangulation. This process repeats until it satisfies given quality criteria. The efficiency of the algorithm depends on the criteria and point insertion method. In this paper, we propose a method to accelerate the Delaunay refinement algorithm by applying geometric hashing technique called bucketing when inserting a new steiner point so that it can localize necessary computation. We have tested the proposed method with a few types of data sets, and the experimental result shows strong linear time behavior.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.23 no.3
• /
• pp.331-340
• /
• 2010

The basic theory and application of new adaptive finite element algorithm have been proposed in this study including the adaptive hp-refinement strategy, and the effective method for constructing hp-approximation. The hp-adaptive finite element concept needs the integrals of Legendre shape function, nonuniform p-distribution, and suitable constraint of continuity in conjunction with irregular node connection. The continuity of hp-adaptive mesh is an important problem at the common boundary of element interface. To solve this problem, the constraint of continuity has been enforced at the common boundary using the connectivity mapping matrix. The effective method for constructing of the proposed algorithm has been developed by using hierarchical nature of the integrals of Legendre shape function. To verify the proposed algorithm, the problem of simple cantilever beam has been solved by the conventional h-refinement and p-refinement as well as the proposed hp-refinement. The result obtained by hp-refinement approach shows more rapid convergence rate than those by h-refinement and p-refinement schemes. It it noted that the proposed algorithm may be implemented efficiently in practice.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.41 no.4
• /
• pp.123-130
• /
• 2018

Triangulation is one of the fundamental problems in computational geometry and computer graphics community, and it has huge application areas such as 3D printing, computer-aided engineering, surface reconstruction, surface visualization, and so on. The Delaunay refinement algorithm is a well-known method to generate quality triangular meshes when point cloud and/or constrained edges are given in two- or three-dimensional space. In this paper, we propose a simple but efficient algorithm to triangulate Voronoi surfaces of Voronoi diagram of spheres in 3-dimensional Euclidean space. The proposed algorithm is based on the Ruppert's Delaunay refinement algorithm, and we modified the algorithm to be applied to the triangulation of Voronoi surfaces in two ways. First, a new method to deciding the location of a newly added vertex on the surface in 3-dimensional space is proposed. Second, a new efficient but effective way of estimating approximation error between Voronoi surface and triangulation. Because the proposed algorithm generates a triangular mesh for Voronoi surfaces with guaranteed quality, users can control the level of quality of the resulting triangulation that their application problems require. We have implemented and tested the proposed algorithm for random non-intersecting spheres, and the experimental result shows the proposed algorithm produces quality triangulations on Voronoi surfaces satisfying the quality criterion.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.25 no.12
• /
• pp.1926-1932
• /
• 2001

In this second part of the paper, the automatic mesh generation and remeshing algorithm using bubble packing method is applied to the nonlinear problem. The remeshing/refinement procedure is necessary in the large deformation process especially because the mesh distortion deteriorates the convergence and accuracy. To perform the nonliear analysis, the transfer of state variables such as displacement and strain is added to the algorithm of Part 1. The equilibrium equation based on total Lagrangian formulation and elasto-viscoplastic model is used. For the numerical experiment, the upsetting process including the contact constraint condition is analyzed by two refinement criteria. And from the result, it is addressed that the present algorithm can generate the refined meshes easily at the largely deformed area with high error.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.18 no.11
• /
• pp.2932-2943
• /
• 1994

An efficient approach to the automatic construction of effective quadrilateral finite element meshes for two-dimensional analysis is presented. The procedure is composed of, firstly, an initial mesh generation and, secondly, an h-version of adaptive refinement based on error analysis. As for an initial mesh generation scheme, a modified looping algorithm has been employed. For the adaptive refinement process, an error indicator obtained by computing the residual error of the equilibrium equations in the energy norm with a relaxation factor has been employed. Examples of mesh generation and self-adaptive mesh improvements are given. These example solutions demonstrate that an effective mesh for a given error tolerance can be obtained in a few steps of the analysis processes.

• Korean Journal of Computational Design and Engineering
• /
• v.8 no.1
• /
• pp.1-9
• /
• 2003

Recently, designing 3D objects using various modeling techniques become getting more important issues in related industrial fields. The subdivision scheme is a technique that generates a smooth sur-face through many times of refinement processes that split polygons of control mesh into several smaller polygons. In this paper, we propose a new subdivision algorithm that preserves sharp-edges of control mesh after several refinement processes in the Doo-Sabin subdivision scheme. Using the pro-posed algorithm, the Doo-Sabin subdivision scheme can be well applied to modeling 3D objects with sharp-edges.

• 한국HCI학회:학술대회논문집
• /
• 2009.02a
• /
• pp.285-289
• /
• 2009

Tag is important to retrieve and classify contents. However, someone uses so many unrelated tags with contents for the high ranking In this work, we propose tag refinement algorithm using TextRank. We calculate the importance of keywords occurred a title, description, tag, and comments. We refine tags removing unrelated keywords from user generated tags. From the results of experiments, we can see that proposed method is useful for refining tags.

• Transactions of Materials Processing
• /
• v.12 no.4
• /
• pp.334-339
• /
• 2003

This paper presents a new algorithm that enables the refinement of hexahedral elements while maintaining the appropriate connectivity. In the algorithm, at first the regions of mesh to be refined are defined and, then, the zero-thickness element layers are inserted into the interfaces between the regions. All the meshes in the regions, in which the zero-thickness layers are inserted, are to be regularized in order to improve the shape of the slender elements on the interfaces. This algorithm is applied to the analysis of plastic deformation process. The results show that the refined mesh gives smaller relative errors than the original mesh.

• International journal of advanced smart convergence
• /
• v.8 no.2
• /
• pp.94-101
• /
• 2019

Building a stable knowledge base is an important issue in the application of knowledge engineering. In this paper, we present an algorithm for detecting and locating discrepancies in the line of the reasoning process especially when discrepancies occur on belief values. This includes backtracking the rule firing from a goal node of the rule network. Retracting a belief function allows the current belief state to move back to another belief state without the rule firing. It also gives an estimate, called contribution measure, of how much the rule has an impact on the current belief state. Examining the measure leads the expert to locate the possible cause of problem in the rule. For non-monotonic reasoning, the belief retraction method moves the belief state back to the previous state. A tracing algorithm is presented to identify and locate the cause of problem. This also gives repair suggestions for rule refinement.