• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.33 no.4
• /
• pp.231-244
• /
• 2015

The accuracy of reference point of VLBI antenna is mandatory to perform collocation of different space geodetic techniques. In this study, we evaluated the optimal methods for the 3D circle fitting to enhance the accuracy of the reference point of VLBI antenna. Two kinds of methodologies for the orthonormal coordinate system with translation of planar observation point and the unitary coordinate transforamation were suggested and their fitting accuracies were evaluated where the orthogonal distance was calculated by residual between observation point and fitting model and the recursive calculation was performed to improve the accuracy of 3D circle fitting. Finally, we found that the methodology for the unitary coordinate transformation is highly appropriate to determine the optimal equation for azimuth-axis and elevation-axis of VLBI antenna. Therefore, the reference point of VLBI antenna with high accuracy can be determined by the intersection of the above two axises (azimuth-axis and elevation-axis). This result is expected to be utilized for a variety of researches for connection between VLBI observation results and the national control point.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.410-413
• /
• 2009

Wafer pre-alignment is to find the center and the orientation of a wafer and to move the wafer to the desired position and orientation. In this paper, an area camera based pre-aligning method is presented that captures 8 wafer images regularly during 360 degrees rotation. From the images, wafer edge positions are extracted and used to estimate the wafer's center and orientation using least square circle fitting. These information are utilized for the proper alignment of the wafer.

• Journal of applied mathematics & informatics
• /
• v.7 no.3
• /
• pp.983-994
• /
• 2000

We consider the problem of determining the circle of best fit to a set of data points in the plane. In [1] and [2] several algorithms already have been given for fitting a circle in least squares sense of minimizing the geometric distances to the given data points. In this paper we present another new descent algorithm which computes a parametric represented circle in order to minimize the sum of the squares of the distances to the given points. For any choice of starting values our algorithm has the advantage of ensuring convergence to a local minimum. Numerical examples are given.

• Communications of the Korean Mathematical Society
• /
• v.34 no.3
• /
• pp.1029-1047
• /
• 2019

We are interested in the problem of determining the best fitted circle to a set of data points in space. This can be usually obtained by minimizing the geometric distances or various approximate algebraic distances from the fitted circle to the given data points. In this paper, we propose an algorithm in such a way that the sum of the squares of the geometric distances is minimized in ${\mathbb{R}}^3$. Our algorithm is mainly based on the steepest descent method with a view of ensuring the convergence of the corresponding objective function Q(u) to a local minimum. Numerical examples are given.

• Journal of IKEEE
• /
• v.26 no.1
• /
• pp.104-110
• /
• 2022

In this paper, we propose a new dataset for AI diagnosis and BLDC motor diagnosis in UAV. In the diagnosis of BLDC motor, PVA(Park's Vector Approach) is difficult to apply due to many ripples of frequency components. However, since the components of ripples are the third harmonics, we propose a method to utilize PVA as circle fitting by applying Savitzky-Golay filter which is excellent for the third harmonics. On the other hand, PVA, a technique to convert from three-phase to two-phase, is always based on the origin during the transformation process. This study demonstrates that the error of the origin and the measured center can be detected and diagnosed in the application process of Circle fitting, and that it can be used as a new data set of AI technology.

• Transactions of the Korean Society of Machine Tool Engineers
• /
• v.12 no.4
• /
• pp.17-22
• /
• 2003

This paper presents a new circular curve fitting approach of articulated manipulators, based on least square. The approach aims at gaining the interpolation of circle from n data points, under the condition that the fitted circle should pass both a starting point and an ending point. First a spherical fitting should be performed, using least squares. Then the circular curve fitting can be resulted from the intersection of the fitted sphere and the plane obtained from 3 points, i. e., a starting point, an ending point and the center of a sphere. The proposed algorithms are shown to be efficient by using MATLAB-based simulation.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.13 no.5
• /
• pp.334-340
• /
• 2003

Exponential window function Is widely used In impact hammer testing to reduce leakage error as well as to get a good S/N ratio. The larger its decaying rate is, the more effectively the leakage errors are reduced. But if the decay rate of the exponential window is too large, the FRF is distorted. And the modal parameters of the system can not be exactly identified by modal analysis technique. Therefore, it is a difficult problem to determine proper decay rate in impact hammer testing. In this paper, amount of the FRF distortion caused by exponential window is theoretically uncovered. A new circle fitting method is also proposed so that the modal parameters are directly extracted from impulse response spectrum distorted by the exponential-windowed impulse response data. The results by the conventional and proposed circle fitting method are compared through a numerical example.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2002.10a
• /
• pp.570-575
• /
• 2002

This paper presents a new circular curve fitting approach of articulated manipulators, based on pseudoinverses. The paper aims at gaining the interpolation of circle from n data points, under the condition that the fitted circle should pass both a start point and an end point. In this paper, two algorithms of circular interpolation are presented. Prior to circular interpolation, are a spherical fitting should be performed, using least squares. In the first algorithm, the relationship between point data and normal vector on the sphere is used. In the second algorithm. the equation of plane which can be obtained from 3 points, i.e., a start point, an end point, and center of a sphere. The proposed algorithms are show to be efficient by using MATLAB-based simulation.

• 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.

• Journal of the Semiconductor & Display Technology
• /
• v.9 no.1
• /
• pp.11-16
• /
• 2010

Wafer Pre-Alignment is to find the center and the orientation of a wafer and to move the wafer to the desired position and orientation. In this paper, an area camera based pre-aligning method is presented that captures 8 wafer images regularly during 360 degrees rotation. From the images, wafer edge positions are extracted and used to estimate the wafer's center and orientation using least squares circle fitting. These data are utilized for the proper alignment of the wafer. For accurate alignments, camera calibration methods using high order polynomials are used for converting pixel coordinates into real-world coordinates. A complete pre-alignment system was constructed using mechanical and optical components and tested. Experimental results show that alignment of wafer center and orientation can be done with the standard deviation of 0.002 mm and 0.028 degree, respectively.