• Journal of the Korean Institute of Telematics and Electronics T
• /
• v.36T no.4
• /
• pp.1-8
• /
• 1999

This paper presents a new algorithm for surface segmentation and feature description. In the first stage of proposed algorithm, the signature of an edge image of object is extracted. The signature technique represents a surface using the distance from the mass center to the boundary of the image as a function of angle rotating counterclockwise. If there exists a range in the angle axis where more than two signatures form a closed curve, we can conclude there is a surface inside the range. Using this feature of the signature, surface can be segmented. The surface features such as number of vertices, number of edges, convex and type of surface can also be extracted from segmented surfaces. This algorithm has distinguished advantages; it can easily recover the lost part in the edge image using the curve fitting method; it extracts surface features correctly regardless of the rotation of the surface in 3-D space.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.12
• /
• pp.90-97
• /
• 1997

This paper presents a new algorithm for surface segmentation and feature description. The algorithm extracts the signature of an edge image based on the signature technqique[12] in the first stage. If there exists a range in the angle axis where more than two signatures form a closed curve, we can conclude there is a surface inside the range. Using this feature of the signature, surfaces can be segmented. The surface features such as number of vertices, number of edges, and type of surfaces can also be extracted by finding the signatures of individual surfaces. This algorithm has distinguished advantages: it can easily recover the lost part occuring in the edge iage using the curve fitting method and it can extract surface features even when surfaces are rotated in 3-D space.

• Investigative Magnetic Resonance Imaging
• /
• v.11 no.2
• /
• pp.103-109
• /
• 2007

To develop an advanced non-linear curve fitting (NLCF) algorithm for performing dynamic susceptibility contrast study of the brain. The first pass effects give rise to spuriously high estimates of $K^{trans}$ for the voxels that represent the large vascular components. An explicit threshold value was used to reject voxels. The blood perfusion and volume estimation were accurately evaluated in the $T2^*$-weighted dynamic contrast enhanced (DCE)-MR images. From each of the recalculated parameters, a perfusion weighted image was outlined by using the modified non-linear curve fitting algorithm. The present study demonstrated an improvement of an estimation of the kinetic parameters from the DCE $T2^*$-weighted magnetic resonance imaging data with using contrast agents.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.7
• /
• pp.26-32
• /
• 1994

The Lloyd-Max algorithm is an iterative scheme for design of the minimum mean square error quantizer. It is very simple in concept and easy to program into a computer. However its convergence and accuracy are primarily dependent upon the accuracy of the initial parameter. In this paper, a new initial parameter which converges to a specific value when the number of output levels becomes large is selected. And an estimator using curve fitting techique is suggested. In addition, performance of the proposed method is shown to be superior to that of the existing methods in accuracy and convergence.

• International conference on construction engineering and project management
• /
• 2015.10a
• /
• pp.680-681
• /
• 2015

This study develops an algorithm that automatically performs reverse engineering on three-dimensional (3D) sweeping shapes using a user's pre-defined feature templates and 3D point cloud data (PCD) of sweeping shapes. Existing methods extract 3D sweeping shapes by extracting points on a PCD cross section together with the center point in order to perform curve fitting and connect the center points. However, a drawback of existing methods is the difficulty of creating a 3D sweeping shape in which the user's preferred feature center points and parameters are applied. This study extracts shape features from cross-sectional points extracted automatically from the PCD and compared with pre-defined feature templates for similarities, thereby acquiring the most similar template cross-section. Fitting the most similar template cross-section to sweeping shape modeling makes the reverse engineering process automatic.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2001.04a
• /
• pp.975-978
• /
• 2001

For machining auto-mobile cam, the developed biarcs-fitting method eliminates the ridge problems in conventional straight-line fitting approximation or single-arc fitting of curve tool path where it leaves ridges of tool marks on the machined surface of the workpiece. The powerful advantage of this biarc method is demonstrated by applying it to the numerically controlled machining of a curved cam profile, also verified by using a CNC simulating program for auto-mobile cam profile. As a result, this algorithm may be used in CNC milling and turning for cam profile machining with short block line.

• Journal of Power System Engineering
• /
• v.5 no.2
• /
• pp.43-49
• /
• 2001

For machining auto-mobile cam, the developed biarcs-fitting method eliminates the ridge problems in conventional straight-line fitting approximation or single-arc fitting of curve tool path where it leaves ridges of tool marks on the machined surface of the workpiece. The powerful advantage of this biarc method is demonstrated by applying it to the numerically controlled machining of a curved cam profile, also verified by using a CNC simulating program for auto-mobile cam profile. As a result, this algorithm may be used in CNC milling and turning for cam profile machining with short block line.

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

• International Journal of CAD/CAM
• /
• v.12 no.1
• /
• pp.9-19
• /
• 2012

Generation of optimum planar B-spline curve in terms of minimum deviation and required fairness to approximate a target shape defined by a strip-shaped unorganized 2D point cloud is studied. It is proposed to use the location of control points as variables within the geometric optimization framework of point distance minimization. An adaptive simulated annealing heuristic optimization algorithm is developed to iteratively update an initial approximate curve towards the target shape. The new implementation comprises an adaptive cooling procedure in which the temperature change is adaptively dependent on the objective function evolution. It is shown that the proposed method results in an improved convergence speed when compared to the standard simulated annealing method. A couple of examples are included to show the applicability of the proposed method in the surface model reconstruction directly from point cloud data.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.2
• /
• pp.865-871
• /
• 2011

Presently, the location and direction information are certainly needed for the autonomous vehicle of the ship. Among them, the direction information is a essential elements to automatic steering system. And the gyro-compass, the magnetic-compass and the GPS compass are the sensor indicating the direction. The gyro-compasses are mainly used in the large-sized ship of the GMDSS(Global Maritime Distress & Safety System). The precision and the reliability of the gyro-compasses are excellent but big volume and high price are disadvantage. The magnetic-compass has relatively fine precision and inexpensive price. However, the disadvantage is in the influence by the magnetism object including the steel structure of a ship, and etc. In the case of the GPS compass, the true north is indicated according to the change of the location information but in case of the minimum number of satellites or stopping of a ship or exercise in the error range, the exact direction cannot be obtained. In this paper, the performance of the GPS compass was improved by using the least-square curve fitting method for the mutual trade off of the angle sensor. The algorithm which improves the precision of an azimuth by applying the weighted value according to the size of covariance error was proposed with GPS-compass and magnetic compass. The characteristic and the performance of the proposed algorithm were analyzed and verified through experimentation. The applicability of the proposed algorithm was shown through the experimental result.