• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.40 no.3
• /
• pp.127-136
• /
• 2003

In this paper, we propose a robust object tracking algorithm based on model and edge, using deformed template and Level-Set theory. The proposed algorithm can track objects in case of background variation, object flexibility and occlusions. First we design a new potential difference energy function(PDEF) composed of two terms including inter-region distance and edge values. This function is utilized to estimate and refine the object shape. The first step is to approximately estimate the shape and location of template object based on the assumption that the object changes its shape according to the affine transform. The second step is a refinement of the object shape to fit into the real object accurately, by using the potential energy map and the modified Level-Set speed function. The experimental results show that the proposed algorithm can track non-rigid objects under various environments, such as largely flexible objects, objects with large variation in the backgrounds, and occluded objects.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.35 no.3
• /
• pp.87-94
• /
• 1986

This paper introduce a new test generation method based on built-in data base which is suitable for generating of test set by using PROLOG language. The program presented in this paper deals with all the information required for fault detection from the rules describing output signals and internal signals. Example shows the validity of proposed PROLOG program which results in a effective generation of test set comparable to the conventional D-algorithm.

• Journal of Korean Institute of Industrial Engineers
• /
• v.26 no.3
• /
• pp.289-295
• /
• 2000

The triangulation problem is to make triangles using the given points on the space. The Minimum Weight Triangulation(MWT) is the problem of finding a set of triangles with the minimum weight among possible set of the triangles. In this paper, a modified genetic algorithm(GA) based on an existing genetic algorithm and multispace smoothing technique is proposed. Through the computational results, we can find the tendency that the proposed GA finds good solutions though it needs longer time than the existing GA does as the problem size increases.

• Journal of Institute of Control, Robotics and Systems
• /
• v.8 no.12
• /
• pp.1056-1060
• /
• 2002

Model-based tuning rules of the PID controller are proposed incorporating with real-coded genetic algorithms. The optimal parameter sets of the PID controller for step set-point tracking are obtained based on the first-order time delay model and a real-coded genetic algorithm as an optimization tool. As for assessing the performance of the controllers, performance indices(ISE, IAE and ITAE) are adopted. Then tuning rules are derived using the tuned parameter sets, potential rule models and another real-coded genetic algorithm A set of simulation works is carried out to verify the effectiveness of the proposed rules.

• Journal of Korea Society of Industrial Information Systems
• /
• v.16 no.4
• /
• pp.119-125
• /
• 2011

The part family (PF) formation in a cellular manufacturing has been a key issue for the successful implementation of Group Technology (GT). Basically, a part has two different attributes; i.e., design and manufacturing. The respective similarity in both attributes is often conflicting each other. However, the two attributes should be taken into account appropriately in order for the PF to maximize the benefits of the GT implementation. This paper proposes a clustering algorithm which considers the two attributes simultaneously based on pareto optimal theory. The similarity in each attribute can be represented as two individual objective functions. Then, the resulting two objective functions are properly combined into a pareto fitness function which assigns a single fitness value to each solution based on the two objective functions. A GA is used to find the pareto optimal set of solutions based on the fitness function. A set of hypothetical parts are grouped using the proposed system. The results show that the proposed system is very promising in clustering with multiple objectives.

• KIISE Transactions on Computing Practices
• /
• v.20 no.12
• /
• pp.711-716
• /
• 2014

With the gradual increase of interest in plagiarism and intelligent file content search, the demand for similarity measuring between two sentences is increasing. There is a lot of researches for sentence similarity measurement methods in various directions such as n-gram, edit-distance and LSA. However, these methods have their own advantages and disadvantages. In this paper, we propose a new sentence similarity measurement method approaching from another direction. The proposed method uses the set-based POI data search that improves search performance compared to the existing hard matching method when data includes the inverse, omission, insertion and revision of characters. Using this method, we are able to measure the similarity between two sentences more accurately and more quickly. We modified the data loading and text search algorithm of the set-based POI data search. We also added a word operation algorithm and a similarity measure between two sentences expressed as a percentage. From the experimental results, we observe that our sentence similarity measurement method shows better performance than n-gram and the set-based POI data search.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.2
• /
• pp.187-196
• /
• 1996

This paper introduces the concept of fixed weights and proposes an algorithm for classification by adding this concept to vector space separation method in LVQ. The proposed algorithm is based on competitive learning. It uses fixed weightsfor generality and fast adaptation efficient radius for new weight creation, and L1 distance for fast calcualtion. It can be applied to many fields requiring adaptive learning with the support of generality, real-tiem processing and sufficient training effect using smaller data set. Recognition rate of over 98% for the train set and 94% for the test set was obtained by applying the suggested algorithm to on-line handwritten recognition.

• IE interfaces
• /
• v.12 no.1
• /
• pp.94-101
• /
• 1999

The set covering(SC) problem is the problem of covering all the rows of an $m{\times}n$ matrix of ones and zeros by a subset of columns with a minimal cost. It has many practical applications of modeling of real world problems. The SC problem has been proven to be NP-complete and many algorithms have been presented to solve the SC problem. In this paper we present hybrid simulated annealing(HSA) algorithm based on the Simulated Annealing(SA) for the SC problem. The HSA is an algorithm which combines SA with a crossover operation in a genetic algorithm and a local search method. Our experimental results show that the HSA obtains better results than SA does.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.11
• /
• pp.2720-2736
• /
• 2013

Multi-view face detection has become an active area for research in the last few years. In this paper, a novel multi-view human face detection algorithm based on improved real Adaboost is presented. Real Adaboost algorithm is improved by weighted combination of weak classifiers and the approximately best combination coefficients are obtained. After that, we proved that the function of sample weight adjusting method and weak classifier training method is to guarantee the independence of weak classifiers. A coarse-to-fine hierarchical face detector combining the high efficiency of Haar feature with pose estimation phase based on our real Adaboost algorithm is proposed. This algorithm reduces training time cost greatly compared with classical real Adaboost algorithm. In addition, it speeds up strong classifier converging and reduces the number of weak classifiers. For frontal face detection, the experiments on MIT+CMU frontal face test set result a 96.4% correct rate with 528 false alarms; for multi-view face in real time test set result a 94.7 % correct rate. The experimental results verified the effectiveness of the proposed approach.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.6
• /
• pp.2446-2462
• /
• 2016

In this paper, a frequency domain Expectation-Maximization (EM)-based channel estimation algorithm for Space Time Block Coded-Orthogonal Frequency Division Multiplexing (STBC-OFDM) systems is investigated to support higher data rate applications in wireless communications. The computational complexity of the frequency domain EM-based channel estimation is increased when higher order constellations are used because of the ascending size of the search set space. Thus, a search set reduction algorithm is proposed to decrease the complexity without sacrificing the system performance. The performance results of the proposed algorithm is obtained in terms of Bit Error Rate (BER) and Mean Square Error (MSE) for 16QAM and 64QAM modulation schemes.