• Journal of the Korean Wood Science and Technology
• /
• v.37 no.1
• /
• pp.37-47
• /
• 2009

For the inspection of wood, machine vision is the most common automated inspection method used at present. It is required to sort wood products by grade and to locate surface defects prior to cut-up. Many different sensing methods have been applied to inspection of wood including optical, ultrasonic, X-ray sensing in the wood industry. Nowadays the scanning system mainly employs CCD line-scan camera to meet the needs of accurate detection of lumber defects and real-time image processing. But this system needs exact feeding system and low deviation of lumber thickness. In this study low cost CCD area sensor was used for the development of image processing system for lumber being fed. When domestic red pine being fed on the conveyer belt, lumber images of irregular term of captured area were acquired because belt conveyor slipped between belt and roller. To overcome incorrect image merging by the unstable feeding speed of belt conveyor, it was applied template matching algorithm which was a measure of the similarity between the pattern of current image and the next one. Feeding the lumber over 13.8 m/min, general area sensor generates unreadable image pattern by the motion blur. The red channel of RGB filter showed a good performance for removing background of the green conveyor belt from merged image. Threshold value reduction method that was a image-based thresholding algorithm performed well for knot detection.

• Journal of Internet Computing and Services
• /
• v.10 no.5
• /
• pp.79-93
• /
• 2009

For developing the location based service which is individualized and specialized according to the characteristic of the users, the spatio-temporal pattern mining for extracting the meaningful and useful patterns among the various patterns of the mobile object on the spatio-temporal area is needed. Thus, in this paper, as the practical application toward the development of the location based service in which it is able to apply to the real life through the pattern mining from the huge historical data of mobile object, we are proposed STOMP(using Frequency of sequence and Weight) that is the new mining method for extracting the patterns with spatial and temporal constraint based on the problems of mining the optimal moving pattern which are defined in STOMP(F)[25]. Proposed method is the pattern mining method compositively using weighted value(weights) (a distance, the time, a cost, and etc) for our previous research(STOMP(F)[25]) that it uses only the pattern frequent occurrence. As to, it is the method determining the moving pattern in which the pattern frequent occurrence is above special threshold and the weight is most a little bit required among moving patterns of the object as the optimal path. And also, it can search the optimal path more accurate and faster than existing methods($A^*$, Dijkstra algorithm) or with only using pattern frequent occurrence due to less accesses to nodes by using the heuristic moving history.

• Journal of Radiation Protection and Research
• /
• v.37 no.2
• /
• pp.96-102
• /
• 2012

International Commission on Radiological Protection (ICRP) has revised its recommendations concerning the tissue reaction to ionizing radiation in accordance with consideration of the detriment arising from non-cancer effects of radiation on health based on recent epidemiological basis. Particularly, for the lens of the eye, the threshold in absorbed dose revised to be 0.5 Gy, for occupational exposure in planned exposure situation the commission recommended "An equivalent dose limit for the lens of the eye of 20 mSv in a year, averaged over defined periods of 5 years, with no single year exceeding 50 mSv." To monitor the radiation exposure of radiation worker, TLD is typically provided and the lens of eye dose can be assessed by run of dose calculation algorithm with TL element response data. This study is to assess equivalent dose of the lens of eye using the Harshaw TLD system and its two different dose calculation algorithms. The result provides the Harshaw TLD system showed the assessment of the lens of eye dose with 48.84% error range.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.2
• /
• pp.67-74
• /
• 2008

This paper proposes two peak-windowing algorithms for peak-to-average power reduction(PAPR) of orthogonal frequency division multiple access(OFDMA) downlink systems. The Proposed algorithms mitigate the effect of excessive suppression due to successive peaks or relatively high peaks of the signal. First, multi-stage peak windowing algorithm is proposed, which exploits multiple threshold of target PAPR in order to step down the peaks gradually. Secondary, variable-length peak windowing algorithm is proposed, which adapts the window length with respect to the existence of successive peaks within a half of window length. Therefore, the proposed method reduces the distortion of signal amplitude caused by window overlapping. The proposed algorithms outperform the conventional peak windowing with the aid of window-length adaptation or sequential peak power reduction. Simulation results show the efficiency of the proposed algorithms over OFDMA downlink systems, especially WiBro systems.

• The KIPS Transactions:PartB
• /
• v.16B no.2
• /
• pp.131-140
• /
• 2009

This paper presents a new algorithm to the segmentation of the FISH images. First, for segmentation of the cell nuclei from background, a threshold is estimated by using the gaussian mixture model and maximizing the likelihood function of gray value of cell images. After nuclei segmentation, overlapped nuclei and isolated nuclei need to be classified for exact nuclei analysis. For nuclei classification, this paper extracted the morphological features of the nuclei such as compactness, smoothness and moments from training data. Three probability density functions are generated from these features and they are applied to the proposed Bayesian networks as evidences. After nuclei classification, segmenting of overlapped nuclei into isolated nuclei is necessary. This paper first performs intensity gradient transform and watershed algorithm to segment overlapped nuclei. Then proposed stepwise merging strategy is applied to merge several fragments in major nucleus. The experimental results using FISH images show that our system can indeed improve segmentation performance compared to previous researches, since we performed nuclei classification before separating overlapped nuclei.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.9
• /
• pp.361-368
• /
• 2014

The LPR(License plate recognition) system has been developed to efficient control for complex traffic environment and currently be used in many places. However, because of light, noise, background changes, environmental changes, damaged plate, it only works limited environment, so it is difficult to use in real-time. This paper presents a heuristic segmentation algorithm for robust to noise and illumination changes and introduce a real-time license plate recognition system using it. In first step, We detect the plate utilized Haar-like feature and Adaboost. This method is possible to rapid detection used integral image and cascade structure. Second step, we determine the type of license plate with adaptive histogram equalization, bilateral filtering for denoise and segment accurate character based on adaptive threshold, pixel projection and associated with the prior knowledge. The last step is character recognition that used histogram of oriented gradients (HOG) and multi-layer perceptron(MLP) for number recognition and support vector machine(SVM) for number and Korean character classifier respectively. The experimental results show license plate detection rate of 94.29%, license plate false alarm rate of 2.94%. In character segmentation method, character hit rate is 97.23% and character false alarm rate is 1.37%. And in character recognition, the average character recognition rate is 98.38%. Total average running time in our proposed method is 140ms. It is possible to be real-time system with efficiency and robustness.

• Journal of Internet Computing and Services
• /
• v.15 no.2
• /
• pp.19-31
• /
• 2014

In this paper, a parallel backoff delay procedure on multiple IEEE 802.15.4 channels and a channel searching method considering the frequency spectrum of WiFi traffic are studied for IEEE 802.15.4 nodes to avoid the interference from WiFi traffic. In order to search the channels being occupied by WiFi traffic, we analyzed the methods measuring the powers of adjacent channels simultaneously, checking the duration of measured power levels greater than a threshold, and finding the same periodicity of sampled RSSI data as the beacon frame by signal processing. In an wireless channel overlapped with IEEE 802.11 network, the operation of CSMA-CA algorithm for IEEE 802.15.4 nodes is explained. A method to execute a parallel backoff procedure on multiples IEEE 802.15.4 channels by an IEEE 802.15.4 device is proposed with the description of its algorithm. When we analyze the data measured by the experimental system implemented with the proposed method, it is observed that medium access delay times increase at the same time in the associated IEEE 802.15.4 channels that are adjacent each other during the generation of WiFi traffic. A channel evaluation function to decide the interference from other traffic on an IEEE 802.15.4 channel is defined. A channel searching method considering the channel evaluations on the adjacent channels together is proposed in order to search the IEEE 802.15.4 channels interfered by WiFi, and the experimental results show that it correctly finds the channels interfered by WiFi traffic.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.320-323
• /
• 2014

Today is going with the advancement of intelligent transportation systems and traffic environment and helping to provide safe and convenient service through a mobile device work with the popularization of the vehicle black box. The traffic flow by a variety of causes is constantly changing, it is often unable to prepare the driver, depending on external factors can not be controlled by the power of the public, leading to a major accident. The system needs to pass the real-time weather data in the inter-operator to prevent this. The proposed detection algorithm weather information delivered real-time weather information for this paper. The weather condition is detected by using the contrast between the histogram of the motion of the wiper and the clear day algorithm. In general, the wiper is worked in extreme weather conditions that will have a value different contrast due to rain or snow. Situation was considered clear, snowy conditions, such as using it on a rainy situation. First, designated as ROI (Region Of Interest) of the minimum area that can be detected in order to reduce the amount of calculation for the wiper, the wiper, which was detected through the operation of the threshold Thresholding the brightness of the vehicle wiper. In addition, we distinguish the value of each meteorological situation by using contrast. Results was obtained to 80% for the snow conditions, a rainy situation.

• The Journal of Bigdata
• /
• v.8 no.1
• /
• pp.99-109
• /
• 2023

Recently, not only in Korea but also around the world, we have been experiencing constant disasters such as typhoons, wildfires, and heavy rains. The property damage caused by typhoons and heavy rain in South Korea alone has exceeded 1 trillion won. These disasters have resulted in significant loss of life and property damage, and the recovery process will also take a considerable amount of time. In addition, the government's contingency funds are insufficient for the current situation. To prevent and effectively respond to these issues, it is necessary to collect and analyze accurate data in real-time. However, delays and data loss can occur depending on the environment where the sensors are located, the status of the communication network, and the receiving servers. In this paper, we propose a two-stage hybrid situation analysis and prediction algorithm that can accurately analyze even in such communication network conditions. In the first step, data on river and stream levels are collected, filtered, and refined from diverse sensors of different types and stored in a bigdata. An AI rule-based inference algorithm is applied to analyze the crisis alert levels. If the rainfall exceeds a certain threshold, but it remains below the desired level of interest, the second step of deep learning image analysis is performed to determine the final crisis alert level.

• Journal of Intelligence and Information Systems
• /
• v.22 no.3
• /
• pp.113-127
• /
• 2016

Among the techniques for recommendation, collaborative filtering (CF) is commonly recognized to be the most effective for implementing recommender systems. Until now, CF has been popularly studied and adopted in both academic and real-world applications. The basic idea of CF is to create recommendation results by finding correlations between users of a recommendation system. CF system compares users based on how similar they are, and recommend products to users by using other like-minded people's results of evaluation for each product. Thus, it is very important to compute evaluation similarities among users in CF because the recommendation quality depends on it. Typical CF uses user's explicit numeric ratings of items (i.e. quantitative information) when computing the similarities among users in CF. In other words, user's numeric ratings have been a sole source of user preference information in traditional CF. However, user ratings are unable to fully reflect user's actual preferences from time to time. According to several studies, users may more actively accommodate recommendation of reliable others when purchasing goods. Thus, trust relationship can be regarded as the informative source for identifying user's preference with accuracy. Under this background, we propose a new hybrid recommender system that fuses CF and social network analysis (SNA). The proposed system adopts the recommendation algorithm that additionally reflect the result analyzed by SNA. In detail, our proposed system is based on conventional memory-based CF, but it is designed to use both user's numeric ratings and trust relationship information between users when calculating user similarities. For this, our system creates and uses not only user-item rating matrix, but also user-to-user trust network. As the methods for calculating user similarity between users, we proposed two alternatives - one is algorithm calculating the degree of similarity between users by utilizing in-degree and out-degree centrality, which are the indices representing the central location in the social network. We named these approaches as 'Trust CF - All' and 'Trust CF - Conditional'. The other alternative is the algorithm reflecting a neighbor's score higher when a target user trusts the neighbor directly or indirectly. The direct or indirect trust relationship can be identified by searching trust network of users. In this study, we call this approach 'Trust CF - Search'. To validate the applicability of the proposed system, we used experimental data provided by LibRec that crawled from the entire FilmTrust website. It consists of ratings of movies and trust relationship network indicating who to trust between users. The experimental system was implemented using Microsoft Visual Basic for Applications (VBA) and UCINET 6. To examine the effectiveness of the proposed system, we compared the performance of our proposed method with one of conventional CF system. The performances of recommender system were evaluated by using average MAE (mean absolute error). The analysis results confirmed that in case of applying without conditions the in-degree centrality index of trusted network of users(i.e. Trust CF - All), the accuracy (MAE = 0.565134) was lower than conventional CF (MAE = 0.564966). And, in case of applying the in-degree centrality index only to the users with the out-degree centrality above a certain threshold value(i.e. Trust CF - Conditional), the proposed system improved the accuracy a little (MAE = 0.564909) compared to traditional CF. However, the algorithm searching based on the trusted network of users (i.e. Trust CF - Search) was found to show the best performance (MAE = 0.564846). And the result from paired samples t-test presented that Trust CF - Search outperformed conventional CF with 10% statistical significance level. Our study sheds a light on the application of user's trust relationship network information for facilitating electronic commerce by recommending proper items to users.