• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.10a
• /
• pp.514-517
• /
• 2017

In solar photovoltaic systems, power generation is greatly affected by the weather conditions, so it is essential to predict solar energy for stable load operation. Therefore, data on weather conditions are needed as inputs to machine learning algorithms for solar energy prediction. In this paper, we use 15 kinds of weather data such as the precipitation accumulated during the 3 hours of the surface, upward and downward longwave radiation average, upward and downward shortwave radiation average, the temperature during the past 3 hours at 2 m above from the ground and temperature from the ground surface as input data to the algorithm. We analyzed the statistical characteristics and correlations of weather data and extracted the downward and upward shortwave radiation averages as a major elements of a feature vector with high correlation of 70% or more with solar energy.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.7 no.6
• /
• pp.1100-1105
• /
• 2006

Severe distortions of colors in the obtained images have made it difficult for color codes to expand their applications. To reduce the effect of color distortions on reading colors, it will be more desirable to statistically process as many pixels in the individual color region as possible, than relying on some regularly sampled pixels. This process may require segmentation, which usually requires edge detection. However, edges in color codes can be disconnected due tovarious distortions such as zipper effect and reflection, to name a few, making segmentation incomplete. Edge linking is also a difficult process. In this paper, a more efficient approach to reducing the effect of color distortions on reading colors, one that excludes precise edge detection for segmentation, was obtained by employing the k-means clustering algorithm. And, in detecting color codes, the properties of both six safe colors and grays were utilized. Experiments were conducted on 144, 4M-pixel, outdoor images. The proposed method resulted in a color-code detection rate of 100% fur the test images, and an average color-reading accuracy of over 99% for the detected codes, while the highest accuracy that could be achieved with an approach employing Canny edge detection was 91.28%.

• Proceedings of the Korean Information Science Society Conference
• /
• 2010.06c
• /
• pp.226-229
• /
• 2010

본 연구에서는 다양한 density profile 특징추출에 기반한 염색체 자동분류방법들의 성능을 비교분석하였다. density profile은 염색체의 밴드패턴을 가장 잘 표현한 특징으로 염색체의 중심축을 구성하는 화소들의 밝기 값을 추출하는 방법이다. 염색체의 밴드패턴은 염색체의 끝단까지를 잘 표현해주어야만 정확한 염색체번호를 확인할 수 있다. 따라서 염색체의 중심축을 추출하여 염색체 끝단까지 확장 처리한 방법에 대한 성능을 확인하였다. 염색체 중심축에 위치한 화소만을 이용한 프로파일은 잡음에 민감할 수 있으므로 이를 해결하기 위하여 염색체의 중심축에 대한 화소 값 대신 주변 밝기 값들에 대한 평균을 이용한 국소평균방법과 중심축의 수직라인 상에 존재하는 화소 값들에 대한 평균을 구한 수직평균방법을 비교하였다. 분류알고리즘은 k-NN을 사용하였고, 실험데이터는 (주)Gendix 로부터 제공받은 임상적으로 정상인 100명(남자 50명, 여자 50명)으로부터 추출한 4600개의 염색체 영상을 훈련데이터와 테스트데이터로 각각 50%씩 랜덤하게 분리하여 실험하였다. 실험결과 중심축을 확장하고 수직평균에 대한 프로파일을 특징으로 추출하여 분류한 경우가 가장 좋은 성능을 보였다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.45 no.4
• /
• pp.84-91
• /
• 2008

This paper suggests the robust localization system in the application of ambient display with multiple ultrasonic range sensors. The ambient display provides the interactive image and video to improve the quality of life, especially for low mobility elders. Due to the limitation of indoor localization, this paper employs linear prediction algorithm to recover the missing information based on AR(Autoregressive) model by using Yule-Walker method. Numerous speculations from prediction error and computation load are considered to decide the optimal length of referred data and order. The results of these analyses demonstrate that the linear prediction algorithm with the 16th order and 50 reference data can improve reliability of the system in average 74.39% up to 97.97% to meet the performance of interactive system.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.2
• /
• pp.450-460
• /
• 2017

T wave is cardiac parameters that represent ventricular repolarization, it is very important to diagnose arrhythmia. Several methods for detecting T wave have been proposed, such as frequency analysis and non-linear approach. However, detection accuracy is at the lower level. This is because of the overlap of the P wave and T wave depending on the heart condition. We propose T wave detection algorithm based on target area extraction through QRS cancellation and moving average. For this purpose, we detected Q, R, S wave from noise-free ECG(electrocardiogram) signal through the preprocessing method. And then we extracted P, T target area by applying decision rule for four PAC(premature atrial contraction) pattern another arrhythmia through moving average and detected T wave using RT interval and threshold of RR interval. The performance of T wave detection is evaluated by using 48 record of MIT-BIH arrhythmia database. The achieved scores indicate the average detection rate of 95.32%.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.49 no.8
• /
• pp.16-21
• /
• 2012

The gyro sensor that made by MEMS process is generated an accumulated error(drift) and escape the zero angle following during calculation of rotate angle. This study propose BACF(Boot Angle Compensation Filter) algorithm for prevent escape zero angle and DCF algorithm for remove accumulated error. DCF algorithm is designed for acquire accurate turn of ratio by remove offset and noise components. BACF algorithm is obtained average offset that removed noise components by recursively calculate. Experimental environment, two-axis gyro sensor and mobile OIS camera mounted control board and 5Hz oscillation of ${\pm}0.5^{\circ}$ for the experiments were carried out. BACF and DCF algorithm is applied and the resulting accumulated error did not occur and exactly zero angle following results were made.

• Journal of The Korean Association of Information Education
• /
• v.16 no.4
• /
• pp.489-502
• /
• 2012

Today computer education puts an emphasis on algorithm education. There are little researches about how to express the given problem in algorithm and how to interpret the expressed algorithm. In this study play-based learning methods dealing with flow chart which is one of the expressing tools of algorithm are developed for lower graders of elementary school. Then we diagnosed the learning possibility of the tool after applying the methods in a classroom environment. There are four types of learning game activities; sequential play, selective play, repetitive play and puzzle play. Puzzle play is a game that students need to reconstruct the learned content to a real flow chart by using flow chart cards. The result of an achievement test after teaching students flow chart showed that the group who took the play-based lesson got their average score with about 7.5% higher than the group who took the ICT-based lesson. Both the groups got their average scroe of more than 9 out of 10 after the lesson. This result shows that flow chart lessons are adaptable for the lower graders of elementary school. It also shows that play-based education can be exceptionally effective.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.3
• /
• pp.636-642
• /
• 2017

In this paper, We proposed a novel hand-gesture recognition algorithm using concentric-circle expanding and tracing. The proposed algorithm determines region of interest of hand image through preprocessing the original image acquired by web-camera and extracts the feature of hand gesture such as the number of stretched fingers, finger tips and finger bases, angle between the fingers which can be used as intuitive method for of human computer interaction. The proposed algorithm also reduces computational complexity compared with raster scan method through referencing only pixels of concentric-circles. The experimental result shows that the 9 hand gestures can be recognized with an average accuracy of 90.7% and an average algorithm execution time is 78ms. The algorithm is confirmed as a feasible way to a useful input method for virtual reality, augmented reality, mixed reality and perceptual interfaces of human computer interaction.

• The KIPS Transactions:PartB
• /
• v.8B no.5
• /
• pp.549-556
• /
• 2001

The general problems of recovering 3D for 2D imagery require the depth information for each picture element form focus. The manual creation of those 3D models is consuming time and cost expensive. The goal in this paper is to simplify the depth estimation algorithm that extracts the depth information of every region from monocular image sequence with camera translation to implement 3D video in realtime. The paper is based on the property that the motion of every point within image which taken from camera translation depends on the depth information. Full-search motion estimation based on block matching algorithm is exploited at first step and ten, motion vectors are compensated for the effect by camera rotation and zooming. We have introduced the algorithm that estimates motion of object by analysis of monocular motion picture and also calculates the averages of frame depth and relative depth of region to the average depth. Simulation results show that the depth of region belongs to a near object or a distant object is in accord with relative depth that human visual system recognizes.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.1
• /
• pp.1-8
• /
• 1999

In order to provide appropriate Quality of Service(QoS) guarantee to each traffic flow in intergrated service networks, an efficient traffic scheduling algorithm as well as resource reservation must be adopted in host and transit routers. In this paper, a new efficient fair queueing algorithm which adopts a linearly increasing virtual time is presented. The proposed algorithm is fair and the maximum and mean delay guaranteed of each flow are less than those of the SCFQ(self clocked fair queueing) algorithm which is one of the most promising traffic scheduling algorithm, while providing low implementation complexity as the SCFQ scheme. And, it has the better isolation provided than SCFQ, which means that each flow is much less influenced by the violating traffic flows provided its allocated bandwidth gurantee. The fairness of the proposed algorithm is proved and simulation results of maximum and mean delay presented.