• Journal of the Korea institute for structural maintenance and inspection
• /
• v.20 no.4
• /
• pp.1-8
• /
• 2016

Recently, buildings tend to be large size, complex shape and functional. As the size of buildings is becoming massive, the need for structural health monitoring(SHM) technique is ever-increasing. Various SHM techniques have been studied for buildings which have different dynamic characteristics and are influenced by various external loads. Generally, the visual inspection and non-destructive test for an accessible point of structures are performed by experts. But nowadays, the system is required which is online measurement and detect risk elements automatically without blind spots on structures. In this study, in order to consider the response of non-linear structures, proposed a signal feature extraction and the adaptive threshold setting algorithm utilized to determine the abnormal behavior by using statistical methods such as control chart, root mean square deviation, generalized extremely distribution. And the performance of that was validated by using the acceleration response of structures during earthquakes measuring system of forced vibration tests and actual operation.

• Journal of IKEEE
• /
• v.23 no.1
• /
• pp.127-133
• /
• 2019

Electric power demand forecasting is one of the important research areas for future smart grid introduction. However, It is difficult to predict because it is affected by many external factors. Traditional methods of forecasting power demand have been limited in making accurate prediction because they use raw power data. In this paper, a probability-based CRBM is proposed to solve the problem of electric power demand prediction using raw power data. The stochastic model is suitable to capture the probabilistic characteristics of electric power data. In order to compare the mid-term power demand forecasting performance of the proposed model, we compared the performance with Recurrent Neural Network(RNN). Performance comparison using electric power data provided by the University of Massachusetts showed that the proposed algorithm results in better performance in mid-term energy demand forecasting.

• Journal of IKEEE
• /
• v.24 no.1
• /
• pp.147-153
• /
• 2020

Conventional lane detection algorithms have problems in that the detection rate is lowered in road environments having a large change in curvature and illumination. The probabilistic Hough transform method has low lane detection rate since it exploits edges and restrictive angles. On the other hand, the method using a sliding window can detect a curved lane as the lane is detected by dividing the image into windows. However, the detection rate of this method is affected by road slopes because it uses affine transformation. In order to detect lanes robustly and avoid obstacles, we propose driving assist system using semantic segmentation based on deep learning. The architecture for segmentation is SegNet based on VGG-16. The semantic image segmentation feature can be used to calculate safety space and predict collisions so that we control a vehicle using adaptive-MPC to avoid objects and keep lanes. Simulation results with CARLA show that the proposed algorithm detects lanes robustly and avoids unknown obstacles in front of vehicle.

• Nuclear Medicine and Molecular Imaging
• /
• v.43 no.5
• /
• pp.459-467
• /
• 2009

Purpose: The maximum likelihood-expectation maximization (ML-EM) is the statistical reconstruction algorithm derived from probabilistic model of the emission and detection processes. Although the ML-EM has many advantages in accuracy and utility, the use of the ML-EM is limited due to the computational burden of iterating processing on a CPU (central processing unit). In this study, we developed a parallel computing technique on GPU (graphic processing unit) for ML-EM algorithm. Materials and Methods: Using Geforce 9800 GTX+ graphic card and CUDA (compute unified device architecture) the projection and backprojection in ML-EM algorithm were parallelized by NVIDIA's technology. The time delay on computations for projection, errors between measured and estimated data and backprojection in an iteration were measured. Total time included the latency in data transmission between RAM and GPU memory. Results: The total computation time of the CPU- and GPU-based ML-EM with 32 iterations were 3.83 and 0.26 see, respectively. In this case, the computing speed was improved about 15 times on GPU. When the number of iterations increased into 1024, the CPU- and GPU-based computing took totally 18 min and 8 see, respectively. The improvement was about 135 times and was caused by delay on CPU-based computing after certain iterations. On the other hand, the GPU-based computation provided very small variation on time delay per iteration due to use of shared memory. Conclusion: The GPU-based parallel computation for ML-EM improved significantly the computing speed and stability. The developed GPU-based ML-EM algorithm could be easily modified for some other imaging geometries.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.7
• /
• pp.479-490
• /
• 2014

A lower extremity exoskeleton is a robot device that attaches to the lower limbs of the human body to augment or assist with the walking ability of the wearer. In order to improve the wearer's walking ability, the robot senses the wearer's walking locomotion and classifies it into a gait-phase state, after which it drives the appropriate robot motions for each state using its actuators. This paper presents a method by which the robot senses the wearer's locomotion along with a novel classification algorithm which classifies the sensed data as a gait-phase state. The robot determines its control mode using this gait-phase information. If erroneous information is delivered, the robot will fail to improve the walking ability or will bring some discomfort to the wearer. Therefore, it is necessary for the algorithm constantly to classify the correct gait-phase information. However, our device for sensing a human's locomotion has very sensitive characteristics sufficient for it to detect small movements. With only simple logic like a threshold-based classification, it is difficult to deliver the correct information continually. In order to overcome this and provide correct information in a timely manner, a probabilistic gait-phase classification algorithm is proposed. Experimental results demonstrate that the proposed algorithm offers excellent accuracy.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.37 no.2
• /
• pp.21-30
• /
• 2000

If there exists a model that calculates the proper candidate position whenever the game of Go is in progress, it can be used for setting up the prototype of the candidate generation algorithm without using case-based reasoning. In this paper, we analyze Go through combinatorial game theory and on the basis of probability matrix (PM) showing the difference of the territory of the black and the white. We design and implement a candidate generation system(CGS) to find the candidates at a situation in Go. CGS designed in this paper can compute Influence power, safety, probability value(PV), and PM and then generate candidate positions for a present scene, once a stone is played at a scene. The basic strategy generates five candidates for the Present scene, and then chooses one with the highest PV. CGS generates the candidate which emphasizes more defence tactics than attack ones. In the opening game of computer Go, we can know that CGS which has no pattern is somewhat superior to NEMESIS which has the Joseki pattern.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.25 no.3
• /
• pp.267-275
• /
• 2012

In this study, crack growth in a center-cracked plate is predicted under mode I variable amplitude loading, and the result is validated by experiment. Huang's model is employed to describe crack growth with acceleration and retardation due to the variable loading effect. Experiment is conducted with Al6016-T6 plate, in which the load is applied, and crack length is measured periodically. Particle Filter algorithm, which is based on the Bayesian approach, is used to estimate model parameters from the experimental data, and predict the crack growth of the future in the probabilistic way. The prediction is validated by the run-to-failure results, from which it is observed that the method predicts well the unique behavior of crack retardation and the more data are used, the closer prediction we get to the actual run-to-failure data.

• Korean Journal of Agricultural and Forest Meteorology
• /
• v.23 no.4
• /
• pp.391-404
• /
• 2021

This study developed a long-term prediction model for the potential yield of garlic based on a genetic algorithm (GA) by utilizing global climate reanalysis data. The GA is used for digging the inherent signals from global climate reanalysis data which are both directly and indirectly connected with the garlic yield potential. Our results indicate that both deterministic and probabilistic forecasts reasonably capture the inter-annual variability of crop yields with temporal correlation coefficients significant at 99% confidence level and superior categorical forecast skill with a hit rate of 93.3% for 2 × 2 and 73.3% for 3 × 3 contingency tables. Furthermore, the GA method, which considers linear and non-linear relationships between predictors and predictands, shows superiority of forecast skill in terms of both stability and skill scores compared with linear method. Since our result can predict the potential yield before the start of farming, it is expected to help establish a long-term plan to stabilize the demand and price of agricultural products and prepare countermeasures for possible problems in advance.

• Journal of Internet Computing and Services
• /
• v.14 no.5
• /
• pp.1-10
• /
• 2013

RFID(Radio Frequency Identification) system is non-contact identification technology. A basic RFID system consists of a reader, and a set of tags. RFID tags can be divided into active and passive tags. Active tags with power source allows their own operation execution and passive tags are small and low-cost. So passive tags are more suitable for distribution industry than active tags. A reader processes the information receiving from tags. RFID system achieves a fast identification of multiple tags using radio frequency. RFID systems has been applied into a variety of fields such as distribution, logistics, transportation, inventory management, access control, finance and etc. To encourage the introduction of RFID systems, several problems (price, size, power consumption, security) should be resolved. In this paper, we proposed an algorithm to significantly alleviate the collision problem caused by simultaneous responses of multiple tags. In the RFID systems, in anti-collision schemes, there are three methods: probabilistic, deterministic, and hybrid. In this paper, we introduce ALOHA-based protocol as a probabilistic method, and Tree-based protocol as a deterministic one. In Aloha-based protocols, time is divided into multiple slots. Tags randomly select their own IDs and transmit it. But Aloha-based protocol cannot guarantee that all tags are identified because they are probabilistic methods. In contrast, Tree-based protocols guarantee that a reader identifies all tags within the transmission range of the reader. In Tree-based protocols, a reader sends a query, and tags respond it with their own IDs. When a reader sends a query and two or more tags respond, a collision occurs. Then the reader makes and sends a new query. Frequent collisions make the identification performance degrade. Therefore, to identify tags quickly, it is necessary to reduce collisions efficiently. Each RFID tag has an ID of 96bit EPC(Electronic Product Code). The tags in a company or manufacturer have similar tag IDs with the same prefix. Unnecessary collisions occur while identifying multiple tags using Query Tree protocol. It results in growth of query-responses and idle time, which the identification time significantly increases. To solve this problem, Collision Tree protocol and M-ary Query Tree protocol have been proposed. However, in Collision Tree protocol and Query Tree protocol, only one bit is identified during one query-response. And, when similar tag IDs exist, M-ary Query Tree Protocol generates unnecessary query-responses. In this paper, we propose Adaptive M-ary Query Tree protocol that improves the identification performance using m-bit recognition, collision information of tag IDs, and prediction technique. We compare our proposed scheme with other Tree-based protocols under the same conditions. We show that our proposed scheme outperforms others in terms of identification time and identification efficiency.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2005.06a
• /
• pp.1034-1039
• /
• 2005

SALM(Simultaneous localization and mapping) and AI(Artificial intelligence) have been active research areas in robotics for two decades. In particular, localization is one of the most important tasks in mobile robot research. Until now expensive sensors such as a laser sensor have been used for mobile robot localization. Currently, the proliferation of RFID technology is advancing rapidly, while RFID reader devices, antennas and tags are becoming increasingly smaller and cheaper. So, in this paper, the smart floor using passive RFID tags is proposed and, passive RFID tags are mainly used for identifying location of the mobile robot in the smart floor. We discuss a number of challenges related to this approach, such as tag distribution (density and structure), typing and clustering. In the smart floor using RFID tags, the localization error results from the sensing area of the RFID reader, because the reader just knows whether the tag is in the sensing range of the sensor and, until now, there is no study to estimate the heading of mobile robot using RFID tags. So, in this paper, two algorithms are suggested to. The Markov localization method is used to reduce the location(X,Y) error and the Kalman Filter method is used to estimate the heading($\theta$) of mobile robot. The algorithms which are based on Markov localization require high computing power, so we suggest fast Markov localization algorithm. Finally we applied these algorithms our personal robot CMR-P3. And we show the possibility of our probability approach using the cheap sensors such as odometers and RFID tags for mobile robot localization in the smart floor