• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.803-806
• /
• 2000

The correspondence problem is known to be difficult to solve because false positives and false negatives almost always exist in real image sequences. In this paper, we propose a robust feature tracking algorithm considering incomplete trajectories such as entering and/or vanishing trajectories. We solve the correspondence problem as the optimal graph search problem, by considering false feature points and by properly reflecting motion characteristics. The proposed algorithm finds a local optimal correspondence so that the effect of false feature points can be minimized in the decision process. The time complexity of the proposed graph search algorithm is given by O(mn) in the best case and O(m$^2$n) in the worst case, where m and n are the number of feature points in two consecutive frames. The proposed algorithm can find trajectories correctly and robustly, which has been shown by experimental results.

• International Journal of Reliability and Applications
• /
• v.13 no.2
• /
• pp.91-104
• /
• 2012

Sarhan and Kundu (2009) introduced a new distribution named as the generalized linear failure rate distribution. This distribution generalizes several well known distributions. The probability density function of the generalized linear failure rate distribution can be right skewed or unimodal and its hazard function can be increasing, decreasing or bathtub shaped. This distribution can be used quite effectively to analyze lifetime data in place of linear failure rate, generalized exponential and generalized Rayleigh distributions. In this paper, we apply the simulated annealing algorithm to obtain the maximum likelihood point estimates of the parameters of the generalized linear failure rate distribution. Simulated annealing algorithm can not only find the global optimum; it is also less likely to fail because it is a very robust algorithm. The estimators obtained using simulated annealing algorithm have been compared with the corresponding traditional maximum likelihood estimators for their risks.

• Structural Engineering and Mechanics
• /
• v.36 no.5
• /
• pp.529-544
• /
• 2010

Nonlinear equations of structures are generally solved numerically by the iterative solution of linear equations. However, this iterative procedure diverges when the tangent stiffness is ill-conditioned which occurs near limit points. In other words, a major challenge with simple iterative methods is failure caused by a singular or near singular Jacobian matrix. In this paper, using the Newton-Raphson algorithm based on Davidenko's equations, the iterations can traverse the limit point without difficulty. It is argued that the propose algorithm may be both more computationally efficient and more robust compared to the other algorithm when tracing path through severe nonlinearities such as those associated with structural collapse. Two frames are analyzed using the proposed algorithm and the results are compared with the previous methods. The ability of the proposed method, particularly for tracing the limit points, is demonstrated by those numerical examples.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.10a
• /
• pp.468-473
• /
• 1998

An intelligent multimode target tracking algorithm using fuzzy logic is presented. Multimode tracking represents a synergistic approach that utilizes a variety of tracking techniques(centroid, correlation, etc.) to overcome the limitations inherent in any single-mode tracker. The design challenge for this type of multimode tracker is the data fusion algorithm. designs for this algorithm are based on heuristic rather than analytical approaches. A correlation-tracking algorithm seeks to align the incoming target image with a reference in age of the target, but has a critical problem, so called drift phenomenon. In this paper we will suggest a robust correlation tracker with gradient preprocessor combined by centroid algorithm to overcome the drift problem.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.4C
• /
• pp.384-391
• /
• 2003

Blind channel identification and equalization attempt to identify the communication channel and to remove the inter-symbol interference caused by a communication channel without using any known trainning sequences. In this paper, we propose a blind adaptive channel identification and equalization algorithm with phase offset compensation for single-input multiple-output (SIMO) channel. It is based on the one-step forward multichannel linear prediction error method and can be implemented by an RLS algorithm. Phase offset problem, we use a blind adaptive algorithm called the constant modulus derotator (CMD) algorithm based on condtant modulus algorithm (CMA). Moreover, unlike many known subspace (SS) methods or cross relation (CR) methods, our proposed algorithms do not require channel order estimation. Therefore, our algorithms are robust to channel order mismatch.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.9
• /
• pp.1706-1713
• /
• 2009

In this paper, a parallel operation algorithm for high power PEMFC generation systems is proposed. According to increasing the capacity of fuel cell systems with several fuel cell stacks, the different dynamic characteristics of each fuel cell stack effect on imbalance of load sharing and current distribution, so that a robust parallel operation algorithm is desired. Therefore, a power-sharing technique is developed and explained in order to design an optimal distributed PEMFC generation system. In addition, an optimal controller design procedure for the proposed parallel operation algorithm is introduced, along with informative simulations and experimental results.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.9 no.4
• /
• pp.135-141
• /
• 2013

String matching is one of the key algorithms in network security and many areas could be benefit from a faster string matching algorithm. Based on the most efficient string matching algorithm in sual applications, the Boyer-Moore (BM) algorithm, a novel algorithm called RQS is proposed. RQS utilizes an improved bad character heuristic to achieve bigger shift value area and an enhanced good suffix heuristic to dramatically improve the worst case performance. The two heuristics combined with a novel determinant condition to switch between them enable RQS achieve a higher performance than BM both under normal and worst case situation. The experimental results reveal that RQS appears efficient than BM many times in worst case, and the longer the pattern, the bigger the performance improvement. The performance of RQS is 7.57~36.34% higher than BM in English text searching, 16.26~26.18% higher than BM in uniformly random text searching, and 9.77% higher than BM in the real world Snort pattern set searching.

• Journal of Korean Institute of Industrial Engineers
• /
• v.24 no.3
• /
• pp.417-429
• /
• 1998

This paper considers two-sided (left and right side) assembly lines which are often used, especially in assembling large-sized products such as trucks and buses. A large number of exact algorithms and heuristics have been proposed to balance one-sided lines. However, little attention has been paid to balancing two-sided assembly lines. We present an efficient algorithm based on a branch and bound for balancing two-sided assembly lines. The algorithm involves a procedure for generating an enumeration tree. To efficiently search for the near optimal solutions to the problem, assignment rules are used in the method. New and existing bound strategies and dominance rules are else employed. The proposed algorithm can find a near optimal solution by enumerating feasible solutions partially. Extensive computational experiments are carried out to make the performance comparison between the proposed algorithm and existing ones. The computational results show that our algorithm is promising and robust in solution quality.

• International Journal of Contents
• /
• v.2 no.3
• /
• pp.27-32
• /
• 2006

We present an effective algorithm for automatic tracing of retinal vessel structure and vascular landmark extraction of bifurcations and ending points. In this paper we deal with vascular patterns from RGB images for personal identification. Vessel tracing algorithms are of interest in a variety of biometric and medical application such as personal identification, biometrics, and ophthalmic disorders like vessel change detection. However eye surface vasculature tracing in RGB images has many problems which are subject to improper illumination, glare, fade-out, shadow and artifacts arising from reflection, refraction, and dispersion. The proposed algorithm on vascular tracing employs multi-stage processing of ten-layers as followings: Image Acquisition, Image Enhancement by gray scale retinal image enhancement, reducing background artifact and illuminations and removing interlacing minute characteristics of vessels, Vascular Structure Extraction by connecting broken vessels, extracting vascular structure using eight directional information, and extracting retinal vascular structure, and Vascular Landmark Extraction by extracting bifurcations and ending points. The results of automatic retinal vessel extraction using jive different thresholds applied 34 eye images are presented. The results of vasculature tracing algorithm shows that the suggested algorithm can obtain not only robust and accurate vessel tracing but also vascular landmarks according to thresholds.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.68 no.1
• /
• pp.189-198
• /
• 2019

In recent years, visual-inertial odometry(VIO) algorithms have been extensively studied for the indoor/urban environments because it is more robust to dynamic scenes and environment changes. In this paper, we propose loosely coupled(LC) VIO algorithm that utilizes the velocity vectors from both visual odometry(VO) and inertial measurement unit(IMU) as a filter measurement of Extended Kalman filter. Our approach improves the estimation performance of a filter without adding extra sensors while maintaining simple integration framework, which treats VO as a black box. For the VO algorithm, we employed a fundamental part of the ORB-SLAM, which uses ORB features. We performed an outdoor experiment using an RGB-D camera to evaluate the accuracy of the presented algorithm. Also, we evaluated our algorithm with the public dataset to compare with other visual navigation systems.