• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10b
• /
• pp.181-186
• /
• 1992

Many real-world problems are concerned with estimation rather than classification. This paper presents an adaptive technique to estimate the mechanical properties of materials from acoustoultrasonic waveforms. This is done by adapting a piece-wise linear approximation technique to a multi-layered neural network architecture. The piece-wise linear approximation network (PWLAN) finds a set of connected hyperplanes that fit all input vectors as close as possible. A corresponding architecture requires only one hidden layer to estimate any curve as an output pattern. A learning rule for PWLAN is developed and applied to the acousto-ultrasonic data. The efficiency of the PWLAN is compared with that of classical backpropagation network which uses generalized delta rule as a learning algorithm.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.4
• /
• pp.115-122
• /
• 1994

Roberige had proposed a method of linear approximation using strips. This method is known to be fast relatively, and the distance between the given curve and calculated straight line is not greater than an allowable error. But this method generates many break points. Later, Leng and Yang proposed the dynamic strip algorithm with the rotation of strips which reduced the number of greak points at the sacrifice of the speed. The method using the seperate rotation of two strip lines proposed in this paper is faster than Leng and Yang's but generates almost the same number of break points as Leng and Yang's.

• Journal of Korean Institute of Industrial Engineers
• /
• v.7 no.1
• /
• pp.5-11
• /
• 1981

In the case of numerical implementation, the exact solution method for the M/M/s system where customers demand multiple server use [2] reveals limitations, if a system has large number of servers or types of customers. This is due to the huge matrices involved in the course of the calculations. This paper offers an approximation scheme for such cases. Capitalizing the characteristics of the service rate curve of the system, this method approximates the service rate as a piecewise linear function. With the service rates obtained from the linear function for each number of customers n (n=0. 1. 2,$\cdots$), ${\mu}(n)$, steady-state probabilities and measures of performance are found treating this system as an ordinary M/M/s system. This scheme performs well when the traffic intensity of a system is below about 0.8. Some numerical examples are presented.

• Journal of applied mathematics & informatics
• /
• v.27 no.5_6
• /
• pp.1061-1071
• /
• 2009

For real generalized reflexive matrices R, S, i.e., $R^T$ = R, $R^2$ = I, $S^T$ = S, $S^2$ = I, we say that real matrix X is (R,S)-symmetric, if RXS = X. In this paper, an iterative algorithm is proposed to solve the least-squares problem of matrix equation AXB = C with (R,S)-symmetric X. Furthermore, the optimal approximation solution to given matrix $X_0$ is also derived by this iterative algorithm. Finally, given numerical example and its convergent curve show that this method is feasible and efficient.

• Structural Engineering and Mechanics
• /
• v.3 no.3
• /
• pp.201-213
• /
• 1995

At present Level 2 and importance sampling methods are the main tools used to estimate reliability of structural systems. But sometimes application of these techniques to realistic problems involves certain difficulties. In order to overcome the difficulties it is suggested to use Monte Carlo simulation in combination with two other techniques-extreme value and tail entropy approximations; an appropriate Pearson's curve is fit to represent simulation results. On the basis of this approach an algorithm and computer program for structural reliability estimation are developed. A number of specially chosen numerical examples are considered with the aim of checking the accuracy of the approach and comparing it with the Level 2 and importance sampling methods. The field of application of the approach is revealed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.10A
• /
• pp.1021-1028
• /
• 2002

This paper proposes a method to extract the content curve that reflects changes in video content from the MPEG video in the compressed domain, and also describes a video summary generation technique which can read video effectively and rapidly from the content curve. Existing video summary techniques have a disadvantage of taking significant amount of time to generate the video summary due to complex calculations in the decoding process. Moreover, the existing techniques, which use video content curve, require to perform many calculations to process the high dimensional content curve. However, the proposed technique generates video summary fast via the linear approximation of the proposed curve, after extraction the two dimensional content curve directly. In addition, the proposed technique has a merit that the user can set any number of key-frames and amount of calculation that form the video summary.

• Journal of Korean Association for Spatial Structures
• /
• v.12 no.1
• /
• pp.109-119
• /
• 2012

For membrane structure, there are three main steps in design and construction, which are form finding, statistical load analysis, and cutting patterning. Unlike the first two stages, the step of cutting pattern involves the translation of a double-curved surface in 3D space into a 2D plane with minimal error. For economic reasons, the seam lines of generated cutting patterns rely greatly on the geodesic line. Generally, as searching regions of the seam line are plane elements in the step of shape analysis, the seam line is not a smooth curve, but an irregularly divided straight line. So, it is how we make an irregularly divided straight line a smooth curve that defines the quality of the pattern. Accordingly, in this paper, we analyzed interpolation schemes using spline, and apply these methods to cutting pattern generation on the curved surface. To generate the pattern, three types of spline functions were used, i.e., cubic spline function, B-spline, and least-square spline approximation, and simple model and the catenary-shaped membrane was adopted to examine the result of generation. The result of comparing the approximation curves by the number of elements and the number of extracted nodes of simple model revealed that the seam line for less number of extracted nodes with large number of elements were more efficient, and the least-square spline approximation provided smoother seam line than other methods.

• Journal of applied mathematics & informatics
• /
• v.2 no.2
• /
• pp.75-82
• /
• 1995

4대의 제어점에 의해 정의되는 3차 Bezier 곡선을 구간적 (piecewise) 2차 Bezier 곡선으로 근사 하는 기하적인 알고리듬을 제시한다. 또한 제시한알고리듬의 오차해석을 통하여 수정된 알 고리듬을 구성한다. 분확방법을 동시에 사용하여 주어진 허용오차 이내의 구간적 2차 근사 곡선을 구할수 있다. 제시한 알고리듬은 오차해석을 이용하여 필요한 분활의 수행회수를 미 리 결정할수있는장점을 가지고있다.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.691-694
• /
• 1999

This paper presents a performance improvement technique of 2-D towed array shape estimation using Kalman filters. The proposed algorithm by linear model approximation corrects the position errors caused by the Kalman filter results. However, since the assumed linear model makes errors at bending parts, the spline interpolation algorithm based on curve is proposed to reduce the errors.

• Journal of the Korea Computer Graphics Society
• /
• v.25 no.3
• /
• pp.93-103
• /
• 2019

We introduce a geometric processing method for freeform surfaces based on high-precision torus patch approximation, a new spatial data structure for efficient geometric operations on freeform surfaces. A torus patch fits the freeform surface with flexibility: it can handle not only positive and negative curvature but also a zero curvature. It is possible to precisely approximate the surface regardless of the convexity/concavity of the surface. Unlike the traditional method, a torus patch easily bounds the surface normal, and the offset of the torus becomes a torus again, thus helps the acceleration of various geometric operations. We have shown that the torus patch's approximation accuracy of the freeform surface is high by measuring the upper bound of the two-sided Hausdorff distance between the freeform surface and set of torus patches. Using the method, it can be easily processed to detect an intersection curve between two freeform surfaces and find the offset surface of the freeform surface.