• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.42 no.4 s.304
• /
• pp.43-50
• /
• 2005

This paper proposes a new pattern recognition system combining the new adaptive feature weighting based on the genetic algorithm and the modified KNN(K Nearest-Neighbor) rules. The new feature weighting proposed herein avoids the overfitting and finds the Proper feature weighting value by determining the middle value of weights using GA. New GA operators are introduced to obtain the high performance of the system. Moreover, a class dependent feature weighting strategy is employed. Whilst the classical methods use the same feature space for all classes, the Proposed method uses a different feature space for each class. The KNN rule is modified to estimate the class of test pattern using adaptive feature space. Experiments were performed with the unconstrained handwritten numeral database of Concordia University in Canada to show the performance of the proposed method.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.3
• /
• pp.107-113
• /
• 2015

This paper presents a polynomial time algorithm to the minimum cardinality feedback edge set and minimum weight feedback edge set problems. The algorithm makes use of the property wherein the sum of the minimum spanning tree edge set and the minimum feedback edge set equals a given graph's edge set. In other words, the minimum feedback edge set is inherently a complementary set of the former. The proposed algorithm, in pursuit of the optimal solution, modifies the minimum spanning tree finding Kruskal's algorithm so as to arrange the weight of edges in a descending order and to assign cycle-deficient edges to the maximum spanning tree edge set MXST and cycle-containing edges to the feedback edge set FES. This algorithm runs with linear time complexity, whose execution time corresponds to the number of edges of the graph. When extensively tested on various undirected graphs both with and without the weighed edge, the proposed algorithm has obtained the optimal solutions with 100% success and accuracy.

• Journal of Wetlands Research
• /
• v.11 no.3
• /
• pp.21-35
• /
• 2009

To propose a sound direction for river rehabilitation plan, the naturalness of the river must be evaluated. In this study, the conventional methods for evaluating the naturalness of rivers proposed by Park, et al. has been improved to estimate the weights for each items subject to assessment and applied adequate Analytic Hierarchy Process (AHP). To estimate the weights, survey was conducted on a group of 83 experts in Civil and Environmental Engineering with a customized questionnaire. The results of the survey were generalized and used to estimate the weights of each items. Among the 14 evaluation items that have been generated as a result of the estimation, a total of 7 weight values such as water quality, variations in water flow, vegetation around minor bed, curve of waterway, vegetation around flood plain, variety in minor bed width, and diversity of stream bed materials appeared to be high. The improved method for evaluating the naturalness of rivers was applied to Hoe-ya River, where the method has successfully discriminated the sections having low degree of naturalness. The proposed assessment method can be employed as a criterion to determine the business zones in the river environment maintenance projects.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.3
• /
• pp.629-635
• /
• 2017

In this paper, we proposed a nonlinear synthesis filter for noise reduction to reduce the effects of Gaussian noise and impulse noise. When the centralization of the local mask is judged to be Gaussian noise by the noise judgment, the weight value of the weight filter are applied differently according to the spatial weight filter and the pixel change by using the sample variance in the local mask. And if it is determined as the impulse noise, we proposed an algorithm that applies different weights of local histogram weight filter and standard median filter according to noise density of mask. In order to evaluate the performance of the proposed filter algorithm, we used PSNR(peak signal to noise ratio) and compared existing methods and proposed filter algorithm in the mixed noise environment with Gaussian noise, impulsive noise, and two noises mixed.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.11
• /
• pp.2029-2036
• /
• 2017

Currently, the demand for multimedia services is increasing with the rapid development of the digital age. Image data is corrupted by various noises and typical noise is mainly AWGN, salt and pepper noise and the complex noise that these two noises are mixed. Therefore, in this paper, the noise is processed by classifying AWGN and salt and pepper noise through noise judgment. In the case of AWGN, the outputs of spatial weighted filter and pixel change weighted filter are composed and processed, and the composite weights are applied differently according to the standard deviation of the local mask. In the case of salt and pepper noise, cubic spline interpolation and local histogram weighted filters are composed and processed. This study suggested the multiple image restoration filter algorithm which is processed by applying different composite weights according to the salt and pepper noise density of the local mask.

• Journal of Environmental Impact Assessment
• /
• v.26 no.3
• /
• pp.171-180
• /
• 2017

The vulnerability analysis of climate change driven disaster has been used as institutional framework for the urban policies of disaster prevention since 2012. However, some problems have occurred due to the structure of vulnerability analysis, such as overweighted variables and duplicated application of variables of similar meaning. The goal of this study is to examine the differences of results between the method of current guideline and the method of weight equalization. For this, we examines the current structural framework of the vulnerability analysis, and performs empirical analysis. As a result, the extent and magnitude of vulnerability showed different spatial patterns depending on the weighting methods. Standardized weighting method relatively represented wider vulnerable areas compared to the pre-existing method which follows the current instruction manual. To apply the results of vulnerability analysis to urban planning process for disaster prevention, this study suggests that the reliability of the results should be ensured by improving analytical framework and detailed review of the results.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.42 no.6
• /
• pp.63-74
• /
• 2005

In Electronic Commerce, the latest most of the personalized recommender systems have applied to the collaborative filtering technique. This method calculates the weight of similarity among users who have a similar preference degree in order to predict and recommend the item which hits to propensity of users. In this case, we commonly use Pearson Correlation Coefficient. However, this method is feasible to calculate a correlation if only there are the items that two users evaluated a preference degree in common. Accordingly, the accuracy of prediction falls. The weight of similarity can affect not only the case which predicts the item which hits to propensity of users, but also the performance of the personalized recommender system. In this study, we verify the improvement of the prediction accuracy through an experiment after observing the rule of the weight of similarity applying Vector similarity, Entropy, Inverse user frequency, and Default voting of Information Retrieval field. The result shows that the method combining the weight of similarity using the Entropy with Default voting got the most efficient performance.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.3
• /
• pp.561-566
• /
• 2011

In EPCglobal Class-1 Gen-2 RFID system, a slot-count selection algorithm has been proposed to determine the slot-count size depending on the status of reply slot. In the slot-count selection algorithm of Gen-2, the slot-count value is increased or decreased by the weight C, which is identical and independent of the slot status. It has an advantage that the algorithm is simple, but it is difficult to maintain an optimal slot-count size. Therefore, in this paper, we propose an adaptive slot-count selection algorithm, which applies the parameter C differently based on the result of tag replies. Through simulations, it is demonstrated that the collision rate for the proposed scheme is about 42% and 65% lower than the schemes proposed by Wang and Gen-2. Therefore, the adaptive slot-count selection algorithm achieves faster tag identification time compared with the existing algorithms due to the low collision rate.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.11
• /
• pp.153-161
• /
• 2011

As the problem of GOSST building belongs to NP compete domain, heuristics for the problem ask for immense amount execution time and computations in large scale inputs. In this paper, we propose an efficient mechanism for GOSST construction using space locality PTAS. For 40,000 input nodes with maximum weight 100, the proposed space locality PTAS GOSST with 16 unit areas can reduce about 4.00% of connection cost and 89.26% of execution time less than weighted minimum spanning tree method. Though the proposed method increases 0.03% of connection cost more, but cuts down 96.39% of execution time less than approximate GOSST method (SGOSST) without PTAS. Therefore the proposed space locality PTAS GOSST mechanism can work moderately well to many useful applications where a greate number of weighted inputs should be connected in short time with approximate minimum connection cost.

• Journal of Korea Multimedia Society
• /
• v.13 no.11
• /
• pp.1575-1585
• /
• 2010

It is very important to forecast a back resource of a software development effort at the early stage of development life cycle for successful project processing, and it is carried out through software size estimation. The recent trend of software size estimation method is focused on the user's value such as FPA. We measure the actual development effort through case study and calculate CFP directly according to the cosmic-ffp manual V.3.0. in this paper. We also propose the software development effort estimation model by using the produced data. COSMIC-FFP does not use weights of necessary function elements, and so it has disadvantage in estimating sizes. This paper proposes the estimation model to estimate the precision software size by using system complexity as weight.