• 한국철도학회논문집
• /
• 제7권1호
• /
• pp.9-13
• /
• 2004

Railway passenger demand forecasts may be used directly, or as inputs to other optimization models use them to produce estimates of other activities. The optimization models require demand forecasts at the most detailed level. In this environment exponential smoothing forecasting methods such as Holt-Winters are appropriate because it is simple and inexpensive in terms of computation. There are several initialization methods for Holt-Winters Model. The purpose of this paper is to compare the initialization methods for Holt-Winters model.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1988년도 전기.전자공학 학술대회 논문집
• /
• pp.7-9
• /
• 1988

K-means iteration method is generally used for creating the templates in speaker-independent isolated-word recognition system. In this paper the initialization method of initial centers is proposed. The concepts are sorting and trace segmentation. All the tokens are sorted and segmented by trace segmentation so that initial centers are decided. The performance of this method is evaluated by isolated-word recognition of Korean digits. The highest recognition rate is 97.6%.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권1호
• /
• pp.123-145
• /
• 2017

Due to the increasing demand for spectrum resources, cognitive radio networks and dynamic spectrum access draw a lot of research into efficiently utilizing limited spectrum resources. To set up cluster-based CR ad-hoc common channels, conventional methods require a relatively long time to successfully exchange the initialization messages. In this paper, we propose a fast and reliable common channel initialization protocol for CR ad-hoc networks. In the proposed method, the cluster head sequentially broadcasts a system activation signal through its available channels with a predetermined correlation pattern. To detect the cluster head's broadcasting channels and to join the cluster, each member node implements fast Fourier transform (FFT) and computes autocorrelation of an FFT bin sequence for each available channel of the member node. This is compared to the predetermined reference pattern. The join request and channel decision procedures are also presented in this paper. In a simulation study, the performance of the proposed method is evaluated.

• 한국컴퓨터정보학회논문지
• /
• 제22권8호
• /
• pp.15-23
• /
• 2017

In this paper, the block reweighting and global offset initialization methods are proposed to complement the improved IRLMS algorithm which is the effective algorithm in registration based SBNUC algorithm. Proposed block weighting method reweights the error map whose abnormal data are excluded. The global offset initialization method compensates the global nonuniformity initially. The ordinary registration based SBNUC algorithm is hard to compensate global nonuniformity because of low scene motion. We employ the proposed methods to improved IRLMS algorithm, and apply it to real-world infrared raw image stream. The result shows that new implementation provides 3.5~4.0dB higher PSNR and convergence speed 1.5 faster then the improved IRLMS algorithm.

• 조명전기설비학회논문지
• /
• 제21권4호
• /
• pp.11-18
• /
• 2007

A moving object detection algorithm for surveillance video is here proposed which employs background initialization based on two-stage median filtering and a background updating method based on state transition diagram. In the background initialization, the spatiotemporal similarity is measured in the subinterval. From the accumulated difference between the base frame and the other frames in a subinterval, the regions affected by moving objects are located. The median is applied over the subsequence in the subinterval in which regions share similarity. The outputs from each subinterval are filtered by a two-stage median filter. The background of every frame is updated by the suggested state transition diagram The object is detected by the difference between the current frame and the updated background. The proposed method showed good results even for busy, crowded sequences which included moving objects from the first frame.

• 응용통계연구
• /
• 제32권5호
• /
• pp.693-702
• /
• 2019

딥러닝은 대용량의 데이터의 분류 및 예측하는 방법으로 각광받고 있다. 데이터의 양이 많아지면서 신경망의 구조는 더 깊어 지고 있다. 이때 초기값이 지나치게 클 경우 층이 깊어 질수록 활성화 함수의 기울기가 매우 작아지는 포화(Saturation)현상이 발생한다. 이러한 포화현상은 가중치의 학습능력을 저하시키는 현상을 발생시키기 때문에 초기값의 중요성이 커지고 있다.이런 포화현상 문제를 해결하기 위해 Glorot과 Bengio (2010)과 He 등 (2015) 층과 층 사이에 데이터가 다양하게 흘러야 효율적인 신경망학습이 가능하고 주장했다. 데이터가 다양하게 흐르기 위해서는 각 층의 출력에 대한 분산과 입력에 대한 분산이 동일해야 한다고 제안했다. Glorot과 Bengio (2010)과 He 등 (2015)는 각 층별 활성화 값의 분산이 같다고 가정해 초기값을 설정하였다. 본 논문에서는 절단된 코쉬 분포와 절단된 정규분포를 활용하여 초기값을 설정하는 방안을 제안한다. 출력에 대한 분산과 입력에 대한 분산의 값을 동일하게 맞춰주고 그 값이 절단된 확률분포의 분산과 같게 적용함으로써 큰 초기값이 나오는 걸 제한하고 0에 가까운 값이 나오도록 분포를 조정하였다. 제안된 방법은 MNIST 데이터와 CIFAR-10 데이터를 DNN과 CNN 모델에 각각 적용하여 실험함으로써 기존의 초기값 설정방법보다 모델의 성능을 좋게 한다는 것을 보였다.

• 한국멀티미디어학회논문지
• /
• 제21권12호
• /
• pp.1396-1406
• /
• 2018

Lane detection is a key function in developing autonomous vehicle technology. In this paper, we propose a lane marker detection algorithm robust to environmental variation targeting low cost embedded computing devices. The proposed algorithm consists of two phases: initialization phase which is slow but has relatively higher accuracy; and the tracking phase which is fast and has the reliable performance in a limited condition. The initialization phase detects lane markers using a set of filters utilizing the various features of lane markers. The tracking phase uses Kalman filter to accelerate the lane marker detection processing. In a tracking phase, we measure the reliability of the detection results and switch it to initialization phase if the confidence level becomes below a threshold. By combining the initialization and tracking phases we achieved high accuracy and acceptable computing speed even under a low cost computing resources in which we cannot use the computing intensive algorithm such as deep learning approach. Experimental results show that the detection accuracy is about 95% on average and the processing speed is about 20 frames per second with Raspberry Pi 3 which is low cost device.

• Journal of Mechanical Science and Technology
• /
• 제20권2호
• /
• pp.177-184
• /
• 2006

An orbital design method of the formation initialization based on the relative orbital element method is presented. It firstly constructed the relative motion equation of the satellite formation flying in terms of the leader and followers' orbital elements. Then the equation was simplified when the orbit eccentricity of the leader satellite was small. And according to the satellites' mission, a general design method for the relative trajectory was proposed. The advantage of this method is that one can get a very simple analytical formula of each follower satellite's orbital elements when the orbital eccentricity of the leader satellite is zero. The simulation results show that the method is effective.

• 한국원자력학회:학술대회논문집
• /
• 한국원자력학회 1996년도 춘계학술발표회논문집(1)
• /
• pp.88-93
• /
• 1996

The initial condition should be consistent with real reactor core state for the simulation of the core transient. The initial xenon distribution, which cad not be measured in the core, has a significant effect on the transient with xenon dynamics of PWR. In the simulation of the transient stating from non-equilibrium xenon state, the accurate initialization of the non-equilibrium xenon distribution is essential to predict the core transient behavior. In this study, the xenon initialization method to predict the core transient more accurately was developed through the first-order perturbation theory of the relationship between simulated power and measured power distribution and verified by the application of the simulation for a startup test of Yonggwang Unit 3.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 하계종합학술대회논문집
• /
• pp.887-890
• /
• 1998

We present a method for initialization of asynchronous circuits using binary decision space representation. From state transition graph(STG) which is given as a specification a circuit, the BDD is generated to solve the state space explosion problem which is caused by concurrecy of STG. We first step, we construct the necessary informaton as a form of K-map from BDD, then find an initial state on the K-map by assignment of don't care assignment.