• Nuclear Engineering and Technology
• /
• v.52 no.1
• /
• pp.101-108
• /
• 2020

In order to solve the contradiction between requirements of high sampling rate for acquiring accurate energy information of pulses and large amount of data to be processed timely, the method with an algorithm to correct errors caused by reducing the sampling rate is normally used in front-end read-out system, which is conductive to extract accurate energy information from digitized waveform of pulse. The functions and effects of algorithms, which mainly include polynomial fitting with different fitting times, double exponential function fitting under different sampling modes, and integral area algorithm, are analyzed and evaluated, and some meaningful results is presented in this paper. The algorithm described in the paper has been used preliminarily in a prototype system of Positron Emission Tomography (PET) for heavy-ion cancer therapy facility.

• Communications for Statistical Applications and Methods
• /
• v.2 no.1
• /
• pp.48-54
• /
• 1995

A direct method for fitting analysis-of-variance models to unbalanced data is presented. This method exploits sparsity and rank deficiency of the matrix and is based on Gram-Schmidt orthogonalization of a set of sparse columns of the model matrix. The computational algorithm of the sum of squares for testing estmable hyphotheses is given.

• Journal of Computational Design and Engineering
• /
• v.2 no.4
• /
• pp.218-232
• /
• 2015

Piecewise linear (G01-based) tool paths generated by CAM systems lack $G_1$ and $G_2$ continuity. The discontinuity causes vibration and unnecessary hesitation during machining. To ensure efficient high-speed machining, a method to improve the continuity of the tool paths is required, such as B-spline fitting that approximates G01 paths with B-spline curves. Conventional B-spline fitting approaches cannot be directly used for tool path B-spline fitting, because they have shortages such as numerical instability, lack of chord error constraint, and lack of assurance of a usable result. Progressive and Iterative Approximation for Least Squares (LSPIA) is an efficient method for data fitting that solves the numerical instability problem. However, it does not consider chord errors and needs more work to ensure ironclad results for commercial applications. In this paper, we use LSPIA method incorporating Energy term (ELSPIA) to avoid the numerical instability, and lower chord errors by using stretching energy term. We implement several algorithm improvements, including (1) an improved technique for initial control point determination over Dominant Point Method, (2) an algorithm that updates foot point parameters as needed, (3) analysis of the degrees of freedom of control points to insert new control points only when needed, (4) chord error refinement using a similar ELSPIA method with the above enhancements. The proposed approach can generate a shape-preserving B-spline curve. Experiments with data analysis and machining tests are presented for verification of quality and efficiency. Comparisons with other known solutions are included to evaluate the worthiness of the proposed solution.

• The Bulletin of The Korean Astronomical Society
• /
• v.40 no.2
• /
• pp.40.1-40.1
• /
• 2015

Off-axis reflective optical systems have attractive advantages relative to their on-axis or refractive counterparts, for example, zero chromatic aberration, no obstruction, and a wide field of view. For the efficient operation of off-axis reflective system, the surface accuracy of freeform mirrors should be higher than the order of wavelengths at which the reflective optical systems operate. Especially for applications in shorter wavelength regions, such as visible and ultraviolet, higher surface accuracy of freeform mirrors is required to minimize the light scattering. In this work, we propose the error compensation algorithm (ECA) for the correction of wavefront errors on freeform mirrors. The ECA converts a form error pattern into polynomial expression by fitting a least square method. The error pattern is measured by using an ultra-high accurate 3-D profilometer (UA3P, Panasonic Corp.). The measured data are fitted by two fitting models: Sag (Delta Z) data model and form (Z) data model. To evaluate fitting accuracy of these models, we compared the fitted error patterns with the measured error pattern.

• Journal of Power System Engineering
• /
• v.18 no.1
• /
• pp.22-31
• /
• 2014

This paper introduced the new calibration algorithm of a straight-type five-hole pressure probe necessary for calculating three-dimensional flow velocity components. The new velocity data reduction method using both a commercial two-dimensional curve-fitting program and the zone partition method of a calibration map was firstly introduced in this study. This new calibration method can be applied up to the wide flow angle of ${\pm}80^{\circ}$ despite of using a five-hole pressure probe because this data reduction method showed a comparatively good performance in calculating yaw and pitch angles from the calibration map.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.29 no.4D
• /
• pp.555-561
• /
• 2009

In lieu of section profile data, a fitting of the bored tunnel shape is more significant confirmation for maintenance of a tunnel. Before the permit on the completion of a tunnel, deformation of the completed tunnel with respect to the design model are considered. And deformation can be produced at continuously along the entire of the tunnel section. This study firstly includes an analysis of algebraic approach and test it with an observed field data. And then a number of methods, line search method, genetic algorithm, and pattern search methods, are compared with the 3D tunnel shape fitting. Algebraic methods can solve a simple circular cylinder type as like a railway tunnel. However, a more complex model (compound circular curve and non circular) as like a highway tunnel has to be solved with soft computing tools in the cause of conditional constraints. The genetic algorithm and pattern search methods are computationally more intensive, but they are more flexible at a complex condition. The line search method is fastest, but it needs a narrow bounds of the initial values.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.835-836
• /
• 2006

For non-contact structure vibration displacement measurement system, an algorithm for image processing using high speed CCD camera is introduced. The system sets the target to the structure, take picture using camera and image processing is performed to display the vibration data. The algorithm flow is basic preprocessing, projection data generation and curve fitting to find three crossing points for calibration or one center point in limited area.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.18 no.3
• /
• pp.117-124
• /
• 2023

In the machine vision inspection equipment, diameter measurement is important process in inspection of cylindrical object. However, machine vision inspection equipment requires complex algorithm processing such as camera distortion correction and perspective distortion correction, and the increase in processing time and cost required for precise diameter measurement. In this paper, we proposed the algorithm for diameter measurement of cylindrical object using the laser displacement sensor. In order to fit circle for given four input outer points, grid search algorithms using root-mean-square error and mean-absolute error are applied and compared. To solve the limitations of the grid search algorithm, we finally apply the singular-value-decomposition based circle fitting algorithm. In order to compare the performance of the algorithms, we generated the pseudo data of the outer points of the cylindrical object and applied each algorithm. As a result of the experiment, the grid search using root-mean-square error confirmed stable measurement results, but it was confirmed that real-time processing was difficult as the execution time was 10.8059 second. The execution time of mean-absolute error algorithm was greatly improved as 0.3639 second, but there was no weight according to the distance, so the result of algorithm is abnormal. On the other hand, the singular-value-decomposition method was not affected by the grid and could not only obtain precise detection results, but also confirmed a very good execution time of 0.6 millisecond.

• Communications for Statistical Applications and Methods
• /
• v.24 no.4
• /
• pp.383-396
• /
• 2017

The model in our approach assumes that computer responses are a realization of a Gaussian processes superimposed on a regression model called a Gaussian process regression model (GPRM). Selecting a subset of variables or building a good reduced model in classical regression is an important process to identify variables influential to responses and for further analysis such as prediction or classification. One reason to select some variables in the prediction aspect is to prevent the over-fitting or under-fitting to data. The same reasoning and approach can be applicable to GPRM. However, only a few works on the variable selection in GPRM were done. In this paper, we propose a new algorithm to build a good prediction model among some GPRMs. It is a post-work of the algorithm that includes the Welch method suggested by previous researchers. The proposed algorithms select some non-zero regression coefficients (${\beta}^{\prime}s$) using forward and backward methods along with the Lasso guided approach. During this process, the fixed were covariance parameters (${\theta}^{\prime}s$) that were pre-selected by the Welch algorithm. We illustrated the superiority of our proposed models over the Welch method and non-selection models using four test functions and one real data example. Future extensions are also discussed.

• Communications for Statistical Applications and Methods
• /
• v.14 no.1
• /
• pp.205-213
• /
• 2007

In this paper, the normal mixture model subjected to general linear restriction for component-means based on linear regression is proposed, and its fitting method by EM algorithm and Lagrange multiplier is provided. This model is applied to gene clustering of microarray expression data, which demonstrates it has very good performances for real data set. This model also allows to obtain the clusters that an analyst wants to find out in the fashion that the hypothesis for component-means is represented by the design matrices and the linear restriction matrices.