• Journal of the Korean Society for Precision Engineering
• /
• v.14 no.11
• /
• pp.77-83
• /
• 1997

This work is concerned with the algorithm of generating a new circular are interpolation. This research presents a new biarc curve fitting that is a circular interpolation method based on a triarc curve fitting. The triarc method, where a segment span is composed of three circular arcs, using maximum error estimation has the advantage of generating arc splines easily to a given tolerance. The new biarc method is called when the adjacent radii are the same in the same in the triarc method. In generating the machining data for various cam curves in CNC machining with the biarc method and the new biarc method, the latter accomp- lished faster NC-code generation, shorter NC-code block formation and machined the same cam profile more efficiently.

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

• Journal of Korea Multimedia Society
• /
• v.13 no.7
• /
• pp.1000-1015
• /
• 2010

In this paper, we propose a novel algorithm for hand gesture recognition. The hand detection method is based on human skin color, and we use the boundary energy information to locate the hand region accurately, then the moment method will be employed to locate the hand palm center. Hand gesture recognition can be separated into 2 step: firstly, the hand posture recognition: we employ the parallel NNs to deal with problem of hand posture recognition, pattern of a hand posture can be extracted by utilize the fitting ellipses method, which separates the detected hand region by 12 ellipses and calculates the white pixels rate in ellipse line. the pattern will be input to the NNs with 12 input nodes, the NNs contains 4 output nodes, each output node out a value within 0~1, the posture is then represented by composed of the 4 output codes. Secondly, the hand gesture tracking and recognition: we employed the Kalman filter to predict the position information of gesture to create the position sequence, distance relationship between positions will be used to confirm the gesture. The simulation have been performed on Windows XP to evaluate the efficiency of the algorithm, for recognizing the hand posture, we used 300 training images to train the recognizing machine and used 200 images to test the machine, the correct number is up to 194. And for testing the hand tracking recognition part, we make 1200 times gesture (each gesture 400 times), the total correct number is 1002 times. These results shows that the proposed gesture recognition algorithm can achieve an endurable job for detecting the hand and its' gesture.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.3
• /
• pp.80-90
• /
• 1994

In this paper, a high-resolution algorithm for detecting the orientation and position of the SMD and an algorithm for compensating the position and skew angle of the PCB are proposed. The proposed algorithm for the first topic consists of two parts. Its first part is a preprocessing step. in which corner points of the SMD are detected and they are grouped. Then the coarse angle of the principal axis is obtained by line fitting. The second part is a main processing step, in which the fuzzy Hough transform over the limited range of angles is applied to the corner points to detect precisely the orientation of the SMD. The position of the SMD is determined by using its four corner points. The proposed algorithm for the second topic is the one which detects a rotation angle and translation parameters of the PCB using a template matching method. The computer simulation shows that the parametes obtained by proposed algorithms are more precise than those by the several conventional methods considered. The proposed algorithms can be applied to the fast and accurate automatic inspection systems.

• Korean Journal of Optics and Photonics
• /
• v.9 no.4
• /
• pp.245-250
• /
• 1998

A new computational algorithm is presented for the peak point detection of white light interferograms. Assuming the visibility function of white light interferograms as a quadratic polynomial, the peak point is searched so as to minimize the error sum between the measured intensity data and the analytical intensity. As compared with other existing algorithms, this new algorithm requires less computation since the peak point is simply determined with a single step matrix multiplication. In addition, a good robustness is obtained against external random disturbances on measured intensities since the algorithm is based upon least squares principles.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.19 no.4
• /
• pp.1-5
• /
• 1982

A new algorithm, based upon a lattice formulation, is presented for linear prediction. The output of the algorithm is the reflection coefficients that guarantee the stability of the all-pole model. The equations are derived that compute the covariance of the residuals recursively at each prediction stage, and in processing of computing that eqations, the reflection coefficients are estimated without computing the predictor coefficients. Comparing with covariance-lattice method, it can be said that the new algorithm reduce the number of computations to about half and is more efficient for fitting of the high-order model.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.27 no.1
• /
• pp.37-55
• /
• 2023

In this paper we propose a new algorithm for detecting and counting flowers in a complex background based on digital images. The algorithm mainly includes the following parts: edge contour extraction of flowers, edge contour determination of overlapped flowers and flower counting. We use a contour detection technique in Computer Vision (CV) to extract the edge contours of flowers and propose an improved algorithm with a concave point detection technique to find accurate segmentation for overlapped flowers. In this process, we first use the polygon approximation to smooth edge contours and then adopt the second-order central moments to fit ellipse contours to determine whether edge contours overlap. To obtain accurate segmentation points, we calculate the curvature of each pixel point on the edge contours with an improved Curvature Scale Space (CSS) corner detector. Finally, we successively give three adaptive judgment criteria to detect and count flowers accurately and automatically. Both experimental results and the proposed evaluation indicators reveal that the proposed algorithm is more efficient for flower counting.

• The Journal of the Korea Contents Association
• /
• v.2 no.3
• /
• pp.1-15
• /
• 2002

A noel automated brain region extraction method in single channel MR images for visualization and analysis of a human brain is presented. The method generates a volume of brain masks by automatic thresholding using a dual curve fitting technique and by 3D morphological operations. The dual curve fitting can reduce an error in clue fitting to the histogram of MR images. The 3D morphological operations, including erosion, labeling of connected-components, max-feature operation, and dilation, are applied to the cubic volume of masks reconstructed from the thresholded Drain masks. This method can automatically extract a brain region in any displayed type of sequences, including extreme slices, of SPGR, T1-, T2-, and PD-weighted MR image data sets which are not required to contain the entire brain. In the experiments, the algorithm was applied to 20 sets of MR images and showed over 0.97 of similarity index in comparison with manual drawing.

• The KIPS Transactions:PartB
• /
• v.13B no.5 s.108
• /
• pp.525-532
• /
• 2006

This paper proposes a new class of image restoration on the Ising modeled binary 'Takbon' image by the flexible line-fitting ICM(Iterated conditional modes) method. Basically 'Takbon' image need be divided into two extreme regions, information and background one due to its stroke combinations. The main idea is the line process, comparing with the conventional ICM approaches which were based on partially rectangular structured point process. For calculating geometrical mechanism, we have defined line-fitting functions at each current pixel array which form the set of linear lines with gradients and lengths. By applying the Bayes' decision to this set, the region of the current pixel is decided as one of the binary levels. In this case, their statistical reiteration for distinct tracking between intra and extra region offers a criterion to decide the attachment at each step. Finally simulations using the binary 'Takbon' image are provided to demonstrate the effectiveness of our new algorithm

• Journal of Radiation Protection and Research
• /
• v.45 no.4
• /
• pp.171-177
• /
• 2020

Background: This study aims to determine the effective atomic number (Zeff) from dual-energy image sets obtained using a conventional computed tomography (CT) simulator. The estimated Zeff can be used for deriving the stopping power and material decomposition of CT images, thereby improving dose calculations in radiation therapy. Materials and Methods: An electron-density phantom was scanned using Philips Brilliance CT Big Bore at 80 and 140 kVp. The estimated Zeff values were compared with those obtained using the calibration phantom by applying the Rutherford, Schneider, and Joshi methods. The fitting parameters were optimized using the nonlinear least squares regression algorithm. The fitting curve and mass attenuation data were obtained from the National Institute of Standards and Technology. The fitting parameters obtained from stopping power and material decomposition of CT images, were validated by estimating the residual errors between the reference and calculated Zeff values. Next, the calculation accuracy of Zeff was evaluated by comparing the calculated values with the reference Zeff values of insert plugs. The exposure levels of patients under additional CT scanning at 80, 120, and 140 kVp were evaluated by measuring the weighted CT dose index (CTDIw). Results and Discussion: The residual errors of the fitting parameters were lower than 2%. The best and worst Zeff values were obtained using the Schneider and Joshi methods, respectively. The maximum differences between the reference and calculated values were 11.3% (for lung during inhalation), 4.7% (for adipose tissue), and 9.8% (for lung during inhalation) when applying the Rutherford, Schneider, and Joshi methods, respectively. Under dual-energy scanning (80 and 140 kVp), the patient exposure level was approximately twice that in general single-energy scanning (120 kVp). Conclusion: Zeff was calculated from two image sets scanned by conventional single-energy CT simulator. The results obtained using three different methods were compared. The Zeff calculation based on single-energy exhibited appropriate feasibility.