• Journal of Information Processing Systems
• /
• v.10 no.2
• /
• pp.283-299
• /
• 2014

Skin detection is used in many applications, such as face recognition, hand tracking, and human-computer interaction. There are many skin color detection algorithms that are used to extract human skin color regions that are based on the thresholding technique since it is simple and fast for computation. The efficiency of each color space depends on its robustness to the change in lighting and the ability to distinguish skin color pixels in images that have a complex background. For more accurate skin detection, we are proposing a new threshold based on RGB and YUV color spaces. The proposed approach starts by converting the RGB color space to the YUV color model. Then it separates the Y channel, which represents the intensity of the color model from the U and V channels to eliminate the effects of luminance. After that the threshold values are selected based on the testing of the boundary of skin colors with the help of the color histogram. Finally, the threshold was applied to the input image to extract skin parts. The detected skin regions were quantitatively compared to the actual skin parts in the input images to measure the accuracy and to compare the results of our threshold to the results of other's thresholds to prove the efficiency of our approach. The results of the experiment show that the proposed threshold is more robust in terms of dealing with the complex background and light conditions than others.

• Journal of Digital Convergence
• /
• v.11 no.2
• /
• pp.299-307
• /
• 2013

The aim of this paper is the improvement of identification performance and the reduction of computational quantities in the face recognition system based on SIFT-Grid. Firstly, we propose a composition method of integrated template by removing similar SIFT keypoints and blending different keypoints in variety training images of one face class. The integrated template is made up of computation of similarity matrix and threshold-based histogram from keypoints in a same sub-region which divided by applying SIFT-Grid of training images. Secondly, we propose a computation method of similarity for identify of test image from composed integrated templates efficiently. The computation of similarity is performed that a test image to compare one-on-one with the integrated template of each face class. Then, a similarity score and a threshold-voting score calculates according to each sub-region. In the experimental results of face recognition tasks, the proposed methods is founded to be more accurate than both two other methods based on SIFT-Grid, also the computational quantities are reduce.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.12
• /
• pp.5785-5804
• /
• 2019

The information of localization is a fundamental requirement in wireless sensor network (WSN). The method of distance vector-hop (DV-Hop), a range-free localization algorithm, can locate the ordinary nodes by utilizing the connectivity and multi-hop transmission. However, the error of the estimated distance between the beacon nodes and ordinary nodes is too large. In order to enhance the positioning precision of DV-Hop, fast triangle flip bat algorithm, which is based on curve strategy and rank transformation (FTBA-TCR) is proposed. The rank is introduced to directly select individuals in the population of each generation, which arranges all individuals according to their merits and a threshold is set to get the better solution. To test the algorithm performance, the CEC2013 test suite is used to check out the algorithm's performance. Meanwhile, there are four other algorithms are compared with the proposed algorithm. The results show that our algorithm is greater than other algorithms. And this algorithm is used to enhance the performance of DV-Hop algorithm. The results show that the proposed algorithm receives the lower average localization error and the best performance by comparing with the other algorithms.

• Journal of the Institute of Convergence Signal Processing
• /
• v.21 no.2
• /
• pp.55-60
• /
• 2020

In this paper, we propose a fast block matching algorithm of motion estimation using early detection of optimal candidate with high priority and a threshold. Even though so many fast algorithms for motion estimation have been published to reduce computational reduction full search algorithm, still so many works to improve performance of motion estimation are being reported. The proposed algorithm calculates block matching error for each candidate with high priority from previous partial matching error. The proposed algorithm can be applied additionally to most of conventional fast block matching algorithms for more speed up. By doing that, we can find the minimum error point early and get speed up by reducing unnecessary computations of impossible candidates. The proposed algorithm uses smaller computation than conventional fast full search algorithms with the same prediction quality as the full search algorithm. Experimental results shows that the proposed algorithm reduces 30~70% compared with the computation of the PDE and full search algorithms without any degradation of prediction quality and further reduces it with other fast lossy algorithms.

• Journal of Korea Water Resources Association
• /
• v.35 no.5
• /
• pp.553-561
• /
• 2002

The objectives of this study are to introduce flash flood forecasting system in Korea and to develop a system for computing threshold runoff on very fine catchment scale. The developed GUI system composed of 9 steps starting from input data preparation to Input file creation for flash flood forecasting compute basin subdivision, hydrologic subbasin characteristics, bankfull flows, unit peak flows and threshold runoffs on about 5 $\textrm{km}^2$ scale. When the developed system was applied on Pyungchang IHP basin, the computed 1-hour threshold runoffs ranged 18.72~81.96mm with average value of 46.39mm. Judging from the comparison of the computed threshold runoffs between this study area and three other basins in United States, the computed results in this study were reasonable. It can be concluded that the developed system on ArcView/Avenue are useful for computing threshold runoff on small catchment and can be used as a component of flash flood forecasting system.

• Journal of Digital Contents Society
• /
• v.16 no.6
• /
• pp.951-959
• /
• 2015

Scene text extraction is important because it offers some important information on different image based applications pouring in current smart generation. Edge-Enhanced MSER(Maximally Stable Extremal Regions) which enhances the boundaries using the canny operator after extracting the basic MSER shows excellent performance in terms of text extraction. But according to setting the threshold of the canny operator, the result images using Edge-Enhanced MSER are different, so there needs a method figuring out the threshold. In this paper, we propose a AEMSER(Adaptive Edge-enhanced MSER) that applies the method extracting the boundary using the middle value of histogram to Edge-Enhanced MSER to get the canny operator's threshold. The proposed method can acquire better result images than the existing methods because it extracts the area only for the obvious boundaries.

• KIISE Transactions on Computing Practices
• /
• v.21 no.2
• /
• pp.121-125
• /
• 2015

In recent years, research on collaborative filtering-based recommendation systems emphasized the accuracy of rating predictions, and this has led to an increase in computation time. As a result, such systems have divergeded from the original purpose of making quick recommendations. In this paper, we propose a recommendation algorithm that uses a Preference Difference Metric to reduce the computation time and to maintain adequate performance. The system recommends items according to their preference classification.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.11
• /
• pp.5437-5454
• /
• 2016

A Wireless Sensor Network (WSN) is composed of several sensor nodes which are severely restricted to energy and memory. Energy is the lifeblood of sensors and thus energy conservation is a critical necessity of WSN. This paper proposes a clustering algorithm namely Energy Efficient Trustworthy Clustering algorithm (EETCA), which focuses on three phases such as chief node election, chief node recycling process and bi-level trust computation. The chief node election is achieved by Dempster-Shafer theory based on trust. In the second phase, the selected chief node is recycled with respect to the current available energy. The final phase is concerned with the computation of bi-level trust, which is triggered for every time interval. This is to check the trustworthiness of the participating nodes. The nodes below the fixed trust threshold are blocked, so as to ensure trustworthiness. The system consumes lesser energy, as all the nodes behave normally and unwanted energy consumption is completely weeded out. The experimental results of EETCA are satisfactory in terms of reduced energy consumption and prolonged lifetime of the network.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.30 no.6 s.249
• /
• pp.722-727
• /
• 2006

Bone fracture healing is one of the important topics in biomechanics, demanding computation simulations due to the difficulty of obtaining experimental or clinical results. In this study, we adopt the design space optimization method which was established by the authors as a tool for the simulation of bone growth using its evolutionary characteristics. As the mechanical stimulus, strain energy density is used. We assume that bone tissues over a threshold strain energy density will be differentiated and bone tissues below another threshold will be resorbed. Under compression and torsion as loadings, the filling process of the defect is well illustrated following the given mechanical criterion. It is shown that the design space optimization is an excellent tool for simulating the evolutionary process of bone growth, which has not been possible otherwise.

• Journal of the Semiconductor & Display Technology
• /
• v.19 no.4
• /
• pp.88-93
• /
• 2020

Based on the capture-emission energy (CEE) maps of CMOS devices, a physics-informed machine learning model for the bias temperature instability (BTI)-induced threshold voltage shifts and low frequency noise is presented. In order to incorporate physics theories into the machine learning model, the integration of artificial neural network (IANN) is employed for the computation of the threshold voltage shifts and low frequency noise. The model combines the computational efficiency of IANN with the optimal estimation of Gaussian mixture model (GMM) with soft clustering. It enables full lifetime prediction of BTI under various stress and recovery conditions and provides accurate prediction of the dynamic behavior of the original measured data.