• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.5
• /
• pp.624-630
• /
• 2010

As electrocardiogram(ECG) signals are generally sampled with a frequency of over 200Hz, a method to compress diagnostic information without losing data is required to store and transmit them efficiently. In this paper, an ECG signal compression method, which uses feature points based on curvature, is proposed. The feature points of P, Q, R, S, T waves, which are critical components of the ECG signal, have large curvature values compared to other vertexes. Thus, these vertexes are extracted with the proposed method, which uses local extremum of curvatures. Furthermore, in order to minimize reconstruction errors of the ECG signal, extra vertexes are added according to the iterative vertex selection method. Through the experimental results on the ECG signals from MIT-BIH Arrhythmia database, it is concluded that the vertexes selected by the proposed method preserve all feature points of the ECG signals. In addition, they are more efficient than the AZTEC(Amplitude Zone Time Epoch Coding) method.

• Journal of Digital Convergence
• /
• v.11 no.8
• /
• pp.205-212
• /
• 2013

In this paper, we present a procedural modeling algorithms to create Korean traditional stone fence using the fractal subdivision. The main process of the algorithm is to get the next step mesh by subdividing each triangle in the previous step triangular mesh. This process is repeated recursively. Dividing each triangle into four sub-triangles after choosing a random point on each side of the triangle and moving each vertices in the normal direction with random perturbations make the bumpy appearance of stone fences. In each step we remove flat vertices which does not influence the shape of the stone. The discrete curvature determines the flatness of a vertex. New triangles whose vertices are the vertices around the removed vertex are added to make a triangular mesh.

• Journal of Korea Game Society
• /
• v.2 no.2
• /
• pp.28-36
• /
• 2002

In general, triangular meshes have been used for modeling geometric objects such as virtual game characters. The dense meshes give us considerable advantages in representing complex, highly detailed objects, while they are more expensive for storing, transmitting and rendering the objects. Therefore, several researches have been performed for producing a high quality approximation in place of detailed objects, that is, a simplification of triangular meshes. In this paper, we propose a new measure with respect to edges and vertices, which is called an approximate mean curvature and is used as criteria to simplify an original mesh. An edge mean curvature is computed by considering its neighboring edges, and a vertex mean curvature is defined as an average of its incident edges' mean curvatures. And we apply the proposed measure to simplify the models such as a bunny, dragon and teeth. As a result, we can see that the mean curvatures can be used as good criteria for providing much better approximation of models.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.13 no.1
• /
• pp.31-38
• /
• 2013

Patients with heart disease need long-term monitoring of the electrocardiogram (ECG) signal using a portable electrocardiograph. This trend requires the miniaturization of data storage and faster transmission to medical doctors for diagnosis. The ECG signal needs to be utilized for efficient storage, processing and transmission, and its data must contain the important components for diagnosis, such as the P wave, QRS-complex, and T wave. In this study, we select the vertex which has a larger curvature value than the threshold value for compression. Then, we reconstruct the compressed signal using by radial basis function interpolation. This technique guarantees a lower percentage of root mean square difference with respect to the extracted sample points and preserves all the important features of the ECG signal. Its effectiveness has been demonstrated in the experiment using the Massachusetts Institute of Technology and Boston's Beth Israel Hospital arrhythmia database.

• Journal of the Korean Society for Precision Engineering
• /
• v.22 no.10 s.175
• /
• pp.144-149
• /
• 2005

This study presents the method of extracting shape design data on any aspheric lens by reverse engineering. The design formula fur aspheric lenses is needed in almost all of the design, manufacture and measuring processes. The difficulty in designing the lens lies in the fact that it uses a complex formula for the aspheric surface, and many of the preliminary design values must be selected before actually inserting them into the formula. If the values could be extracted from an aspheric lens for which the structural design information is unknown and used in designing other lenses of similar characteristics, the difficulties in designing and measuring aspheric lens could be reduced. Therefore, in this study, the concept of reverse engineering was applied to demonstrate the method of extracting shape design information of aspheric lens from an arbitrary aspheric lens.

• Journal of Korea Multimedia Society
• /
• v.12 no.1
• /
• pp.50-57
• /
• 2009

This paper proposes a extraction of feature lines on a polygonal model using local implicit surface fitting technique. To extract feature lines on a polygonal model, the previous technique addressed to compute the curvature and their derivatives at mesh vertices via global implicit surface fitting. It needs a user-specified precision parameter for finding an accurate projection of the mesh vertices onto an approximating implicit surface and requires high-time consumption. But we use a local implicit surface fitting technique to estimate the local differential information near a vertex by means of an approximating surface. Feature vertices are easily detected as zero-crossings, and can then be connected along the direction of principal curvature. Our method, demonstrated on several large polygonal models, produces a good fit which leads to improved visualization.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.8
• /
• pp.863-874
• /
• 1999

세분화란 초기 원형 모델의 삼각형 메쉬를 여러 개의 작은 메쉬로 변환하는 기법으로, 간략화 된 모델을 다시 원상태로 표현하기 위해 사용된다. 기존의 보간에 의한 세분화는 전체 모델의 에지에 일률적으로 세분화를 적용하기 때문에, 효과가 적은 부분까지도 세분화가 수행하게 되어 효율이 떨어진다. 본 논문에서는 정점 변화율을 기반으로 에지를 선택하여 세분화를 수행한다. 따라서 원형 메쉬를 변환하여 세분화된 메쉬를 생성할 때, 모델의 각 부분들은 정점 변화율의 차이에 의해 서로 다른 세분화 정도를 가지게 된다. 이 과정을 통해 원형 모델의 곡률 특성이 반영된 세분화를 수행할 수 있게 되고, 전체 모델의 세분화 정도를 조정하는 것도 가능해진다. Abstract The subdivision is a mesh transformation, which makes an original triangle mesh to subdivided meshes. This method is used for recovering original model from simplified model. The existing subdivision based on interpolation is inefficient, because it is targeted for whole edges of mesh model. Therefore, this method applies to non-effective parts. In this paper the subdivision is executed by edge selection based on curvature. When original model is transformed to subdivided model by proposed method, the parts of model has different subdivision degrees by means of the averages of vertex curvature.Proposed method makes it enable subdivision, which deploy characteristics of curvatures of original model and adjusting a degree of subdivision in whole model.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.42 no.5
• /
• pp.87-96
• /
• 2005

In this paper, a mesh simplification algorithm using face constriction is proposed which considers the conservation of the volume of a 3D model. The face constriction method replaces three vertices of the candidate triangle with a new vertex, removing four faces at once. We propose a modified method, compensating an existing method, of considering curvature in the decision of the removing order of triangles. We also propose a method of determining a new vertex replacing the candidate triangle, which reflects curvature difference of the three surrounding areas of the three vertices of the triangle, while conserving the volume. It is shown by simulation that the proposed method conserves the volume and shows good constriction performance comparable to the other methods.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.7 no.1
• /
• pp.39-51
• /
• 2004

This study aims to suggest new algorithm, named as Simoo, in order to improve spatial conflicts and vector displacement between linear features in generalization of the linear features. Main principles of Simoo algorithm is adoption of simplification and smoothening methods. Tolerance conditions used in Simoo are perpendicular length, external angle, and average vertex length. Main characteristics of Simoo are the application of scale, cartographic refinement, minimization of logical errors, and maintenance of geographical properties. The Simoo was applied through comparison to existing Douglas-Peucker algorithm. Resultantly, maintenance ratios of line such as coastal line and stream network were over 97% in both algorithms. The elimination ratio of vertex points may be more effective in Douglas-Peucker than in Simoo. Spatial conflicts between linear features may be more minimized in Simoo. The curvature and smoothening of lines become decreased in scale in application of Simoo. Finally, Simoo algorithm may be more effective than Douglas-Peucker for cartographic generalization.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.3
• /
• pp.702-707
• /
• 2004

This article is concerned with container pose estimation using CCD a camera and a range sensor. In particular, the issues of characteristic point extraction and image noise reduction are described. The Euler-Lagrange equation for gaussian and random noise reduction is introduced. The alternating direction implicit(ADI) method for solving Euler-Lagrange equation based on partial differential equation(PDE) is applied. The vertex points as characteristic points of a container and a spreader are founded using k order curvature calculation algorithm since the golden and the bisection section algorithm can't solve the local minimum and maximum problems. The proposed algorithm in image preprocess is effective in image denoise. Furthermore, this proposed system using a camera and a range sensor is very low price since the previous system can be used without reconstruction.