• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.4
• /
• pp.21-29
• /
• 2011

At existing skin detection methods using skin color information defined based on the prior knowldege, threshold value to be used at the stage of dividing the backround and the skin region was decided on a subjective point of view through experiments. Also, threshold value was selected in a passive manner according to their background and illumination environments in these existing methods. These existing methods displayed a drawback in that their performance was fully influenced by the threshold value estimated through repetitive experiments. To overcome the drawback of existing methods, this paper propose a skin region detection method using a histogram approximation based on the mean shift algorithm. The proposed method is to divide the background region and the skin region by using the mean shift method at the histogram of the skin-map of the input image generated by the comparison of the similarity with the standard skin color at the CbCr color space and actively finding the maximum value converged by brightness level. Since the histogram has a form of discontinuous function accumulated according to the brightness value of the pixel, it gets approximated as a Gaussian Mixture Model (GMM) using the Bezier Curve method. Thus, the proposed method detects the skin region by using the mean shift method and actively finding the maximum value which eventually becomes the dividing point, not by using the manually selected threshold value unlike other existing methods. This method detects the skin region high performance effectively through experiments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.12A
• /
• pp.1006-1014
• /
• 2011

Recently, as CSMA technique has been increasingly adopted in various wireless networks, extensive researches to analyze the statistical characteristics of CSMA-based wireless networks have been done. Despite the ongoing efforts, there still remain many difficulties in the analysis because of unexpectable operational behavior of CSMA. Previous literature studying CSMA networks used the concept of the carrier sensing radius to reflect the carrier sensing function. However, since the carrier sensing radius based on the protocol model is not affected by the aggregate interference from other nodes, the derived statistical models cannot avoid approximation errors especially if the network is under high interference. In this paper, we propose an algorithm to derive the carrier sensing radius considering the physical model, where the carrier sensing radius reflecting the aggregate interference is found. For the purpose of this, we analyze the aggregate interference model and the behavior of CSMA function. Based on the analysis, we propose an iterative approximation algorithm for the physical carrier sensing radius. Extensive simulations and results show that the proposed algorithm can contribute to considerably reduce the statistical modeling error of a CSMA network under various channel conditions.

• Journal of KIISE:Databases
• /
• v.33 no.6
• /
• pp.600-619
• /
• 2006

According to recent technical advances on sensors and mobile devices, processing of data streams generated by the devices is becoming an important research issue. The data stream of real values obtained at continuous time points is called streaming time-series. Due to the unique features of streaming time-series that are different from those of traditional time-series, similarity matching problem on the streaming time-series should be solved in a new way. In this paper, we propose an efficient algorithm for streaming time- series matching problem that supports normalization transform. While the existing algorithms compare streaming time-series without any transform, the algorithm proposed in the paper compares them after they are normalization-transformed. The normalization transform is useful for finding time-series that have similar fluctuation trends even though they consist of distant element values. The major contributions of this paper are as follows. (1) By using a theorem presented in the context of subsequence matching that supports normalization transform[4], we propose a simple algorithm for solving the problem. (2) For improving search performance, we extend the simple algorithm to use $k\;({\geq}\;1)$ indexes. (3) For a given k, for achieving optimal search performance of the extended algorithm, we present an approximation method for choosing k window sizes to construct k indexes. (4) Based on the notion of continuity[8] on streaming time-series, we further extend our algorithm so that it can simultaneously obtain the search results for $m\;({\geq}\;1)$ time points from present $t_0$ to a time point $(t_0+m-1)$ in the near future by retrieving the index only once. (5) Through a series of experiments, we compare search performances of the algorithms proposed in this paper, and show their performance trends according to k and m values. To the best of our knowledge, since there has been no algorithm that solves the same problem presented in this paper, we compare search performances of our algorithms with the sequential scan algorithm. The experiment result showed that our algorithms outperformed the sequential scan algorithm by up to 13.2 times. The performances of our algorithms should be more improved, as k is increased.

• Journal of Korean Society of Steel Construction
• /
• v.12 no.5 s.48
• /
• pp.569-579
• /
• 2000

An improved multi-level (IML) optimization algorithm using automatic differentiation (AD) of framed structures is proposed in this paper. For the efficiency of the proposed algorithm, multi-level optimization techniques using a decomposition method that separates both system-level and element-level optimizations, that utilizes and an artificial constraint deletion technique, are incorporated in the algorithm. And also to save the numerical efforts, an efficient reanalysis technique through approximated structural responses such as moments and frequencies with respect to intermediate variables is proposed in the paper. Sensitivity analysis of dynamic structural response is executed by AD that is a powerful technique for computing complex or implicit derivatives accurately and efficiently with minimal human effort. The efficiency and robustness of the IML algorithm, compared with a plain multi-level (PML) algorithm, is successfully demonstrated in the numerical examples.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.113-115
• /
• 2015

In this paper, we proposed an algorithm based on movement prediction using rate of change of the attribute information of nodes what is called WRC(Weighted Rate Control) in delay tolerant networks(DTNs). Existing DTN routing algorithms based on movement prediction communicate by selecting relay nodes increasing connectivity with destination node. Thus, because the mobile nodes are in flux, the prediction algorithms that do not reflect the newest attribute information of node decrease reliability. In this paper, proposed algorithm approximate speed and direction of attribute information of node and analysis rate of change of attribute information of node. Then, it predict movement path of node using proposed weight. As the result, proposed algorithm show that network overhead and transmission delay time decreased by predicting movement path of node.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.1
• /
• pp.1-7
• /
• 2011

Terrain, building location and area, and building shape information is in need of implementing 3D map. This paper proposes a method of extracting a building area by an improved semi-automatic snake algorithm. The method consists of 3-stage: pre-processing, initializing control points, and applying an improved snake algorithm. In the first stage, after transforming a satellite image to a gray image and detecting the approximate edge of the gray image, the method combines the gray image and the edge. In the second stage, the user looks for the center point of a building and the system sets the circular or rectangular initial control points by an procedural method. In the third stage, the enhanced snake algorithm extracts the building area. In particular, this paper sets the one tenn of the snake in a new way in order to use the proposed method for specializing building area extraction. Finally, this paper evaluated the performance of the proposed method using sky view satellite image and it showed that the matching percentage to the exact building area is 75%.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2011.05a
• /
• pp.95-95
• /
• 2011

토양수분은 전 지구 및 기후 모델 연구, 전 지구 환경 감시, 기후변화, 대기-지표의 물과 에너지 상호교환 등 중요한 역할을 한다. 최근에는 수동형 마이크로웨이브 센서를 이용하여 토양수분을 탐지하고 있으며, NASA는 공식적인 전구 토양수분을 제공하고 있다. 특히, AMSR-E(Advandced Microwave Scanning Radiometer on EOS)의 6 GHz 영역에서 산출된 토양수분은 지표 토양층(0～5 cm)의 높으 정확도의 토양 수분 정보를 제공하고 있다. 지금까지의 위성관측을 이용한 토양 수분 알고리즘은 복잡한 선행모델과 관측된 경험식을 바탕으로 한다. 이 연구의 제안한 알고리즘은 위성에서 관측된 휘도온도 정보를 이용하여 역변환 방법을 이용하여 토양수분을 산출할 수 있기에, 복잡한 선행모델 사용을 최소화하는 장점이 있다. 본 연구에서 제시한 토양수분 산출 알고리즘은 각 채널(6.9 및 37 GHz)의 특성을 이용하여 거친 표면의 반사도를 산출한 후, 편광비율 특성을 이용한다. 아울러 반사도는 Hong 근사식을 이용하여 지표면 거칠기, 물질의 특성을 나타내는 유전상수를 산출하고 두 변수 사이의 관측된 경험적 관계식를 이용하여 전 지구적인 토양수분이 산출한다. 이 결과는 NASA에서 산출한 토양 수분과 현장관측 (SMEX03)의 오클라호마, 조지아 지역 관측 결과와 비교하였을 때, 사용자들이 요구하는 수준 (<0.06g/$cm^3$)의 정확도를 만족시킨다. 본 연구에서 제시된 토양수분 알고리즘은 단순성, 정확성, 물리적 기반을 바탕으로 하기에 현업용으로 그 활용 가치가 높다. 본 연구 결과는 향후 국외 토양수분산출 전용 위성들인 SMOS(Soil Moisture and Ocean Salinity)와 SMAP(Soil Moisture Active/Passive) 자료들을 생산하는데 활용된다면, 전 지구적 토양수분 정보제공에 기여할 수 있을 것으로 예산된다.

• Journal of Korean Society for Geospatial Information Science
• /
• v.19 no.1
• /
• pp.79-86
• /
• 2011

Recently, aerial laser scanning technology has received full attention in constructing DEM(Digital Elevation Model). It is well known that the quality of DEM is mostly influenced by the accuracy of DTD(Digital Terrain Data) extracted from LiDAR(Light Detection And Ranging) raw data. However, there are always misclassified data in the DTD generated by automatic filtering process due to the limitation of automatic filtering algorithm and intrinsic property of LiDAR raw data. In order to eliminate the misclassified data, a manual filtering process is performed right after automatic filtering process. In this study, an algorithm that detects automatically possible misclassified data included in the DTD from automatic filtering process is proposed, which will reduce the load of manual filtering process. The algorithm runs on 2D grid data structure and makes use of several parameters such as 'Slope Angle', 'Slope DeltaH' and 'NNMaxDH(Nearest Neighbor Max Delta Height)'. The experimental results show that the proposed algorithm quite well detected the misclassified data regardless of the terrain type and LiDAR point density.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.9
• /
• pp.782-787
• /
• 2001

In this paper, we propose an growing and pruning algorithm to design the adaptive structure of modular wavelet neural network(MWNN) with F-projection and geometric growing criterion. Geometric growing criterion consists of estimated error criterion considering local error and angel criterion which attempts to assign wavelet function that is nearly orthogonal to all other existing wavelet functions. There criteria provide a methodology that a network designer can constructs wavelet neural network according to one s intention. The proposed growing algorithm grows the module and the size of modules. Also, the pruning algorithm eliminates unnecessary node of module or module from constructed MWNN to overcome the problem due to localized characteristics of wavelet neural network which is used to modules of MWNN. We apply the proposed constructing algorithm of the adaptive structure of MWNN to approximation problems of 1-D function and 2-D function, and evaluate the effectiveness of the proposed algorithm.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.3
• /
• pp.259-259
• /
• 2003

Genetic algorithms using a Process of genetic evolution of an organism are appropriate for hard problems that have not been solved by any deterministic method. Up to now, the controller design method has been made with the frequency dependent specification but the design method with the time specification has gotten little progress. In this paper, we study the controller design to satisfy the performance of a plant using the generalized Manabe standard form. When dealing with a controller design in the case of two parameter configurations, there are some situations that neither a known pseudo inverse technique nor the inverse method can be applicable. In this case, we propose two methods of designing a controller by the gradient algorithm and the new pseudo inverse method so that the desired closed polynomials are either equalized to or approximated to the designed polynomial. Design methods of the proposed controller are implemented in Java.