• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제18권8호
• /
• pp.2082-2102
• /
• 2024

Accurate segmentation of magnetic resonance (MR) images is crucial for providing doctors with effective quantitative information for diagnosis. However, the presence of weak boundaries, intensity inhomogeneity, and noise in the images poses challenges for segmentation models to achieve optimal results. While deep learning models can offer relatively accurate results, the scarcity of labeled medical imaging data increases the risk of overfitting. To tackle this issue, this paper proposes a novel fuzzy c-means (FCM) model that integrates a deep learning approach. To address the limited accuracy of traditional FCM models, which employ Euclidean distance as a distance measure, we introduce a measurement function based on the skewed normal distribution. This function enables us to capture more precise information about the distribution of the image. Additionally, we construct a regularization term based on the Kullback-Leibler (KL) divergence of high-confidence deep learning results. This regularization term helps enhance the final segmentation accuracy of the model. Moreover, we incorporate orthogonal basis functions to estimate the bias field and integrate it into the improved FCM method. This integration allows our method to simultaneously segment the image and estimate the bias field. The experimental results on both simulated and real brain MR images demonstrate the robustness of our method, highlighting its superiority over other advanced segmentation algorithms.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제55권6호
• /
• pp.264-273
• /
• 2006

In this paper, we propose a new architecture of Self-Organizing Fuzzy Polynomial Neural Networks (SOFPNN) by means of consecutive optimization and also discuss its comprehensive design methodology involving mechanisms of genetic optimization. The network is based on a structurally as well as parametrically optimized fuzzy polynomial neurons (FPNs) conducted with the aid of information granulation and genetic algorithms. In structurally identification of FPN, the design procedure applied in the construction of each layer of a SOFPNN deals with its structural optimization involving the selection of preferred nodes (or FPNs) with specific local characteristics and addresses specific aspects of parametric optimization. In addition, the fuzzy rules used in the networks exploit the notion of information granules defined over system's variables and formed through the process of information granulation. That is, we determine the initial location (apexes) of membership functions and initial values of polynomial function being used in the premised and consequence part of the fuzzy rules respectively. This granulation is realized with the aid of the hard c-menas clustering method (HCM). For the parametric identification, we obtained the effective model that the axes of MFs are identified by GA to reflect characteristic of given data. Especially, the genetically dynamic search method is introduced in the identification of parameter. It helps lead to rapidly optimal convergence over a limited region or a boundary condition. To evaluate the performance of the proposed model, the model is experimented with using two time series data(gas furnace process, nonlinear system data, and NOx process data).

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2000년도 추계학술대회 학술발표 논문집
• /
• pp.493-496
• /
• 2000

In this paper, an adaptive neuro-fuzzy controller using the conditional fuzzy c-means(CFCM) methods is proposed. Usually, the number of fuzzy rules exponentially increases by applying the grid partitioning of the input space, in conventional adaptive neuro-fuzzy inference system(ANFIS) approaches. In order to solve this problem, CFCM method is adopted to render the clusters which represent the given input and output data. Finally, we applied the proposed method to the water path temperature control system and obtained a better performance than previous works.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1998년도 The Third Asian Fuzzy Systems Symposium
• /
• pp.619-624
• /
• 1998

This paper presents a new clustering algorithm called FCM algorithm for the design of fuzzy controller. FCM is an extended version of FCM(Fuzzy c-Means) algorithm and can estimate the number of clusters automatically and give membership grades $u_{ik}$ suitable for making fuzzy control rules. This paper also shows an example of its application to the line pursuit control of a car.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2001년도 추계학술대회 학술발표 논문집
• /
• pp.233-236
• /
• 2001

In this paper, we propose a TSK-type fuzzy classifier using PCA(Principal Component Analysis), FCM(Fuzzy C-Means) clustering and hybrid GA(genetic algorithm). First, input data is transformed to reduce correlation among the data components by PCA. FCM clustering is applied to obtain a initial TSK-type fuzzy classifier. Parameter identification is performed by AGA(Adaptive Genetic Algorithm) and RLSE(Recursive Least Square Estimate). we applied the proposed method to Iris data classification problems and obtained a better performance than previous works.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제13권3호
• /
• pp.178-185
• /
• 2013

As computer technology continues to develop, computer networks are now widely used. As a result, there are many new intrusion types appearing and information security is becoming increasingly important. Although there are many kinds of intrusion detection systems deployed to protect our modern networks, we are constantly hearing reports of hackers causing major disruptions. Since existing technologies all have some disadvantages, we utilize algorithms, such as the fuzzy C-means (FCM) and the support vector machine (SVM) algorithms to improve these technologies. Using these two algorithms alone has some disadvantages leading to a low classification accuracy rate. In the case of FCM, self-adaptability is weak, and the algorithm is sensitive to the initial value, vulnerable to the impact of noise and isolated points, and can easily converge to local extrema among other defects. These weaknesses may yield an unsatisfactory detection result with a low detection rate. We use a genetic algorithm (GA) to help resolve these problems. Our experimental results show that the combined GA and FCM algorithm's accuracy rate is approximately 30% higher than that of the standard FCM thereby demonstrating that our approach is substantially more effective.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2009년도 제40회 하계학술대회
• /
• pp.1905_1906
• /
• 2009

본 논문은 데이터의 군집화를 효율적으로 수행하기 위하여 새로운 군집화 알고리즘을 제안한다. 제안되는 군집화 알고리즘은 Fuzzy C-Means (FCM)에 기반을 두는데, FCM 알고리즘은 모든 데이터에 대한 거리에 기본을 둔 멤버쉽을 기초로 하기 때문에 잡음에 약한 제약을 지니고 있었다. 이를 개선하기 위하여, 제안되었던 PCM(Probabilistic C-Means), FPCM(Fuzzy PCM), PFCM(Probabilistic FCM) 등 여러가지 알고리즘이 제안 되었다. 그러나 이들 알고리즘들은 초기 파라미터값 설정과 과다한 계산양에 따른 문제가 증가하였으며, 또한 잡음에 어느 정도 민감한 문제점을 지니고 있었다. 이 논문에서는 잡음에 대해 효과적으로 대응할 수 있는 새로운 군집화 알고리즘을 제안하고, 전통적인 군집화를 위한 Iris 데이터에 대한 실험을 통하여 효용성을 확인하였다.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제12권4호
• /
• pp.270-276
• /
• 2012

With the increase in amount of data and information available on the web, there have been high demands on personalized information retrieval services to provide context-aware services for the web users. This paper proposes a novel dynamic multi-agent context-awareness user profile construction method based on ontology to incorporate concepts and properties to model the user profile. This method comprehensively considers the frequency and the specific of the concept in one document and its corresponding domain ontology to construct the user profile, based on which, a fuzzy c-means clustering method is adopted to cluster the user's interest domain, and a dynamic update policy is adopted to continuously consider the change of the users' interest. The simulation result shows that along with the gradual perfection of the our user profile, our proposed system is better than traditional semantic based retrieval system in terms of the Recall Ratio and Precision Ratio.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2012년도 추계학술발표대회
• /
• pp.367-368
• /
• 2012

Possibilistic c-means (PCM) 알고리즘은 fuzzy c-means (FCM) 의 노이즈 민감성을 극복하기 위해 제안 되었다. 하지만, PCM 은 사용되는 시스템 파라미터들의 초기화와 coincident 클러스터링 문제로 인하여 그 성능이 민감하다. 본 논문에서는 이러한 문제점들을 극복하기 위해 개미군집 알고리즘(Ant colony algorithm)을 이용한 퍼지 클러스터링(fuzzy clustering) 알고리즘을 제안한다. 먼저, 개미군집 알고리즘을 통해 PCM 의 클러스터 개수 및 중심 값 파라미터를 최적화 하고, 미리 분류된 화소 정보를 이용하여 PCM 의 coincident 클러스터링 문제를 해결하였다. 제안된 알고리즘의 효율성을 의료 영상 분할 문제에 적용하여 확인하였다.

• 한국멀티미디어학회논문지
• /
• 제13권1호
• /
• pp.133-142
• /
• 2010

유비쿼터스 기술의 보편화에 따라 유비쿼터스 환경의 보안 취약성을 해결하기 위한 보안기술의 연구가 주목받고 있다. 그러나 현재의 대다수 보안 시스템은 고정된 규칙을 기반으로 하는 것으로서, 유비쿼터스 기반 사용자의 다양한 상황에 제대로 대응하지 못하는 문제점이 있다. 또한 기존의 상황인식 보안 연구는 ACL (Access Control List) 혹은 RBAC (Role-Based Access Control) 계열의 연구가 많이 수행되고 있으나 보안정책의 관리에 대한 오버헤드가 크고, 또한 예상하지 못한 상황에 대한 대응이 어렵다는 문제점을 보이고 있다. 이에 본 논문에서는 FCM (Fuzzy C-Means) 클러스터링 알고리즘과 퍼지 결정트리를 이용하여 다양한 상황을 인식하고 적절한 보안기능을 제공하는 상황인식 보안 서비스를 제안한다. 제안 모델은 기존의 RBAC 계열의 시스템이 가진 고정 규칙에 따른 문제나 충돌 문제, 관리상의 오버헤드를 개선할 수 있음을 확인할 수 있다. 제안 모델은 헬쓰케어 시스템이나 응급구호 시스템 등 상황 인식을 통하여 사용자의 상황에 적합한 서비스를 제공하는 다양한 애플리케이션에 응용 가능할 것으로 기대된다.