• IEMEK Journal of Embedded Systems and Applications
• /
• v.18 no.3
• /
• pp.117-124
• /
• 2023

In the machine vision inspection equipment, diameter measurement is important process in inspection of cylindrical object. However, machine vision inspection equipment requires complex algorithm processing such as camera distortion correction and perspective distortion correction, and the increase in processing time and cost required for precise diameter measurement. In this paper, we proposed the algorithm for diameter measurement of cylindrical object using the laser displacement sensor. In order to fit circle for given four input outer points, grid search algorithms using root-mean-square error and mean-absolute error are applied and compared. To solve the limitations of the grid search algorithm, we finally apply the singular-value-decomposition based circle fitting algorithm. In order to compare the performance of the algorithms, we generated the pseudo data of the outer points of the cylindrical object and applied each algorithm. As a result of the experiment, the grid search using root-mean-square error confirmed stable measurement results, but it was confirmed that real-time processing was difficult as the execution time was 10.8059 second. The execution time of mean-absolute error algorithm was greatly improved as 0.3639 second, but there was no weight according to the distance, so the result of algorithm is abnormal. On the other hand, the singular-value-decomposition method was not affected by the grid and could not only obtain precise detection results, but also confirmed a very good execution time of 0.6 millisecond.

• International Journal of Computer Science & Network Security
• /
• v.23 no.6
• /
• pp.193-201
• /
• 2023

In this paper, we consider the maximum scatter traveling salesman problem (MSTSP), a travelling salesman problem (TSP) variant. The problem aims to maximize the minimum length edge in a salesman's tour that travels each city only once in a network. It is a very complicated NP-hard problem, and hence, exact solutions can be found for small sized problems only. For large-sized problems, heuristic algorithms must be applied, and genetic algorithms (GAs) are found to be very successfully to deal with such problems. So, this paper develops a hybrid GA (HGA) for solving the problem. Our proposed HGA uses sequential sampling algorithm along with 2-opt search for initial population generation, sequential constructive crossover, adaptive mutation, randomly selected one of three local search approaches, and the partially mapped crossover along with swap mutation for perturbation procedure to find better quality solution to the MSTSP. Finally, the suggested HGA is compared with a state-of-art algorithm by solving some TSPLIB symmetric instances of many sizes. Our computational experience reveals that the suggested HGA is better. Further, we provide solutions to some asymmetric TSPLIB instances of many sizes.

• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.406-417
• /
• 2001

With the advances in multimedia databases on the World Wide Web, it becomes more important to provide users with the search capability of distributed multimedia data. While there have been many studies about the database selection and the collection fusion for text databases. The multimedia databases on the Web have autonomous and heterogeneous properties and they use mainly the content based retrieval. The collection fusion problem of multimedia databases is concerned with the merging of results retrieved by content based retrieval from heterogeneous multimedia databases on the Web. This problem is crucial for the search in distributed multimedia databases, however, it has not been studied yet. This paper provides novel algorithms for processing the collection fusion of heterogeneous multimedia databases on the Web. We propose two heuristic algorithms for estimating the number of objects to be retrieved from local databases and an algorithm using the linear regression. Extensive experiments show the effectiveness and efficiency of these algorithms. These algorithms can provide the basis for the distributed content based retrieval algorithms for multimedia databases on the Web.

• Journal of the Korea Computer Graphics Society
• /
• v.9 no.3
• /
• pp.23-29
• /
• 2003

There is the temporal correlation of the video sequence between the motion vector of current block and the motion vector of the previous block. If we can obtain useful and enough information from the motion vector of the same coordinate block of the previous frame, the total number of search points used to find the motion vector of the current block may be reduced significantly. In this paper, we propose the block-matching motion estimation using an adaptive initial search point by the predicted motion information from the same block of the previous frame. And the first search point of the proposed algorithm is moved an initial point on the location of being possibility and the searching process after moving the first search point is processed according to the fast search pattern. Simulation results show that PSNR(Peak-to-Signal Noise Ratio) values are improved UP to the 1.05dB as depend on the image sequences and improved about 0.33~0.37dB on an average. Search times are reduced about 29~97% than the other fast search algorithms. Simulation results also show that the performance of the proposed scheme gives better subjective picture quality than the other fast search algorithms and is closer to that of the FS(Full Search) algorithm.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.2
• /
• pp.236-242
• /
• 2008

In this paper, we propose an optimized fuzzy controller based on Hierarchical Fair Competition-based Genetic Algorithms (HFCGA) for rotary inverted pendulum system. We adopt fuzzy controller to control the rotary inverted pendulum and the fuzzy rules of the fuzzy controller are designed based on the design methodology of Linear Quadratic Regulator (LQR) controller. Simple Genetic Algorithms (SGAs) is well known as optimization algorithms supporting search of a global character. There is a long list of successful usages of GAs reported in different application domains. It should be stressed, however, that GAs could still get trapped in a sub-optimal regions of the search space due to premature convergence. Accordingly the parallel genetic algorithm was developed to eliminate an effect of premature convergence. In particular, as one of diverse types of the PGA, HFCGA has emerged as an effective optimization mechanism for dealing with very large search space. We use HFCGA to optimize the parameter of the fuzzy controller. A comparative analysis between the simulation and the practical experiment demonstrates that the proposed HFCGA based fuzzy controller leads to superb performance in comparison with the conventional LQR controller as well as SGAs based fuzzy controller.

• Journal of Broadcast Engineering
• /
• v.12 no.5
• /
• pp.503-515
• /
• 2007

A new fast motion estimation algorithm is presented in this paper. The algorithm, named Enhanced Cross-Diamond Search (ECDS), is based on the Diamond Search (DS) algorithm. The DS algorithm, even though faster than the most well-known algorithms, was found not to be very robust in terms of objective and subjective qualities for several sequences and the algorithm searches unnecessary candidate blocks. We propose a novel ECDS algorithm using a small cross search as the initial step, and large/small DS patterns as subsequent steps for fast block motion estimation. Experimental results show that the ECDS is much more robust, provides a faster searching speed, and smaller distortions than other popular fast block-matching algorithms.

• Journal of Korea Water Resources Association
• /
• v.54 no.7
• /
• pp.475-484
• /
• 2021

The optimal design for water distribution system (WDS) is not only satisfying the minimum required water pressure of the nodes, but also minimizing pipe cost, etc. The number of designs of WDS increases exponentially due to the arrangement of various pipes. Various optimization algorithms were applied to propose an optimized design of WDS. In this study, Modified Hybrid Vision Correction Algorithm (MHVCA) with improved self-adapting parameter was applied to optimal design of WDS. The performance was improved by changing the Hybrid Rate (HR) of the existing Hybrid Vision Correction Algorithm (HVCA) to nonlinear HR. To verify the performance of the proposed MHVCA, it applied to mathematical problems consisting of 2 and 30 decision variables and constrained mathematical problems. In order to review the application results of MHVCA, it was compared with Harmony Search (HS), Improved Harmony Search (IHS), Vision Correction Algorithm (VCA) and HVCA. Finally, MHVCA was applied to the optimal design problem of WDS and the results were compared with other algorithms. MHVCA showed better results than other algorithms in mathematical problems and WDS problem. MHVCA will be able to show good results by applying to various water resource engineering problems as well as problems applied in this study.

• The Korean Journal of Applied Statistics
• /
• v.19 no.1
• /
• pp.149-161
• /
• 2006

The most important component in decision tree algorithm is the rule for split variable selection. Many earlier algorithms such as CART and C4.5 use greedy search algorithm for variable selection. Recently, many methods were developed to cope with the weakness of greedy search algorithm. Most algorithms have different selection criteria depending on the type of variables: continuous or nominal. However, ordinal type variables are usually treated as continuous ones. This approach did not cause any trouble for the methods using greedy search algorithm. However, it may cause problems for the newer algorithms because they use statistical methods valid for continuous or nominal types only. In this paper, we propose a ordinal variable selection method that uses Cramer-von Mises testing procedure. We performed comparisons among CART, C4.5, QUEST, CRUISE, and the new method. It was shown that the new method has a good variable selection power for ordinal type variables.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.8
• /
• pp.2327-2340
• /
• 2000

Existing bulk loading algorithms for multi-dimensional index structures suffer from satisfying both index construction time and retrieval perfonnancc. In this paper, we propose an efficient bulk loading algorithm to construct high dimensional index structures for large data set that overcomes the problem. Although several bulk loading algorithms have been proposed for this purpose, none of them improve both constnlCtion time and search performance. To improve the construction time, we don't sort whole data set and use bisectiou algorithm that divides the whole data set or a subset into two partitions according to the specific pivot value. Also, we improve the search performance by selecting split positions according to the distribution properties of the data set. We show that the proposed algorithm is superior to existing algorithms in terms of construction time and search perfomlance through various experiments.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.12
• /
• pp.2919-2925
• /
• 2014

Because of the rapid growth of mobile communication and wireless communication, Location-based services are handled in many applications. So, the management and analysis of spatio-temporal data are a hot issue in database research. Index structure and query processing of such contents are very important for these applications. This paper addressees algorithms that make index structure by using Douglas-Peucker Algorithm and process nearest neighbor search query efficiently on moving objects trajectories. We compare and analyze our algorithms by experiments. Our algorithms make small size of index structure and process the query more efficiently.