• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.2
• /
• pp.369-374
• /
• 2010

The shortest path between two points inside a simple polygon P is a minimum-length path among all paths connecting them which don't pass by the exterior of P. A linear time algorithm for computing the shortest path in a general simple polygon requires triangulating a polygon as preprocessing. The linear time triangulating is known to very complex to understand and implement it. It is also inefficient in case that the input without very large size is given because its time complexity has a big constant factor. In this paper, we present the customized shortest path algorithm for a segment-visible polygon which is a simple polygon weakly visible from an internal line segment. Our algorithm doesn't require triangulating as preprocessing and consists of simple procedures such as construction of convex hulls, so it is easy to implement and runs very fast in linear time.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.797-800
• /
• 2008

Online signature verification system is widely used in banking account, credit card and so on, because system for online signature verification is easy to implementation and inexpensive. Therefore there are a lot of study on online signature verification. However there is little research about online signature is safe or not. This paper shows a way of online signature estimation using various information of signature. This paper make a experiment about relation sorority grade of online signature and 2-D information of online signature like the number of strokes and cross points, density of points, standard deviation of direction, velocity and acceleration, lengths of signature and convex hull etc. Finally, this paper presents several features of safe online signature.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.877-881
• /
• 2008

In this paper, we propose a real-time people tracking system with multiple CCD cameras for security inside the building. The camera is mounted from the ceiling of the laboratory so that the image data of the passing people are fully overlapped. The implemented system recognizes people movement along various directions. To track people even when their images are partially overlapped, the proposed system estimates and tracks a bounding box enclosing each person in the tracking region. The approximated convex hull of each individual in the tracking area is obtained to provide more accurate tracking information. To achieve this goal, we propose a method for 3D walking human tracking based on the IMPRESARIO framework incorporating cascaded classifiers into hypothesis evaluation. The efficiency of adaptive selection of cascaded classifiers have been also presented. We have shown the improvement of reliability for likelihood calculation by using cascaded classifiers. Experimental results show that the proposed method can smoothly and effectively detect and track walking humans through environments such as dense forests.

• Journal of Institute of Control, Robotics and Systems
• /
• v.19 no.5
• /
• pp.435-441
• /
• 2013

A swarm robot system consists of with multiple mobile robots, each of which is called an agent. Each agent interacts with others and cooperates for a given task and a given environment. For the swarm robotic system, the loss of the entire work capability by malfunction or damage to a single robot is relatively small and replacement and repair of the robot is less costly. So, it is suitable to perform more complex tasks. The essential component for a swarm robotic system is an inter-robot collaboration strategy for teamwork. Recently, the swarm intelligence theory is applied to robotic system domain as a new framework of collective robotic system design. In this paper, FA (Firefly Algorithm) which is based on firefly's reaction to the lights of other fireflies and their social behavior is employed to optimize the group behavior of multiple robots. The main application of the firefly algorithm is performed on path planning of swarm mobile robots and its effectiveness is verified by simulations under various conditions.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.22 no.1
• /
• pp.53-60
• /
• 1985

A computer vision system for robot is developed which can recognize a variety of two dimensional complex objects in gray level noisy scenes. the system is also capable of determining the position and orientation of the objects for robotlc manipulation. The hardware of the vision system is developed and a new edge tracking technique is also proposed. The linked edges are approximated to sample line drawing by split and merge algorithm. The system extracts many features from line drawing and constructs relational structure by the concave and convex hull of objects. In matching process, the input obhects are compared with the objects database which is formed by learning ability. Thelearning process is so simple that the system is very flexible. Several examples arc shown to demonstrate the usefulness of this system.

• Journal of Korean Institute of Industrial Engineers
• /
• v.32 no.1
• /
• pp.42-50
• /
• 2006

The multi-criteria group decision making (MCGDM) problem is to determine the best compromise solution in a set of competing alternatives that are evaluated under conflicting criteria by decision maker (DM)s. In this paper, we propose a mixed-integer programming (MIP) model to solve MCGDM. The existing method based on minimizing a distance measure such as Median Approach can not guarantee the best compromise solution because the element of median point vector is defined with respect to each criteria separately. However, by considering all criteria simultaneously, we generate median point that is better for locating the best compromise solution. We also utilize the concept of spatial dispersion index (SDI) to produce a threshold value, which is used as a guideline to choose either the Utopian Approach or the Median Approach. And we suggest using CBITP (Convex hull of individual maxima Based Interactive Tchebycheff Procedure) to provide DMs with various Pareto-optimal solutions so that DMs have broad range of selection.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2005.05b
• /
• pp.284-288
• /
• 2005

본 연구에서는 낙동강수계 일별 운영 계획 수립을 위한 저수지군 최적 연계운영 모형(CoMOM, Coordinated Multiple Reservoir Operating Model)을 개발하였다. 이를 위하여 동적 네트워크 흐름 모형을 기반으로 한 다중목적 혼합 정수 목표계획 모형 (MOMIGP, Multiple Objective Mixed Integer Goal-Programming)을 수립하였다. 이 모형은 월말 목표 수위 및 운영 제약 등을 목표 계획법으로 구성하였으며, 일별 운영의 특성을 고려하여 하도추적의 효과를 반영하였고, 선형화된 발전함수를 이용하여 발전량을 최대화 하도록 한 후 정확한 발전량을 사후에 산정하였다. 이와 같이 수립된 수학 모형을 GUI를 비롯한 프로그램(CoMOM)으로 개발하여 사용자가 편리하게 수행 할 수 있도록 하였다. 이 프로그램은 의사결정자의 운영 목표와 의도를 효과적으로 반영할 수 있도록 대화형 목표 계획법을 구현하였으며, 상충되는 여러 목적에 대하여 가능한 파래토(Pareto) 최적해를 제시하고 의사결정자가 가장 선호하는 해를 선택하도록 대화형 다중목적 계획법 CBITP(Convex hull of individual maxima Based Interactive Tchebycheff Procedure)를 활용하여 구현하였다. 한편 객체지항적 프로그램 기법을 활용하여 수계 내의 노드(저수지, 수요지, 발전소 등)를 추가 하거나 삭제 할 수 있도록 하여, 다른 수계로의 확장이 용이하도록 개발하였다.

• Bulletin of the Korean Mathematical Society
• /
• v.48 no.3
• /
• pp.523-537
• /
• 2011

A receiver operating characteristic (ROC) curve plots the true positive rate of a classier against its false positive rate, both of which are accuracy measures of the classier. The ROC curve has several interesting geometrical properties, including concavity which is a necessary condition for a classier to be optimal. In this paper, we study the nonparametric maximum likelihood estimator (NPMLE) of a concave ROC curve and its modification to reduce bias. We characterize the NPMLE as a solution to a geometric programming, a special type of a mathematical optimization problem. We find that the NPMLE is close to the convex hull of the empirical ROC curve and, thus, has smaller variance but positive bias at a given false positive rate. To reduce the bias, we propose a modification of the NPMLE which minimizes the $L_1$ distance from the empirical ROC curve. We numerically compare the finite sample performance of three estimators, the empirical ROC curve, the NMPLE, and the modified NPMLE. Finally, we apply the estimators to estimating the optimal ROC curve of the variance-threshold classier to segment a low depth of field image and to finding a diagnostic tool with multiple tests for detection of hemophilia A carrier.

• Journal of Computational Design and Engineering
• /
• v.2 no.1
• /
• pp.26-37
• /
• 2015

A lot of researchers have been investigating interactive portable projection systems such as a mini-projector. In addition, in exhibition halls and museums, there is a trend toward using interactive projection systems to make viewing more exciting and impressive. They can also be applied in the field of art, for example, in creating shadow plays. The key idea of the interactive portable projection systems is to recognize the user's gesture in real-time. In this paper, a vision-based shadow gesture recognition method is proposed for interactive projection systems. The gesture recognition method is based on the screen image obtained by a single web camera. The method separates only the shadow area by combining the binary image with an input image using a learning algorithm that isolates the background from the input image. The region of interest is recognized with labeling the shadow of separated regions, and then hand shadows are isolated using the defect, convex hull, and moment of each region. To distinguish hand gestures, Hu's invariant moment method is used. An optical flow algorithm is used for tracking the fingertip. Using this method, a few interactive applications are developed, which are presented in this paper.

• Proceedings of the Korean Institute Of Construction Engineering and Management
• /
• 2004.11a
• /
• pp.188-193
• /
• 2004

3D spatial-modeling can be used in various safety-enhancement applications and for as-built data acquisition in project-control systems. The objective of the research reported herein was to provide spatial-modeling methods that represent construction sites in an efficient manner and to validate the proposed methods by testing them in an actual construction environment. Algorithms to construct construction-site scenes and to carry out coordinate transformations in order to merge data from different acquisition locations are presented. Field experiments were conducted to establish performance parameters and validation for the proposed methods and models. Initial experimental work has demonstrated the feasibility of this approach.