• Journal of the Korean Institute of Intelligent Systems
• /
• v.7 no.2
• /
• pp.3-15
• /
• 1997

In order to apply fuzzy logic, two major tasks need to be performed: the derivation of fuzzy rules and the determination of membership functions. These tasks are often difficult and time-consuming. This paper presents an algorithmic method for generating membership functions and fuzzy rules applicable to decision-making problems; the method includes an entropy minimization for clustering analog samples. Membership functions are derived by partitioning the variables into desired number of fuzzy terms, and fuzzy rules are obtained using minimum entropy clustering. In the mle derivation process, rule weights are also calculated. Inference and defuzzification for classification problems are also discussed.

• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.109.6-109
• /
• 2002

In this paper, the scheme of fuzzy system construction using GA(genetic algorithm) and FCM(Fuzzy c-means) clustering algorithm is proposed for TSK(Takagi-Sugeno-Kang) type fuzzy system. in the structure identification, input data is trans-formed by PCA(Principal Component Analysis) to reduce the correlation among input data components. And then, the number of fuzzy rule is obtained by a given performance criterion. In the parameter identification, the premise parameters are optimally searched by GA. On the other hand, the consequent parameters are estimated by RLSE(Recursive Least Square Estimate) to reduce the search space. From this, one can systematically obtain optimal parameter and the v..

• Journal of Computing Science and Engineering
• /
• v.10 no.1
• /
• pp.1-8
• /
• 2016

The fuzzy c-means (FCM) is a frequently utilized algorithm at present. Yet, the clustering quality and convergence rate of FCM are determined by the initial cluster centers, and so an improved FCM algorithm based on canopy cluster concept to quickly analyze the dataset has been proposed. Taking advantage of the canopy algorithm for its rapid acquisition of cluster centers, this algorithm regards the cluster results of canopy as the input. In this way, the convergence rate of the FCM algorithm is accelerated. Meanwhile, the MapReduce scheme of the proposed FCM algorithm is designed in a cloud environment. Experimental results demonstrate the hybrid canopy-FCM clustering algorithm processed by MapReduce be endowed with better clustering quality and higher operation speed.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.1
• /
• pp.6-11
• /
• 2005

In this paper, we propose a new fuzzy clustering scheme that optimizes the initial structure and the parameters to improve the performance of a intelligent systems. The proposed method keeps the good properties of clustering, and improves the total systems' performance at the same time, Especially, the proposed algorithm not only keeps robust to change threshold value in the optimization process, but also improves the performance of a system through the process of the self-organizing and the converging intelligent systems in its structure of cluster. In experiments, the superiority of the proposed scheme is presented by comparing its performance with other methods.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.2
• /
• pp.147-157
• /
• 2017

In recent years, Super-pixels have become very popular for use in computer vision applications. Super-pixel algorithm transforms pixels into perceptually feasible regions to reduce stiff features of grid pixel. In particular, super-pixels are useful to depth estimation, skeleton works, body labeling, and feature localization, etc. But, it is not easy to generate a good super-pixel partition for doing these tasks. Especially, super-pixels do not satisfy more meaningful features in view of the gestalt aspects such as non-sum, continuation, closure, perceptual constancy. In this paper, we suggest an advanced algorithm which combines simple linear iterative clustering with fuzzy clustering concepts. Simple linear iterative clustering technique has high adherence to image boundaries, speed, memory efficient than conventional methods. But, it does not suggest good compact and regular property to the super-pixel shapes in context of gestalt aspects. Fuzzy similarity measures provide a reasonable graph in view of bounded size and few neighbors. Thus, more compact and regular pixels are obtained, and can extract locally relevant features. Simulation shows that fuzzy similarity based super-pixel building represents natural features as the manner in which humans decompose images.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.42 no.1
• /
• pp.59-65
• /
• 2005

This paper proposes a novel TSK fuzzy modeling algorithm. Various approaches to fuzzy modeling when noise or outliers exist in the data have been presented but they are approaches to degrade effects of outliers or large noise by using loss function in the cost function mainly. The proposed algorithm is the modified version of noise clustering algorithm, and it adopts the method that does not use loss function, but method to cluster noise in a class. Noise clustering is a prototype-based clustering algorithm and it has no capability to regress. It conducts clustering of data first, and then conducts fuzzy regression. There are many algorithms to obtain parameters of premise and consequent part simultaneously, but they need to adapt the parameters obtained for more accurate approximation. In this paper, fuzzy regression is conducted with clustering by modifying noise clustering algorithm. We propose the algorithm that parameters of the premise part and the consequent part are obtained simultaneously, and the parameters obtained are not needed to adapt. We verify the proposed algorithm through simple examples and evaluate the test results compared with existing algorithms. The proposed algorithm shows robust performance against noise and it is easy to implement.

• Journal of Korea Port Economic Association
• /
• v.31 no.1
• /
• pp.85-110
• /
• 2015

The purpose of this paper is to show the clustering trend and the empirical comparison and to choose the clustering ports for 3 Korean ports(Busan, Incheon and Gwangyang Ports) by using the Fuzzy(Average Index Transformation) DEA and Cross-efficiency models for 38 Asian ports during 11 years(2001-2011) with 4 input variables(birth length, depth, total area, and number of crane) and 1 output variable(container TEU). The main empirical results of this paper are as follows. First, clustering results by using Fuzzy(AIT)DEA show that 3 Korean ports[Busan(56.29%), Incheon(57.96%), and Gwangyang(66.80%) each]can increase the efficiency. Second, according to Cross-efficiency model, Busan(Hongkong, Kobe, Manila, Singapore, and Kaosiung etc.), Incheon(Aquaba, Dammam, Karachi, Mohammad Byin Oasim and Davao), and Gwangyang(Damman, Yokohama, Nogoya, Keelong, Kaosiung, and Bangkok) should be clustered with those ports in parentheses. Third, when both Fuzzy(AIT)DEA and Cross-efficiency models are mixed, the empirical result shows that 3 Korean ports[Busan(71.38%), Incheon(103.89%), and Gwangyang(168.55%) each]can increase the efficiency. The efficiency ranking comparison among the three models by using Wilcoxon Signed-rank Test was matched with the average level of 66%-67%. The policy implication of this paper is that Korean port policy planner should introduce the Fuzzy(AIT)DEA, and Cross-efficiency models with the mixed two models when clustering is needed among the Asian ports for enhancing the efficiency of inputs and outputs. Also, the results of SWOT analysis among the clustering ports should be considered.

• Journal of information and communication convergence engineering
• /
• v.4 no.4
• /
• pp.174-179
• /
• 2006

In this paper we present a text detection method inspired by wavelet packet analysis and improved fuzzy clustering algorithm(IAFC).This approach assumes that the text and non-text regions are considered as two different texture regions. The text detection is achieved by using wavelet packet analysis as a feature analysis. The wavelet packet analysis is a method of wavelet decomposition that offers a richer range of possibilities for document image. From these multi scale features, we adapt the improved fuzzy clustering algorithm based on the unsupervised learning rule. The results show that our text detection method is effective for document images scanned from newspapers and journals.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.4
• /
• pp.336-339
• /
• 2001

The ozone forecasting systems have many problems because the mechanism of the ozone concentration is highly complex, nonlinear, and nonstationary. Especially, the performance of the prediction results in the high-level ozone concentration are not good. This paper describes the modeling method of the ozone prediction system using neuro-fuzzy approaches and fuzzy clustering methods. The dynamic polynomial neural network (DPNN) based upon a typical algorithm of GMDH (group method of data handling) is a useful method for data analysis, the identification of nonlinear complex systems, and prediction of dynamical systems.

• Journal of information and communication convergence engineering
• /
• v.8 no.1
• /
• pp.19-22
• /
• 2010

A finger language helping hearing impaired people in communication A sign language helping hearing impaired people in communication is not popular to ordinary healthy people. In this paper, we propose a method for real-time sign language recognition from a vision system using color information and fuzzy clustering system. We use YCbCr color model and canny mask to decide the position of hands and the boundary lines. After extracting regions of two hands by applying 8-directional contour tracking algorithm and morphological information, the system uses FCM in classifying sign language signals. In experiment, the proposed method is proven to be sufficiently efficient.