• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.10 no.6
• /
• pp.40-52
• /
• 2011

This paper develops a traffic condition decision algorithm to improve the reliability of traffic information on urban streets. This research is reestablished the criteria of qualitative traffic condition categorization and proposed a new qualitative traffic condition decision types and decision measures. The developed algorithm can be classified into 9 types for qualitative traffic condition in consideration of historical time series of speed changes and traffic patterns. The performance of the algorithm is verified through individual matching analysis using the radar detector data in Ansan city. The results of this paper is expected to help promotion of the traffic information processing system, real-time traffic flow monitoring and management, use of historical traffic information, etc.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.3
• /
• pp.419-424
• /
• 2015

The Decision-directed (DD) algorithm is known to be not effective to initialize a blind equalizer in the channel conditions when the eye diagram of received signals is completely closed because it can not open the eye diagram enough. In this paper, we propose a new error to replace the error of the conventional DD algorithm. The new DD error is the conventional DD error scaled by the modulus of symbol decision, new DD algorithm using this error is effective to open the closed eye diagram in early stage of equalization unlike the conventional DD. The new DD algorithm appling the new error is showed excellent convergence characteristics as compared to the CMA widely used in blind initialization, particularly, is useful for equalization of signals having multimodulus. The performance of the new DD algorithm is verified through the simulation for the higher-order QAM signals.

• 한국데이터정보과학회:학술대회논문집
• /
• 2003.10a
• /
• pp.239-247
• /
• 2003

Decision tree algorithms are used extensively for data mining in many domains such as retail target marketing, fraud dection, data reduction and variable screening, etc. CHAID(Chi-square Automatic Interaction Detector), is an exploratory method used to study the relationship between a dependent variable and a series of predictor variables. In this paper we propose and CHAID algorithm by cube-based sampling and explore CHAID algorithm in view of accuracy and speed by the number of variables.

• Journal of Industrial Technology
• /
• v.18
• /
• pp.309-316
• /
• 1998

The airbag system for automobile is one of the most important passenger protect system. And it is very important whether to inflate or not, and when the airbag will be inflated. This paper focuses on how to find airbag triggering time after the automobile is crashed. In this paper we present an algorithm for airbag triggering time decision and compare the triggering time with the time by the other algorithm.

• The Journal of Korean Association of Computer Education
• /
• v.8 no.6
• /
• pp.103-111
• /
• 2005

This paper presents a novel automated threshold-decision algorithm that uses the mean and standard-deviation values obtained from the difference values of consecutive frames. At first, the calculation of difference values is obtained by the weighted ${\chi}^2$-test algorithm which was modified by joining color histogram to ${\chi}^2$-test algorithm. The weighted ${\chi}^2$-test algorithm can subdivide the difference values by imposing weights according to NTSC standard. In the first step, the proposed automatic threshold-decision algorithm calculates the mean and standard-deviation value from the total difference values, and then subtracts the mean value from the each difference values. In the next step, the same process is performed on the remained difference values, and lastly, the threshold is detected from the mean when the standard deviation has a maximum value. The proposed method is tested on various video sources and, in the experimental results, it is shown that the proposed method efficiently estimates the thresholds and reliably detects scene changes.

• Journal of Korea Multimedia Society
• /
• v.16 no.7
• /
• pp.810-819
• /
• 2013

FCM (Fuzzy C-Means) clustering algorithm, a typical split-based clustering algorithm, has been successfully applied to the various fields. Nonetheless, the FCM clustering algorithm has some problems, such as high sensitivity to noise and local data, the different clustering result from the intuitive grasp, and the setting of initial round and the number of clusters. To address these problems, in this paper, we determine fuzzy numbers which project the FCM clustering result on the axis with the specific attribute. And we propose a model that the fuzzy numbers apply to FDT (Fuzzy Decision Tree). This model improves the two problems of FCM clustering algorithm such as elevated sensitivity to data, and the difference of the clustering result from the intuitional decision. And also, this paper compares the effect of the proposed model and the result of FCM clustering algorithm through the experiment using real traffic and rainfall data. The experimental results indicate that the proposed model provides more reliable results by the sensitivity relief for data. And we can see that it has improved on the concordance of FCM clustering result with the intuitive expectation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.7
• /
• pp.1802-1814
• /
• 2012

In order to guide users to select the most optimal access network in heterogeneous wireless networks, a network selection algorithm is proposed which is designed based on multi-objective discrete particle swarm optimization (Multi-Objective Discrete Particle Swarm Optimization, MODPSO). The proposed algorithm keeps fast convergence speed and strong adaptability features of the particle swarm optimization. In addition, it updates an elite set to achieve multi-objective decision-making. Meanwhile, a mutation operator is adopted to make the algorithm converge to the global optimal. Simulation results show that compared to the single-objective algorithm, the proposed algorithm can obtain the optimal combination performance and take into account both the network state and the user preferences.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.3
• /
• pp.392-400
• /
• 2008

This paper proposes a novel optimization algorithm inspired by bacteria behavior patterns for foraging. Most bacteria can trace attractant chemical molecules for foraging. This tracing capability of bacteria called chemotaxis might be optimized for foraging because it has been evolved for few millenniums. From this observation, we developed a new optimization algorithm based on the chemotaxis of bacteria in this paper. We first define behavior and decision rules based on the behavior patterns of bacteria and then devise an optimization algorithm with these behavior and decision rules. Generally bacteria have a quorum sensing mechanism that makes it possible to effectively forage, but we leave its implementation as a further work for simplicity. Thereby, we call our algorithm a simple bacteria cooperative optimization (BCO) algorithm. Our simple BCO is tested with four function optimization problems on various' parameters of the algorithm. It was found from experiments that the simple BCO can be a good framework for optimization.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.1
• /
• pp.85-91
• /
• 2014

This paper relates with the VSDA (Variable stepsize Square contour Decision directed Algorithm) adaptive equalization algorithm that is used for the minimization of the intersymbol interference due to the distortion which occurs in the time dispersive channel for the transmission of 16-QAM signal.. In the conventional SCA, it is possible to compensates the amplitude and phase in the received signal that are mixed with the intersymbol interference by the constellatin dependent constant by using the 2nd order statistics of the transmitted signal. But in the VSDA, it is possible to the increasing the equalization performance by adding the concept of distance adjusted approach for constellation matching and the cost function of decision directed. We compare the performance of VSDA and SCA algorithm by the computer simulation. For this, the equalizer output signal constellation, residual isi, maximum distortion and MSE were used in the performace index. As a result of computer simulation, the VSDA algorithm has better than the SCA in convergence speed, but it gives nearly same equalization performance in other index.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.9
• /
• pp.2005-2013
• /
• 1997

The MCMA adaptive blind equalization algorithm has a excellent phase correction capabilities in addition to channel amplitude equalization, but has an inevitable error by mismatching between the original constellation points in arriving at the perfect equalization since unique new type constellation points are used as desired response instead of original constellation points and follows the slow convergence speed of CMA. In this paper, We propose an adaptive blind equalization algorithm with dual-mode, which has decision regions. Inside the decision regions, it operates as considering the moudlus of original data symbol point and outside the decision region, it operates as considerin gthe modulus of new constellation points. The proposed algorithm has a lower error in the steady state and rapid convergence speed toward steady state using the original data symbol points instead of new constellation points in the decision regions. From computer simulation, we confirm that the propposed algorithm has the performance superiority in residual ISI, convergence speed compared with the cnventional adaptive blind equalization algorithms, CMA, MCMA, Stop-and-Go algorithm.