• Journal of IKEEE
• /
• v.17 no.1
• /
• pp.29-35
• /
• 2013

In this paper, we suggest an improved Convex Hull algorithm considering sort in plane point set. This algorithm has low computational complexity since processing data are reduced by characteristic of extreme points. Also it obtains a complete convex set with just one processing using an convex vertex discrimination criterion. Initially it requires sorting of point set. However we can't quickly sort because of its heavy operations. This problem was solved by replacing value and index. We measure the execution time of algorithms by generating a random set of points. The results of the experiment show that it is about 2 times faster than the existing algorithm.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.89-93
• /
• 2014

Reviews are very important for potential consumer' making choices. They are also used by manufacturers to find problems of their products and to collect competitors' business information. But someone write fake reviews to mislead readers to make wrong choices. Therefore detecting fake reviews is an important problem for the E-commerce sites. Support Vector Machines (SVMs) are very important text classification algorithms with excellent performance. In this paper, we propose a new incremental algorithm based on weight and the extension of Karush-Kuhn-Tucker(KKT) conditions and Convex Hull for online Review Spam Detection. Finally, we analyze its performance in theory.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2012.06a
• /
• pp.85-86
• /
• 2012

e-Navigation strategy IMO promotes is defined as it is necessary to network to provide various maritime safety information to in land and on board users, and it is expected to provide a large amount and diverse kinds of maritime spatial information services to them frequently. However, as there are some limits to transmit that by current mobile maritime communication technologies, it is required to simplify and optimize the information. In this study, tree node and convex hull method is applied to S-100 SD spatial information to generalize and we arranged the efficiency and effect of generalization by storing in XML form which can be used in general.

• The Journal of the Korea Contents Association
• /
• v.11 no.12
• /
• pp.522-532
• /
• 2011

In Oriental medicine, the status of a tongue is the important indicator to diagnose the condition of internal organs in a body. A tongue diagnosis is not only convenient but also non-invasive, and therefore widely used in Oriental medicine. But tongue diagnosis has some problems that should be objective and standardized, it also exhaust the diagnosis tool that can help for oriental medicine doctor's decision-making. In this paper, to solve the this problem we propose a method that calculates the tongue geometry information for effective tongue diagnosis analysis. Our method is to extract the tongue region for using improved snake algorithm, and calculates the geometry information by using convex hull and In-painting. In experiment, our method has stable performance as 7.2% by tooth plate and 8.5% by crack in region difference ratio.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.3
• /
• pp.513-518
• /
• 2016

This paper presents a fast 3D mesh generation method using projection for line laser-based 3D scanners. The well-known method for 3D mesh generation utilizes convex hulls for 4D vertices that is converted from the input 3D vertices. This 3D mesh generation for a large set of vertices requires a lot of time. To overcome this problem, the proposed method takes (${\theta}-y$) 2D depth map into account. The 2D depth map is a projection version of 3D data with a form of (${\theta}$, y, z) which are intermediately acquired by line laser-based 3D scanners. Thus, our 2D-based method is a very fast 3D mesh generation method. To evaluate our method, we conduct experiments with intermediate 3D vertex data from line-laser scanners. Experimental results show that the proposed method is superior to the existing method in terms of mesh generation speed.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.2
• /
• pp.69-78
• /
• 2002

This paper addresses a method to automatically detect out a person's face from a given image that consists of a hair and face view of the person and a complex background scene. Out method involves an effective detection algorithm that exploits the spatial distribution characteristics of human skin color via an adaptive fuzzy color classifier (AFCC), The universal skin-color map is derived on the chrominance component of human skin color in Cb, Cr and their corresponding luminance. The desired fuzzy system is applied to decide the skin color regions and those that are not. We use RGB model for extracting the hair color regions because the hair regions often show low brightness and chromaticity estimation of low brightness color is not stable. After some preprocessing, we apply convex-hull to each region. Consequent face detection is made from the relationship between a face's convex-hull and a head's convex-hull. The algorithm using the convex-hull shows better performance than the algorithm using pattern method. The performance of the proposed algorithm is shown by experiment. Experimental results show that the proposed algorithm successfully and efficiently detects the faces without constrained input conditions in color images.

• Journal of the Korea Society of Computer and Information
• /
• v.28 no.8
• /
• pp.119-126
• /
• 2023

In this paper, a new model was presented to objectively evaluate the defense ability of defenders in Korean professional baseball. In the proposed model, using Korean professional baseball game data from 2016 to 2019, a representative defender was selected for each team and defensive position to evaluate defensive ability. In order to evaluate the defense ability, a method of calculating the defense range for each position and dividing the calculated defense area was proposed. The defensive range for each position was calculated using the Convex Hull algorithm based on the point at which the defenders in the same position threw out the ball. The out conversion score and victory contribution score for both infielders and outfielders were calculated as basic scores using the defensive range for each position. In addition, double kill points for infielders and extra base points for outfielders were calculated separately and added together.

• Journal of the Institute of Convergence Signal Processing
• /
• v.5 no.4
• /
• pp.256-262
• /
• 2004

A key component of an autonomous mobile robot is to localize itself and build a map of the environment simultaneously. In this paper, we propose a vision-based localization and mapping algorithm of mobile robot using fisheye lens. To acquire high-level features with scale invariance, a camera with fisheye lens facing toward to ceiling is attached to the robot. These features are used in mP building and localization. As a preprocessing, input image from fisheye lens is calibrated to remove radial distortion and then labeling and convex hull techniques are used to segment ceiling and wall region for the calibrated image. At the initial map building process, features we calculated for each segmented region and stored in map database. Features are continuously calculated for sequential input images and matched to the map. n some features are not matched, those features are added to the map. This map matching and updating process is continued until map building process is finished, Localization is used in map building process and searching the location of the robot on the map. The calculated features at the position of the robot are matched to the existing map to estimate the real position of the robot, and map building database is updated at the same time. By the proposed method, the elapsed time for map building is within 2 minutes for 50㎡ region, the positioning accuracy is ±13cm and the error about the positioning angle of the robot is ±3 degree for localization.

• Journal of IKEEE
• /
• v.9 no.1 s.16
• /
• pp.7-18
• /
• 2005

A key component of an autonomous mobile robot is to localize itself accurately and build a map of the environment simultaneously. In this paper, we propose a vision-based mobile robot localization and mapping algorithm using scale-invariant features. A camera with fisheye lens facing toward to ceiling is attached to the robot to acquire high-level features with scale invariance. These features are used in map building and localization process. As pre-processing, input images from fisheye lens are calibrated to remove radial distortion then labeling and convex hull techniques are used to segment ceiling region from wall region. At initial map building process, features are calculated for segmented regions and stored in map database. Features are continuously calculated from sequential input images and matched against existing map until map building process is finished. If features are not matched, they are added to the existing map. Localization is done simultaneously with feature matching at map building process. Localization. is performed when features are matched with existing map and map building database is updated at same time. The proposed method can perform a map building in 2 minutes on $50m^2$ area. The positioning accuracy is ${\pm}13cm$, the average error on robot angle with the positioning is ${\pm}3$ degree.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.8
• /
• pp.65-75
• /
• 2013

This paper proposes a method of tracking the hand region and detecting the fingertip using only depth images. In order to eliminate the influence of lighting conditions and obtain information quickly and stably, this paper proposes a tracking method that relies only on depth information, as well as a method of using region growing to identify errors that can occur during the tracking process and a method of detecting the fingertip that can be applied for the recognition of various gestures. First, the closest point of approach is identified through the process of transferring the center point in order to locate the tracking point, and the region is grown from that point to detect the hand region and boundary line. Next, the ratio of the invalid boundary, obtained by means of region growing, is used to calculate the validity of the tracking region and thereby judge whether the tracking is normal. If tracking is normal, the contour line is extracted from the detected hand region and the curvature and RANSAC and Convex-Hull are used to detect the fingertip. Lastly, quantitative and qualitative analyses are performed to verify the performance in various situations and prove the efficiency of the proposed algorithm for tracking and detecting the fingertip.