• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.30 no.9 s.252
• /
• pp.1116-1123
• /
• 2006

In this study, the effective method for reliability estimation is proposed using tow-staged kriging metamodel and genetic algorithm. Kriging metamodel can be determined by appropriate sampling range and the number of sampling points. The first kriging metamodel is made based on the proposed sampling points. The advanced f'=rst order reliability method is applied to the first kriging metamodel to determine the reliability and most probable failure point(MPFP) approximately. Then, the second kriging metamodel is constructed using additional sampling points near the MPFP. These points are selected using genetic algorithm that have the maximum mean squared error. The Monte-Carlo simulation is applied to the second kriging metamodel to estimate the reliability. The proposed method is applied to numerical examples and the results are almost equal to the reference reliability.

• Journal of the Semiconductor & Display Technology
• /
• v.18 no.3
• /
• pp.1-6
• /
• 2019

Foreground/background segmentation in video sequences is often one of the first tasks in machine vision applications, making it a critical part of the system. In this paper, we present an improved sample-based technique that provides robust background image as well as segmentation mask. The conventional multiple interval sampling (MIS) algorithm have suffer from the unbalance of computation time per frame and the rapid change of confidence factor of background pixel. To balance the computation amount, a random-based pixel update scheme is proposed and a spatial and temporal smoothing technique is adopted to increase reliability of the confidence factor. The proposed method allows the sampling queue to have more dispersed data in time and space, and provides more continuous and reliable confidence factor. Experimental results revealed that our method works well to estimate stable background image and the foreground mask.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.10
• /
• pp.4940-4957
• /
• 2019

Compared with the localization methods in the static sensor networks, node localization in dynamic sensor networks is more complicated due to the mobility of the nodes. Dynamic Sampling Localization Algorithm Based on Virtual Anchor (DSLA) is proposed in this paper to localize the unknown nodes in dynamic sensor networks. Firstly, DSLA algorithm predicts the speed and movement direction of nodes to determine a sector sampling area. Secondly, a method of calculating the sampling quantity with the size of the sampling area dynamically changing is proposed in this paper. Lastly, the virtual anchor node, i.e., the unknown node that got the preliminary possible area (PLA), assists the other unknown nodes to reduce their PLAs. The last PLA is regarded as a filtering condition to filter out the conflicting sample points quickly. In this way, the filtered sample is close to its real coordinates. The simulation results show that the DSLA algorithm can greatly improve the positioning performance when ensuring the execution time is shorter and the localization coverage rate is higher. The localization error of the DSLA algorithm can be dropped to about 20%.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.7
• /
• pp.3057-3075
• /
• 2020

End-to-end network delay plays an vital role in distributed services. This delay is used to measure QoS (Quality-of-Service). It would be beneficial to know all node-pair delay information, but unfortunately it is not feasible in practice because the use of active probing will cause a quadratic growth in overhead. Alternatively, using the measured network delay to estimate the unknown network delay is an economical method. In this paper, we adopt the state-of-the-art matrix completion technology to better estimate the network delay from limited measurements. Although the number of measurements required for an exact matrix completion is theoretically bounded, it is practically less helpful. Therefore, we propose an online adaptive sampling algorithm to measure network delay in which statistical leverage scores are used to select potential matrix elements. The basic principle behind is to sample the elements with larger leverage scores to keep the traits of important rows or columns in the matrix. The amount of samples is adaptively decided by a proposed stopping condition. Simulation results based on real delay matrix show that compared with the traditional sampling algorithm, our proposed sampling algorithm can provide better performance (smaller estimation error and less convergence pressure) at a lower cost (fewer samples and shorter processing time).

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.24 no.12
• /
• pp.138-146
• /
• 2010

On wind turbine generators, the speed and volume of the wind affect the turbine angle speed which finally determines the output level of the electric power. However it is very difficult to forecast correctly the future power output and quality based on previous fixed sampling methods. This paper proposes a variable sampling method based on Buneman frequency estimation algorithm to reflect the variations of the frequency and amplitude on wind power outputs. The proposed method is also verified through the performance test by comparing with the results from previous fixed sampling methods and the real measurement data.

• 한국데이터정보과학회:학술대회논문집
• /
• 2004.04a
• /
• pp.39-50
• /
• 2004

The decision tree approach is most useful in classification problems and to divide the search space into rectangular regions. Decision tree algorithms are used extensively for data mining in many domains such as retail target marketing, fraud dection, data reduction and variable screening, category merging, etc. CHAID(Chi-square Automatic Interaction Detector) uses the chi-squired statistic to determine splitting and is an exploratory method used to study the relationship between a dependent variable and a series of predictor variables. In this paper we propose CHAID algorithm by cube-based proportional sampling and explore CHAID algorithm in view of accuracy and speed by the number of variables.

• Journal of the Korean Data and Information Science Society
• /
• v.15 no.4
• /
• pp.803-816
• /
• 2004

The decision tree approach is most useful in classification problems and to divide the search space into rectangular regions. Decision tree algorithms are used extensively for data mining in many domains such as retail target marketing, fraud dection, data reduction and variable screening, category merging, etc. CHAID uses the chi-squired statistic to determine splitting and is an exploratory method used to study the relationship between a dependent variable and a series of predictor variables. In this paper we propose CHAID algorithm by cube-based proportional sampling and explore CHAID algorithm in view of accuracy and speed by the number of variables.

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

In this paper we propose a human body tracking method for application of smartphones. The conventional human body tracking method is divided into a sensor-based method and a vision-based method. The sensor-based methods have a weakness in that tracking accuracy is low due to cumulative error of position information. The vision-based method has no cumulative error, but it requires reduction of the computational complexity for application of smartphone. In this paper we use the improved HOG algorithm as a human body tracking method for application of smartphone. The improved HOG algorithm is implemented through downsampling and frame sampling. Gaussian pyramid is applied for downsampling, and uniform sampling is applied for frame sampling. We measured the proposed algorithm on two devices, four resolutions, and four frame sampling intervals. We derive the best detection rate among downsampling and frame sampling parameters that can be applied in realtime.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.1
• /
• pp.18-28
• /
• 1993

Processes in the real-time distributed control systems share a network medium to exchange their data. Performance of feedback control loops in the real-time distributed control systems is subject to the network-induced delays from sensor to controller, and from controller to actuator. The network-induced delays are directly dependent upon the data sampling times of control components which share a network medium. In this study, an algorithm of determining data sampling times is developed using the "window concept". where the sampling datafrom the control components dynamically share a limited number of windows. The scheduling algorithm is validated through the aimulation experiments.

• Proceedings of the KIEE Conference
• /
• 2006.04a
• /
• pp.321-323
• /
• 2006

The IEEE 802.15.4 uses a CSMA/CA algorithm on access of media. The CSMA/CA algorithm does Random Backoff before the data is transmitted to avoid collisions. The random backoff is a kind of unavoidable delays and introduces the side effect of energy consumptions. To cope with those problems we propose a new media access algorithm, the Priority Based Ordered Media Access (PBOMA) algorithm, which uses different IFSs. The PBOMA algorithm uses Sampling Rate and Beacon Interval to get a different access probability(or IFS). The access probability is higher, the IFS is shorter. Note that The transfer of urgent data uses tone signal to transmit it immediately. The proposed algorithm is expected to reduce the energy consumptions and the delay.