• 반도체디스플레이기술학회지
• /
• 제14권3호
• /
• pp.37-43
• /
• 2015

In this paper, a new background subtraction algorithm for video based fence monitoring surveillance systems is proposed. We adopt the sampling based background subtraction technique and focus on the two main issues: handling highly dynamic environment and handling the flickering nature of pulse based IR (infrared) lamp. Natural scenes from fence monitoring system are usually composed of several dynamic entities such as swaying trees, moving water, waves and rain. To deal with such dynamic backgrounds, we utilize the confidence factor for each background value of the input image. For the flickering IR lamp, the original sampling based technique is extended to handle double background models. Experimental results revealed that our method works well in real fence monitoring surveillance systems.

• 전력전자학회논문지
• /
• 제23권6호
• /
• pp.381-388
• /
• 2018

A novel and simple algorithm for accurate calculation of RMS voltage is proposed in a digitally controlled grid-tie inverter system. Given that the actual frequency of grid voltage is continuously changing, the constant sampling frequency cannot be a multiple number of the fundamental frequency. Therefore, the RMS of grid voltage contains periodic oscillations due to the differences in the phase angle of sampled data during calculation. The proposed algorithm precisely calculates and updates the initial phase angle of the first sampled voltage in a half-cycle period using phase-locked loop, which is commonly utilized for phase angle detection in grid-tie inverter systems. The accuracy and dynamic performance of the proposed algorithm are compared with those of other algorithms through various simulations and experiments.

• 한국의학물리학회지:의학물리
• /
• 제27권3호
• /
• pp.105-110
• /
• 2016

Sparse angular sampling has been studied recently owing to its potential to decrease the radiation exposure from computed tomography (CT). In this study, we investigated the analytic reconstruction algorithm in sparse angular sampling using the sinogram interpolation method for improving image quality and computation speed. A prototype of the spectral CT system, which has a 64-pixel Cadmium Zinc Telluride (CZT)-based photon-counting detector, was used. The source-to-detector distance and the source-to-center of rotation distance were 1,200 and 1,015 mm, respectively. Two energy bins (23~33 keV and 34~44 keV) were set to obtain two reconstruction images. We used a PMMA phantom with height and radius of 50.0 mm and 17.5 mm, respectively. The phantom contained iodine, gadolinium, calcification, and lipid. The Feld-kamp-Davis-Kress (FDK) with the sinogram interpolation method and Maximum Likelihood Expectation Maximization (MLEM) algorithm were used to reconstruct the images. We evaluated the signal-to-noise ratio (SNR) of the materials. The SNRs of iodine, calcification, and liquid lipid were increased by 167.03%, 157.93%, and 41.77%, respectively, with the 23~33 keV energy bin using the sinogram interpolation method. The SNRs of iodine, calcification, and liquid state lipid were also increased by 107.01%, 13.58%, and 27.39%, respectively, with the 34~44 keV energy bin using the sinogram interpolation method. Although the FDK algorithm with the sinogram interpolation did not produce better results than the MLEM algorithm, it did result in comparable image quality to that of the MLEM algorithm. We believe that the sinogram interpolation method can be applied in various reconstruction studies using the analytic reconstruction algorithm. Therefore, the sinogram interpolation method can improve the image quality in sparse-angular sampling and be applied to CT applications.

• 지능정보연구
• /
• 제13권3호
• /
• pp.31-45
• /
• 2007

대용량의 데이터 처리에 관한 문제는 데이터 마이닝 내 중요한 이슈 중의 하나이다. 특히 데이터 클러스터링과 같이 컴퓨터 시뮬레이션으로 인한 부하가 큰 경우 더더욱 그러하다. 그러나 대개 이러한 문제는 Random sampling 으로 어느 정도 해결이 가능하다. 문제는 이런 샘플링을 통해서 발생하는 noise의 해결이다. 본 논문에서는 그러한 noise문제를 극복할 수 있도록 설계된 새로운 데이터클러스터링 알고리즘을 소개한다. 기존의 데이터 클러스팅 알고리즘과의 컴퓨터 비교 실험을 통해 본 알고리즘의 우수성을 밝혔으며 아울러 더 나아가 데이터 set의 일부만을 사용한 시뮬레이션 결과를 통해, 해의 정확도와 상관없이 실험 시간 또한 단축되었음을 보여주고 있다.

• Nuclear Engineering and Technology
• /
• 제52권1호
• /
• pp.101-108
• /
• 2020

In order to solve the contradiction between requirements of high sampling rate for acquiring accurate energy information of pulses and large amount of data to be processed timely, the method with an algorithm to correct errors caused by reducing the sampling rate is normally used in front-end read-out system, which is conductive to extract accurate energy information from digitized waveform of pulse. The functions and effects of algorithms, which mainly include polynomial fitting with different fitting times, double exponential function fitting under different sampling modes, and integral area algorithm, are analyzed and evaluated, and some meaningful results is presented in this paper. The algorithm described in the paper has been used preliminarily in a prototype system of Positron Emission Tomography (PET) for heavy-ion cancer therapy facility.

• 한국위성정보통신학회논문지
• /
• 제9권3호
• /
• pp.59-63
• /
• 2014

본 논문에서는 3D 방송의 기본적인 원리를 설명하고 압축 센싱(Compressed Sensing) 기술을 적용하여 3D 방송의 데이터 용량을 줄이는 방식을 제안한다. 샘플링 이론과 압축 센싱 기술의 차이점을 설명하고 개념과 동작원리를 설명한다. 최근 제안된 압축 센싱의 복원 알고리즘인 SS-CoSaMP(Single-Space Compressive Sampling Matched Pursuit) 와 CoSaMP(Compressive Sampling Matched Pursuit)를 소개하고 이를 이용하여 데이터를 압축 복원하여 정확도를 비교한다. 두 알고리즘의 다양한 이미지 복원을 수행하고 계산시간을 비교한다. 결론적으로 낮은 복잡도를 갖는 3D 방송에 적합한 알고리즘을 판단한다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2008년도 춘계학술대회 논문집 전기기기 및 에너지변환시스템부문
• /
• pp.65-67
• /
• 2008

An adaptive response surface method with Latin Hypercube sampling strategy is employed to optimize a magnet pole shape of large scale BLDC motor to minimize the cogging torque. The proposed algorithm consists of the multi-objective Pareto optimization and ($1+{\lambda}$) evolution strategy to find the global optimal points with relatively fewer sampling data. In the adaptive RSM, an adaptive sampling point insertion method is developed utilizing the design sensitivities computed by using finite element method to set a reasonable response surface with a relatively small number of sampling points. The developed algorithm is applied to the shape optimization of PM poles for 6MW BLDC motor.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2008년도 제39회 하계학술대회
• /
• pp.701-702
• /
• 2008

An adaptive response surface method with Latin Hypercube sampling strategy is employed to optimize a magnet pole shape of large scale BLDC motor to minimize the cogging torque. The proposed algorithm consists of the multi-objective Pareto optimization and (1+${\lambda}$) evolution strategy to find the global optimal points with relatively fewer sampling data. In the adaptive RSM, an adaptive sampling point insertion method is developed utilizing the design sensitivities computed by using finite element method to get a reasonable response surface with a relatively small number of sampling points. The developed algorithm is applied to the shape optimization of PM poles for 6 MW BLDC motor, and the cogging torque is reduced to 19% of the initial one.

• Journal of the Korean Data and Information Science Society
• /
• 제15권1호
• /
• pp.227-237
• /
• 2004

In this paper we presented a Bayesian inference approach for estimating the location and scale parameters of the lognormal distribution using iterative Gibbs sampling algorithm. We also presented estimation of location parameter by two non iterative methods, importance sampling and weighted bootstrap assuming scale parameter as known. The estimates by non iterative techniques do not depend on the specification of hyper parameters which is optimal from the Bayesian point of view. The estimates obtained by more sophisticated Gibbs sampler vary slightly with the choices of hyper parameters. The objective of this paper is to illustrate these tools in a simpler setup which may be essential in more complicated situations.

• 산업경영시스템학회지
• /
• 제24권63호
• /
• pp.33-43
• /
• 2001

To estimate the reliability of a large and complex network with a small variance, we propose two dynamic Monte Carlo sampling methods: the sequential minimal cut set (SMCS) and the sequential minimal path set (SMPS) methods. These methods do not require all minimal cut sets or path sets to be given in advance and do not simulate all arcs at each trial, which can decrease the valiance of network reliability. Based on the proposed methods, we develop the importance sampling estimators, the total hazard (or safety) estimator and the hazard (or safety) importance sampling estimator, and compare the performance of these simulation estimators. It is found that these estimators can significantly reduce the variance of the raw simulation estimator and the usual importance sampling estimator. Especially, the SMCS algorithm is very effective in case that the failure probabilities of arcs are low. On the contrary, the SMPS algorithm is effective in case that the success Probabilities of arcs are low.