• Journal of the Korea Society of Computer and Information
• /
• v.16 no.1
• /
• pp.61-69
• /
• 2011

This paper proposes a new algorithm that improve color component of compensated image using Retinex method for back-light image. A back-light image has two regions, one of the region is too bright and the other one is too dark. If an back-light image is improved contrast using Retinex method, it loses color information in the part of brightness of the image. In order to make up loss information, proposed algorithm adds color components from original image. The histogram can be divided three parts that brightness, darkness, midway using K-mean (k=3) algorithm. For the brightness, it is used color information of the original image. For the darkness, it is converted using by Retinex method. The midway region is mixed between original image and Retinex result image in the ratio of histogram. The ratio is determined by distance from dark area. The proposed algorithm was tested on nature back-light images to evaluate performance, and the experimental result shows that proposed algorithm is more robust than original Retinex algorithm.

• Journal of Korean Society of Transportation
• /
• v.17 no.3
• /
• pp.97-116
• /
• 1999

The growing demand for the real time traffic information is bringing about the category and number of traffic collection mechanism in the era of ITS. There are, however, two problems in making data into information using various traffic data. First, the information making process of making data into the representative information, for each traffic collection mechanism, for the specified analysis periods is required. Second, the integration process of fusing each representative information into "the information" for each link out of each source is also required. That is, both data reduction and/or data to information process and information fusion are required. This article is focusing on the development of information fusing algorithm based on voting technique, fuzzy regression, and, Bayesian pooling technique for estimating the dynamic link travel time of networks. The proposed algorithm has been validated using the field experiment data out of GPS probes and detectors over the roadways and the estimated link travel time from the algorithm is proved to be more useful than the mere arithmetic mean from each traffic source.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1618-1622
• /
• 2004

In this paper, the linearly interpolated PRC(Pseudo Range Correction) regenerating algorithm was applied to improve the DGPS(Differential Global Positioning System) positioning accuracy at user's spot by using the various PRC information obtained from multi-DGPS reference stations. The PRC information of each GPS satellite is not varying rapidly; it is possible to assume that the variation of PRC information of each GPS satellite is linear. So the linearly interpolated PRC regenerating algorithm can be applied to improve the DGPS positioning accuracy at user's spot by using the various PRC information obtained from multi-DGPS reference stations. To test the performance of the linearly interpolated PRC regenerating algorithm, maritime DGPS reference stations' PRC data was used in RTCM format. 11 maritime DGPS reference stations are in service providing DGPS information to public since 1999. Two set of 3 DGPS reference stations are selected to compare the performance of the linearly interpolated PRC regenerating algorithm. The DGPS positioning accuracy was dramatically improved about 40%. Linearly interpolated PRC regenerating algorithm adopted multi-channel DGPS receiver will be developed in near future.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.10
• /
• pp.4864-4882
• /
• 2016

In this work, we consider the optimization problem of minimizing energy consumption for real-time multicast over wireless multi-hop networks. Previously, a distributed primal-dual subgradient algorithm was used for finding a solution to the optimization problem. However, the traditional subgradient algorithms have drawbacks in terms of i) sensitivity to iteration parameters; ii) need for saving previous iteration results for computing the optimization results at the current iteration. To overcome these drawbacks, using a joint network coding and scheduling optimization framework, we propose a novel distributed primal-dual Random Deflected Subgradient (RDS) algorithm for solving the optimization problem. Furthermore, we derive the corresponding recursive formulas for the proposed RDS algorithm, which are useful for practical applications. In comparison with the traditional subgradient algorithms, the illustrated performance results show that the proposed RDS algorithm can achieve an improved optimal solution. Moreover, the proposed algorithm is stable and robust against the choice of parameter values used in the algorithm.

• ETRI Journal
• /
• v.43 no.1
• /
• pp.120-132
• /
• 2021

A frequency diverse array (FDA) multiple-input multiple-output (MIMO) radar employs a small frequency increment across transmit elements to produce an angle-range-dependent beampattern for target angle and range detection. The joint angle and range estimation problem is a trilinear model. The traditional trilinear alternating least square (TALS) algorithm involves high computational load due to excessive iterations. We propose a fast-convergence trilinear decomposition (FC-TD) algorithm to jointly estimate FDA-MIMO radar target angle and range. We first use a propagator method to obtain coarse angle and range estimates in the data domain. Next, the coarse estimates are used as initialized parameters instead of the traditional TALS algorithm random initialization to reduce iterations and accelerate convergence. Finally, fine angle and range estimates are derived and automatically paired. Compared to the traditional TALS algorithm, the proposed FC-TD algorithm has lower computational complexity with no estimation performance degradation. Moreover, Cramer-Rao bounds are presented and simulation results are provided to validate the proposed FC-TD algorithm effectiveness.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.4
• /
• pp.1128-1145
• /
• 2022

Owing to the rapid development of information science, data analysis based on machine learning has become an interdisciplinary and strategic area. Marine predators algorithm (MPA) is a novel metaheuristic algorithm inspired by the foraging strategies of marine organisms. Considering the randomness of these strategies, an improved algorithm called co-evolutionary cultural mechanism-based marine predators algorithm (CECMPA) is proposed. Through this mechanism, search agents in different spaces can share knowledge and experience to improve the performance of the native algorithm. More specifically, CECMPA has a higher probability of avoiding local optimum and can search the global optimum quickly. In this paper, it is the first to use CECMPA to perform feature subset selection and optimize hyperparameters in support vector machine (SVM) simultaneously. For performance evaluation the proposed method, it is tested on twelve datasets from the university of California Irvine (UCI) repository. Moreover, the coronavirus disease 2019 (COVID-19) can be a real-world application and is spreading in many countries. CECMPA is also applied to a COVID-19 dataset. The experimental results and statistical analysis demonstrate that CECMPA is superior to other compared methods in the literature in terms of several evaluation metrics. The proposed method has strong competitive abilities and promising prospects.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.4
• /
• pp.1095-1109
• /
• 2022

Along with the popularity of GPS system and smart cell phone, trajectories of pedestrians or vehicles are recorded at any time. The great amount of works had been carried out in order to discover traffic paradigms or other regular patterns buried in the huge trajectory dataset. The core of the mining algorithm is how to evaluate the similarity, that is, the "distance", between trajectories appropriately, then the mining results will be accordance to the reality. Euclidean distance is commonly used in the lots of existed algorithms to measure the similarity, however, the trend of trajectories is usually ignored during the measurement. In this paper, a novel segment transform distance (STD) algorithm is proposed, in which a rule system of line segment transformation is established. The similarity of two-line segments is quantified by the cost of line segment transformation. Further, an improvement of STD, named ST-DTW, is advanced with the use of the traditional method dynamic time warping algorithm (DTW), accelerating the speed of calculating STD. The experimental results show that the error rate of ST-DTW algorithm is 53.97%, which is lower than that of the LCSS algorithm. Besides, all the weights of factors could be adjusted dynamically, making the algorithm suitable for various kinds of applications.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.2
• /
• pp.335-352
• /
• 2023

When solving multi-objective optimization problems, the blindness of the evolution direction of the population gradually emerges with the increase in the number of objectives, and there are also problems of convergence and diversity that are difficult to balance. The many- objective optimization problem makes some classic multi-objective optimization algorithms face challenges due to the huge objective space. The sine cosine algorithm is a new type of natural simulation optimization algorithm, which uses the sine and cosine mathematical model to solve the optimization problem. In this paper, a knee-driven many-objective sine-cosine algorithm (MaSCA-KD) is proposed. First, the Latin hypercube population initialization strategy is used to generate the initial population, in order to ensure that the population is evenly distributed in the decision space. Secondly, special points in the population, such as nadir point and knee points, are adopted to increase selection pressure and guide population evolution. In the process of environmental selection, the diversity of the population is promoted through diversity criteria. Through the above strategies, the balance of population convergence and diversity is achieved. Experimental research on the WFG series of benchmark problems shows that the MaSCA-KD algorithm has a certain degree of competitiveness compared with the existing algorithms. The algorithm has good performance and can be used as an alternative tool for many-objective optimization problems.

• Journal of information and communication convergence engineering
• /
• v.9 no.6
• /
• pp.657-660
• /
• 2011

Differential detection algorithm for DBO-CSS based on maximum signal energy detection (MSED) using viterbi algorithm is proposed. In order to mitigate SNR degradation caused by differential decoding, a modified viterbi algorithm with so called correlation metric (CM) in every state is proposed. It is shown that the performance gain of the proposed algorithm when compared with that of the conventional differential detection with the block decoding algorithm is about 2.5dB at BER = $10^{-5}$.

• Journal of the Korean Data and Information Science Society
• /
• v.16 no.3
• /
• pp.549-556
• /
• 2005

A hard-type centroids in the conventional clustering algorithm such as k-modes algorithm cannot keep the uncertainty inherently in data sets as long as possible before actual clustering(decision) are made. Therefore, we propose the k-populations algorithm to extend clustering ability and to heed the data characteristics. This k-population algorithm as found to give markedly better clustering results through various experiments.