• Journal of Institute of Control, Robotics and Systems
• /
• v.16 no.4
• /
• pp.339-345
• /
• 2010

This paper introduces GP(Genetic Programming) based robust corner detectors for scaled and rotated images. Various empirical algorithms have been studied to improve computational speed and accuracy including approaches, such as the Harris and SUSAN, FAST corner detectors. These techniques are highly efficient for well-defined corners, but are limited to corner-like edges which are often generated in rotated images. It is very difficult to detect correctly edges which have characteristics similar to corners. In this paper, we have focused the above challenging problem and proposed Genetic Programming-based automated generation of corner detectors which is robust to scaled and rotated images. The proposed method is compared to the existing corner detectors on test images and shows superior results.

• Journal of Electrical Engineering and Technology
• /
• v.7 no.2
• /
• pp.151-156
• /
• 2012

The current study presents a zero-one integer programming approach to determine the minimum break point set for the coordination of directional relays. First, the network is reduced if there are any parallel lines or three-end nodes. Second, all the directed loops are enumerated to reduce the iteration. Finally, the problem is formulated as a set-covering problem, and the break point set is determined using the zero-one integer programming technique. Arbitrary starting relay locations and the arbitrary consideration of relay sequence to set and coordinate relays result in navigating the loops many times and futile attempts to achieve system-wide relay coordination. These algorithms are compared with the existing methods, and the results are presented. The problem is formulated as a setcovering problem solved by the zero-one integer programming approach using LINGO 12, an optimization modeling software.

• Journal of computational fluids engineering
• /
• v.9 no.2
• /
• pp.1-10
• /
• 2004

In the present study, a post-processing program is developed for 3D data visualization and analysis. Because the graphical user interface(GUI) of the program is based on Qt-library while all the graphic rendering is performed with OpenGL library, the program runs on not only MS Windows but also UNU and Linux systems without modifying source code. The structure of the program is designed according to the object-oriented programming(OOP) concept so that it has extensibility, reusability, and easiness compared to those by procedural programming. The program is organized as modules by classes, and these classes are made to function through inheritance and cooperation which is an important and valuable concept of object-oriented programming. The major functions realized so far which include mesh plot, contour plot, vector plot, streamline plot, and boundary plot are demonstrated and the relevant algorithms are described.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.15 no.1
• /
• pp.73-82
• /
• 1990

This paper describes two algorithms to Nonlinear programming problems with equality constraints and with equality and inequality constraints. The first method treats nonlinear programming problems with equality constraints. Utilizing the nonlinear programming problems with equality constraints. Utilizing the nonlinear parametric programming technique, the method solves the problem by imbedding it into a suitable one-parameter family of problems. The second method is to solve a nonlinear programming problem with equality and inequality constraints, by minimizing a square sum of nonlinear functions which is derived from the Kuhn-Tucker condition.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.2 no.1
• /
• pp.20-25
• /
• 2002

This paper presents a genetic programming based evolutionary strategy for on-line adaptive learnable evolvable hardware. Genetic programming can be useful control method for evolvable hardware for its unique tree structured chromosome. However it is difficult to represent tree structured chromosome on hardware, and it is difficult to use crossover operator on hardware. Therefore, genetic programming is not so popular as genetic algorithms in evolvable hardware community in spite of its possible strength. We propose a chromosome representation methods and a hardware implementation method that can be helpful to this situation. Our method uses context switchable identical block structure to implement genetic tree on evolvable hardware. We composed an evolutionary strategy for evolvable hardware by combining proposed method with other's striking research results. Proposed method is applied to the autonomous mobile robots cooperation problem to verify its usefulness.

• The Journal of the Acoustical Society of Korea
• /
• v.3 no.1
• /
• pp.25-35
• /
• 1984

This paper analysis the Dynamic Time Warping algorithms for time normalization of speech pattern and discusses the Dynamic Programming algorithm for spoken Korean isolated digits recognition. In the DP matching, feature vectors of the reference and test pattern are consisted of first three formant frequencies extracted by power spectrum density estimation algorithm of the ARMA model. The major differences in the various DTW algorithms include the global path constrains, the local continuity constraints on the path, and the distance weighting/normalization used to give the overall minimum distance. The performance criterias to evaluate these DP algorithms are memory requirement, speed of implementation, and recognition accuracy.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1994.04a
• /
• pp.58-66
• /
• 1994

The philosophy of object-oriented has found its role in various applications such as programming languages, databases, distributed systems, etc. Discussed in this paper is an experience of the object-oriented programming technique obtained while developing a particular CAD/CAM system. It has been well-known that the object-oriented programming language has good features enabling the improved reusability and extensibility of an existing code. The features include data abstraction, encapsulation, inheritance, polymorphism, and so on. This paper presents how these features of the object-oriented programming language, C++ in particular, can be applied to the implementation of geometric algorithms as well as graphical user interfaces.

• The Journal of Korean Association of Computer Education
• /
• v.19 no.1
• /
• pp.101-109
• /
• 2016

Designing algorithms is a very important learning process in computational thinking education because it requires learner's logical and procedural thinking. But the case studies that have topics of algorithms learning and students' types of errors in learning algorithms are not enough. So the purpose of this study is to analyze students' errors that discovered in the process of learning three control structures of programming using flowchart and provide types of errors in designing algorithms. Results about tests of three types of control structures in university student's algorithms learning class showed different cases of types of errors; types of sequential control error are not presented in the class, types of conditional control error are presented in the case of setting the conditions of nested conditional control, and types of iterative control are showed in the many cases of iterative conditions, statements of single and nested iterative control structure. The results of study will be a good case study about teaching designing algorithms of computational thinking education in elementary, secondary school and university.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.22 no.1
• /
• pp.15-28
• /
• 2018

Recently Machine Learning algorithms are widely used to process Big Data in various applications and a lot of these applications are executed in run time. Therefore the speed of Machine Learning algorithms is a critical issue in these applications. However the most of modern iteration Machine Learning algorithms use a successive iteration technique well-known in Numerical Linear Algebra. But this technique has a very low convergence, needs a lot of iterations to get solution of considering problems and therefore a lot of time for processing even on modern multi-core computers and clusters. Tchebychev iteration technique is well-known in Numerical Linear Algebra as an attractive candidate to decrease the number of iterations in Machine Learning iteration algorithms and also to decrease the running time of these algorithms those is very important especially in run time applications. In this paper we consider the usage of Tchebychev iterations for acceleration of well-known K-Means and SVM (Support Vector Machine) clustering algorithms in Machine Leaning. Some examples of usage of our approach on modern multi-core computers under Apache Spark framework will be considered and discussed.

• The Journal of Korean Association of Computer Education
• /
• v.21 no.4
• /
• pp.1-10
• /
• 2018

Block programming environment, which is represented by Scratch in elementary and middle school programming education, is suitable for learner's characteristics and cognitive level, and is recommended not only for beginners. Transference to the text programming environment after the block programming is essential for understanding the data processing process, understanding the accuracy and efficiency aspects of algorithms, and creating SW activity. In addition, it is presented step by step in the programming curriculum. In this study, developed WithBlock the online evaluation system for the purpose of transference from a block programming to a text programming environment. The developed system can solve the same algorithm problem in both block and text programming environment, and it can be used for elementary and secondary programming education by automatically scoring the written code and providing immediate feedback. In order to applicable to programming education in elementary and secondary surveyed the usability, learning possibility, interest and satisfaction of WithBlock. The results of the survey showed that it can be used for programming education.