• Journal of Biosystems Engineering
• /
• v.35 no.2
• /
• pp.138-145
• /
• 2010

An on-line algorithm that discriminates brown rice kernels on their echelon feeder using color image processing is presented for quality inspection. A rapid color image segmentation algorithm based on Bayesian clustering method was developed by means of the look-up table which was made from the significant clusters selected by experts. A robust estimation method was presented to improve the stability of color clusters. Discriminant analysis of color distributions was employed to distinguish nine types of brown rice kernels. Discrimination accuracies of the on-line discrimination algorithm were ranged from 72% to 85% for the sound, cracked, green-transparent and green-opaque, greater than 93% for colored, red, and unhulled, about 92% for white-opaque and 67% for chalky, respectively.

• Korean Journal of Computational Design and Engineering
• /
• v.13 no.1
• /
• pp.67-75
• /
• 2008

In spite of rapidly increasing interests in digital manufacturing, there still lacks of a systematic approach in manufacturing line flow analysis via modeling and simulation; currently, the parameters for designing manufacturing line are defined by being solely based on engineers experiences. The paper proposes an application of the genetic algorithm to a discrete event line simulation finding optimal set of parameters for manufacturing line balancing problem. The proposed method has been applied to two example problems-one is a simple manufacturing model and the other for shipyard industry-in order to demonstrate its validity and usefulness.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.11
• /
• pp.119-126
• /
• 2019

The partial inverse optimization problem is an interesting variant of the inverse optimization problem in which the given instance of an optimization problem need to be modified so that a prescribed partial solution can constitute a part of an optimal solution in the modified instance. In this paper, we consider the traveling salesman problem defined on the line (TSP on the line) which has many applications such as item delivery systems, the collection of objects from storage shelves, and so on. It is worth studying the partial inverse TSP on the line, defined as follows. We are given n requests on the line, and a sequence of k requests that need to be served consecutively. Each request has a specific position on the real line and should be served by the server traveling on the line. The task is to modify as little as possible the position vector associated with n requests so that the prescribed sequence can constitute a part of the optimal solution (minimum Hamiltonian cycle) of TSP on the line. In this paper, we show that the partial inverse TSP on the line and its variant can be solved in polynomial time when the sever is equiped with a specific internal algorithm Forward Trip or with a general optimal algorithm.

• Proceedings of the IEEK Conference
• /
• 2000.06a
• /
• pp.115-118
• /
• 2000

In order to control the flow of traffics in ATM networks and optimize the usage of network resources, an efficient control mechanism is necessary to cope with congestion and prevent the degradation of network performance caused by congestion. To effectively control traffic in UNI(User Network Interface) stage, we proposed algorithm of integrated model using on-line teaming neural network for CAC(Call Admission Control) and UPC(Usage Parameter Control). Simulation results will show that the proposed adaptive algorithm uses of network resources efficiently and satisfies QoS for the various kinds of traffics.

• The Journal of Korea Robotics Society
• /
• v.11 no.1
• /
• pp.1-8
• /
• 2016

In this paper, we propose a new algorithm of the guidance line extraction for autonomous agricultural robot based on vision camera in paddy field. It is the important process for guidance line extraction which finds the central point or area of rice row. We are trying to use the central region data of crop that the direction of rice leaves have convergence to central area of rice row in order to improve accuracy of the guidance line. The guidance line is extracted from the intersection points of extended virtual lines using the modified robust regression. The extended virtual lines are represented as the extended line from each segmented straight line created on the edges of the rice plants in the image using the Hough transform. We also have verified an accuracy of the proposed algorithm by experiments in the real wet paddy.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1997.10a
• /
• pp.162-165
• /
• 1997

본 연구에서는 off-line 스케쥴링과 on-line 스케쥴링을 함께 고려하는 스케쥴링 메카니즘에 대해 설명하였다. 일반적으로 스케쥴링은 off-line 문제를 주로 다룬다. 그러나, off-line으로 생성된 스케쥴은 실시간으로 발생하는 여러 문제들(기계 고장, 긴급 주문등) 때문에 현실과 맞지 않게 되어 유용성이 떨어지는 경우가 자주 발생한다. 따라서 off-line 스케쥴링의 결과를 수행할때 위와 같은 문제가 발생할 경우, 스케쥴의 변화를 흡수하면서 off-line 스케쥴링의 결과를 최대한 유지할수 있는 on-line 스케쥴링에서 이 같은 스케쥴 실행시의 문제를 해결할 수 있도록 bidding 알고리즘을 사용하는 방법을 제시하였다.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.857-858
• /
• 2008

This paper proposes a new fast algorithm that detects the lanes on the road using Moore-Neighbor edge trace algorithm, which traces the edge elements by searching the connectivity in eight direction window. The detected line components are connected if they have the same orientation on the same line. The proposed algorithm is faster than other conventional algorithms since it tests only the connectivities of the line segments. The performance of the proposed algorithm has tested by the experiments to test how fast and accurate.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2192-2195
• /
• 2003

This parer proposes a power-line phase measurement algorithm which is based on the recursive implementation of sliding-DFT. Usage of the single DFT coefficient in the conventional sliding-DFT based power-line phase measurement brings a significant error propagation when implemented in hardware with finite word-length arithmetic operations. The proposed algorithm utilizes all the N-point DFT coefficients in the recursion. Performance degradation caused by the finite word- length implementation of the algorithm is analyzed and verified with computer simulations. The robustness of the proposed phase measurement algorithm against the erroneous implementation is also confirmed by the performance analysis and simulation.

• Journal of Internet Computing and Services
• /
• v.16 no.1
• /
• pp.29-37
• /
• 2015

In this paper, we propose a robust pre-processing module for camera-based Optical Music Score Recognition (OMR) on mobile device. The captured images likely suffer for recognition from many distortions such as illumination, blur, low resolution, etc. Especially, the complex background music sheets recognition are difficult. Through any symbol recognition system, the staff line height and staff line space are used many times and have a big impact on recognition module. A robust and accurate staff line height and staff line space are essential. Some staff line height and staff line space are proposed for binary image. But in case of complex background music sheet image, the binarization results from common binarization algorithm are not satisfactory. It can cause incorrect staff line height and staff line space estimation. We propose a robust staff line height and staff line space estimation by using run-length encoding technique on edge image. Proposed method is composed of two steps, first step, we conducted the staff line height and staff line space estimation based on edge image using by Sobel operator on image blocks. Each column of edge image is encoded by run-length encoding algorithm Second step, we detect the staff line using by Stable Path algorithm and removal the staff line using by adaptive Line Track Height algorithm which is to track the staff lines positions. The result has shown that robust and accurate estimation is possible even in complex background cases.

• Plant Journal
• /
• v.16 no.4
• /
• pp.33-39
• /
• 2020

For several decades, productivity in construction industry has been regressed and it is inevitable to improve productivity for major EPC players. One of challenges to achieve this goal is automatically extracting information from imaged drawings. Although computer vision technique has been advanced rapidly, it is still a problem to detect pipe lines in a drawing. Earlier works for line detection have problems that detected line elements be broken into small pieces and accuracy of detection is not enough for engineers. Thus, we adopted Contour and Hough Transform algorithm and reinforced these to improve detection results. First, Contour algorithm is used with Ramer Douglas Peucker algorithm(RDP). Weakness of contour algorithm is that some blank spaces are occasionally found in the middle of lines and RDP covers them around 17%. Second, HEC Hough Transform algorithm, we propose on this paper, is improved version of Hough Transform. It adopted iteration of Hough Transform and merged detected lines by conventional Hough Transform based on Euclidean Distance. As a result, performance of Our proposed method improved by 30% than previous.