• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.38 no.3
• /
• pp.209-216
• /
• 1989

A method for extracting the elemental information for an efficient representation of the boundary of industrial parts, from the contours of the mechanical parts, is presented. We have analyzed the performance of the boundary representation using lines and circles. We have also analyzed and compared the performance of the proposed method with that of CW tracking-RL searching method. The result of the analysis has shown that the method suggested in this paper is twice faster than CW tracking-RL searching method. The same result could also be observed in experiments.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.32 no.1
• /
• pp.61-75
• /
• 2007

The purpose of this paper is to develop a new group classification method based on genetic algorithm and to com-pare its prediction performance with those of existing methods in the area of bond rating. To serve this purpose, we conduct various experiments with pilot and general models. Specifically, we first conduct experiments employing two pilot models : the one searching for the cluster center of each group and the other one searching for both the cluster center and the attribute weights in order to maximize classification accuracy. The results from the pilot experiments show that the performance of the latter in terms of classification accuracy ratio is higher than that of the former which provides the rationale of searching for both the cluster center of each group and the attribute weights to improve classification accuracy. With this lesson in mind, we design two generalized models employing genetic algorithm : the one is to maximize the classification accuracy and the other one is to minimize the total misclassification cost. We compare the performance of these two models with those of existing statistical and artificial intelligent models such as MDA, ANN, and Decision Tree, and conclude that the genetic algorithm-based group classification method that we propose in this paper significantly outperforms the other methods in respect of classification accuracy ratio as well as misclassification cost.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.10
• /
• pp.3538-3556
• /
• 2014

This paper proposes a novel video stitching method that improves real-time performance and visual quality of a multi-camera video surveillance system. A two-stage seam searching algorithm based on enhanced dynamic programming is proposed. It can obtain satisfactory result and achieve better real-time performance than traditional seam-searching methods. The experiments show that the computing time is reduced by 66.4% using the proposed algorithm compared with enhanced dynamic programming, while the seam-searching accuracy is maintained. A real-time local update scheme reduces the deformation effect caused by moving objects passing through the seam, and a seam-based local color transfer model is constructed and applied to achieve smooth transition in the overlapped area, and overcome the traditional pixel blending methods. The effectiveness of the proposed method is proved in the experiements.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.1
• /
• pp.115-121
• /
• 2010

As internet becomes widespread, a lot of information is opened to public and users of Internet can access effectively information using web searching service. To construct web searching service, the web searching method for collecting of information is needed to obtain web page view. As a number of web page view increases, it is necessary to collect information of high quality information to be searched, therefore, a variety of web engine for searching mechanism is developed. Method of link extraction with javascript in dynamic web page and design of web searching robot are presented m this paper. To evaluate performance analyzes, we fixed one searching model with the proposed method. The searching time takes 2 minute 67 sec for 299 web pages and 12.33 sec for 10 searching model.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.43 no.1
• /
• pp.42-49
• /
• 2020

This study is an empirical research to find out the effect on the management performance of hidden champions of food manufacturing companies when using blue ocean strategy for new product development. In order to achieve the purpose of this study, we conducted a questionnaire survey on hidden champions in the domestic food manufacturing industry and proceeded empirical analysis. When small and medium-sized enterprises in food manufacturing industries develop a new product, searching for non-customer, rebuilding the market boundary, and linking the external networks have a significant impact on their management performance. However, the fair procedure did not have a significant effect on the management performance. In terms of relative influence, rebuilding the market boundary was most affecting, followed by searching for non-customer and linking the external networks. On the other hand, this study implicated the management performance of hidden champions of food manufacturing industries when new products is developed by using the blue ocean strategy. Obtained results are as follows. If small and medium-sized enterprises of food manufacturing industries develop new products, it will be able to improve the management performance by utilizing strategies such as searching for non-customer, rebuilding the market boundary, and linking the external networks. In particular, the rebuilding the market boundary among the blue ocean strategies has a relatively high impact on management performance.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10a
• /
• pp.235-238
• /
• 1996

In this paper, a new optimization method which is a kind of random searching is presented. The proposed method is called RasVal which is an abbreviation of Random Search Method with Variable Seaxch Length and it can search for a global minimum based on the probability density functions of searching, which can be modified using informations on success or failure of the past searching in order to execute intensified and diversified searching. By applying the proposed method to a nonlinear crane control system which can be controlled by the Universal Learning Network with radial basis function(R.B.P.), it has been proved that RasVal is superior in performance to the commonly used back propagation learning algorithm.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.11 no.6
• /
• pp.5-13
• /
• 2008

A smart submunition drops through the expected trajectory to have a appropriate target searching footprint for the armored ground vehicles. Parachutes can be used as a tool to decelerate and spin the submunition. Usually submunition's descent velocity, spin rate, submunition inclination angle against vertical and dynamic stability affect to its target searching footprint. Therefore it is important to design optimal parachute and load configuration for the overall system performance. In this paper we described the dynamic motion of submunition by the mathematical model of parachute and load. Through the computer simulation we can analyze the submunition footprint affected by parachute and load design.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.31-34
• /
• 1999

In this paper, the improved initial cell searching algorithm is proposed for 3GPP W-CDMA system. The key objective of the proposed algorithm is to utilize the reliability of the first stage of cell searching algorithm in order to accomplish the second stage. So the proposed algorithm makes the mobile station transfers to the second stage from the first stage, just after the slot synchronization is declared successively at the same time-offset. In order to compare the proposed algorithm with the conventional one, the simulations are accomplished for cell search algorithm for 3GPP W-CDMA systems in the multipath Rayleigh fading channel. Some parameters are also presented for the better performance in the initial cell searching algorithm.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.117-121
• /
• 2005

In this work, we first present our study on the decoding schemes for space-time block code as well as our comments on their complexity. Then, we propose a new modified complex sphere decoding scheme, which has lower computational load than that of conventional complex sphere decoders. In the proposed scheme, the boundary for searching is defined by the intersection of an approximate polygon of searching circle and disk of lattice constellation. Therefore, the proposed scheme can reduce the searching boundary and it can avoid missing searching points as well. The performance of the proposed scheme, which is verified by computer simulations, consolidates our scheme.

• Journal of information and communication convergence engineering
• /
• v.3 no.2
• /
• pp.72-75
• /
• 2005

In this work, we first present our study on the decoding schemes for space-time block code as well as our comments on their complexity. Then, we propose a new modified complex sphere decoding scheme, which has lower computational load than that of conventional complex sphere decoders. In the proposed scheme, the boundary for searching is aided with the intersection of approximate polygon of searching circle and disk of constellation. Therefore, the proposed scheme can reduce the searching boundary while can avoid missing searching points. The performance of the proposed scheme is verified by computer simulation that consolidates our scheme.