• Title/Summary/Keyword: 퍼지분할

Search Result 223, Processing Time 0.025 seconds

Parallel Finite Element Analysis System Based on Domain Decomposition Method Bridges (영역분할법에 기반을 둔 병렬 유한요소해석 시스템)

  • Lee, Joon-Seong;Shioya, Ryuji;Lee, Eun-Chul;Lee, Yang-Chang
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.22 no.1
    • /
    • pp.35-44
    • /
    • 2009
  • This paper describes an application of domain decomposition method for parallel finite element analysis which is required to large scale 3D structural analysis. A parallel finite element method system which adopts a domain decomposition method is developed. Node is generated if its distance from existing node points is similar to the node spacing function at the point. The node spacing function is well controlled by the fuzzy knowledge processing. The Delaunay triangulation method is introduced as a basic tool for element generation. Domain decomposition method using automatic mesh generation system holds great benefits for 3D analyses. Aa parallel numerical algorithm for the finite element analyses, domain decomposition method was combined with an iterative solver, i.e. the conjugate gradient(CG) method where a whole analysis domain is fictitiously divided into a number of subdomains without overlapping. Practical performance of the present system are demonstrated through several examples.

3D Reconstruction Using Segmentation of Myocardial SPECT Images (SPECT 심근영상의 영상분할을 이용한 3차원 재구성)

  • Jung, Jae-En;Lee, Sang-Bock
    • Journal of the Korean Society of Radiology
    • /
    • v.3 no.2
    • /
    • pp.5-10
    • /
    • 2009
  • Myocardial imaging in SPECT (Single Photon Emission Computed tomography) scan of the gamma-ray emitting radiopharmaceuticals to patients after intravenous radiopharmaceuticals evenly spread in the heart region of interest by recording changes in the disease caused by a computer using the PSA test is to diagnose. Containing information on the functional myocardial perfusion imaging is a useful way to examine non-invasive heart disease, but the argument by noise and low resolution of the physical landscape that is difficult to give. For this paper, the level of myocardial imaging by using the three algorithms to split the video into 3-D implementation of the partitioned area to help you read the proposed plan. To solve the difficulty of reading level, interest in using the sheet set, partitioned area of the left ventricle was ranked the partitioned area was modeled as a 3-D images.

  • PDF

Region Segmentation from MR Brain Image Using an Ant Colony Optimization Algorithm (개미 군집 최적화 알고리즘을 이용한 뇌 자기공명 영상의 영역분할)

  • Lee, Myung-Eun;Kim, Soo-Hyung;Lim, Jun-Sik
    • The KIPS Transactions:PartB
    • /
    • v.16B no.3
    • /
    • pp.195-202
    • /
    • 2009
  • In this paper, we propose the regions segmentation method of the white matter and the gray matter for brain MR image by using the ant colony optimization algorithm. Ant Colony Optimization (ACO) is a new meta heuristics algorithm to solve hard combinatorial optimization problem. This algorithm finds the expected pixel for image as the real ant finds the food from nest to food source. Then ants deposit pheromone on the pixels, and the pheromone will affect the motion of next ants. At each iteration step, ants will change their positions in the image according to the transition rule. Finally, we can obtain the segmentation results through analyzing the pheromone distribution in the image. We compared the proposed method with other threshold methods, viz. the Otsu' method, the genetic algorithm, the fuzzy method, and the original ant colony optimization algorithm. From comparison results, the proposed method is more exact than other threshold methods for the segmentation of specific region structures in MR brain image.

Documentation of Printed Hangul Images of the Selected Area by Finger Movement (손가락 이동에 의해 선택된 영역의 인쇄체 한글 영상 문서화)

  • 백승복;손영선
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2002.05a
    • /
    • pp.51-54
    • /
    • 2002
  • 본 논문은 글자 문서를 배경으로 사용자의 손가락 이동에 의하여 일정한 영역을 그린 후, 영역내의 한글영상을 편집 가능한 에디터에 출력하는 시스템을 구현하였다. 영상의 전처리 단계에서는 문서 배경과 손영역을 분리하고 최대 원형 이동법을 이용하여 손의 무게 중심점을 추출한다. 원형 패턴 벡터 알고리즘을 사용하여 손을 인식한 후, 거리 스펙트럼으로 손가락 위치를 찾는다. 손가락의 움직임에 의해 선택되어진 문자 영역을 추출한 후, 한글 자소 간 히스토그램을 이용하여 추출된 문자 이미지 영역에서 문자단위로 분할하고 다양한 크기의 문자를 표준화한다. 퍼지 추론을 적용한 원형 패턴 벡터 알고리즘을 이용하여 표준 패턴문자와 입력문자의 특징벡터를 비교하여 문자를 인식하게 함으로써 사용자가 원하는 영역의 문자들을 수정 가능한 문서로 변환하였다

  • PDF

Fuzzy-Neural Networks by Means of Division of Fuzzy Input Space with Multi-input Variables (다변수 퍼지 입력 공간 분할에 의한 퍼지-뉴럴 네트워크)

  • Park, Ho-Sung;Yoon, Ki-Chan;Oh, Sung-Kwun;Ahn, Tae-Chon
    • Proceedings of the KIEE Conference
    • /
    • 1999.11c
    • /
    • pp.824-826
    • /
    • 1999
  • In this paper, we design an Fuzzy-Neural Networks(FNN) by means of divisions of fuzzy input space with multi-input variables. Fuzzy input space of Yamakawa's FNN is divided by each separated input variable, but that of the proposed FNN is divided by mutually combined input variables. The membership functions of the proposed FNN use both triangular and gaussian membership types. The parameters such as apexes of membership functions, learning rates, momentum coefficients, weighting value, and slope are adjusted using genetic algorithms. Also, an aggregate objective function(performance index) with weighting value is utilized to achieve a sound balance between approximation and generalization abilities of the model. To evaluate the performance of the proposed model, we use the data of sewage treatment process.

  • PDF

Computational Vision and Fuzzy Systems Laboratory (무기본형 기초의 퍼지 클러스터링에 대한 빠른 접근)

  • Hwang, Chul;Lee, Jung-Hoon
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2000.05a
    • /
    • pp.1-4
    • /
    • 2000
  • 본 논문에서는 패턴 데이터(pattern data) 의 분할(partitioning)위하여, 계산량의 단축할 수 있는 효과적인 퍼지 클러스터링 알고리즘(fuzzy clustering algorithm)을 제시한다. 본 논문에 제시된 알고리즘은 두 단계로 수행된다. 첫번째 단계는, 개선된 FCM(Fuzzy C-means)방법에 의해 입력 패턴틀에 대해, 단지 두 번의 반복 수행과정만을 거쳐, 충분히 많은 개수의 초기 클러스터 중 심(center)를 결정한다. 다음 단계에서는, 본 논문에 제시될 클러스터 합치기 알고리즘(cluster merging algorithm)을 통해 각 클러스터의 부피(volume)에 따라 클러스터들을 합치는 과정(merging process)을 하게 된다. 결과적으로 일정한 제한된 개수의 무정형(amorphous)의 클러스터틀의 효과적으로 표현될 수 있다. 본 논문의 마지막에 제시될 실험 결과들은 제시된 방법의 유용성을 보여줄 것이다.

  • PDF

A Study on the Modified FCM Algorithm using Intracluster (내부클러스터를 이용한 개선된 FCM 알고리즘에 관한 연구)

  • Ahn, Kang-Sik;Lee, Dong-Wook;Cho, Seok-Je
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2001.10a
    • /
    • pp.755-758
    • /
    • 2001
  • 본 논문에서는 서로 다른 크기의 클러스터에 대해서 효과적으로 데이터를 분류할 수 있는 내부클러스터를 이용한 개선된 FCM 알고리즘을 제안하였다. 내부클러스터는 평균내부거리 안쪽에 속하는 데이터 집합으로 클러스터의 크기와 밀도에 비례한다. 그러므로 이를 이용한 개선된 FCM 알고리즘은 기존의 FCM 알고리즘이 클러스터 크기가 다를 경우 퍼지분할과 중심탐색을 제대로 하지 못하는 문제점을 개선한 수 있다. 실험을 통하여 개선된 FCM 알고리즘이 분류 엔트로피에 의해 기존의 FCM 알고리즘 보다 더 좋은 결과를 나타냄을 알 수 있었다.

  • PDF

Fuzzy Clustering Based Medical Image Watermarking (퍼지클러스터링 기반 의료 영상 워터마킹)

  • Alamgir, Nyma;Kim, Jong-Myon
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.2 no.7
    • /
    • pp.487-494
    • /
    • 2013
  • Medical image watermarking has received extensive attention as wide security services in the healthcare information system. This paper proposes a blind medical image watermarking approach on the segmented gray-matter (GM) images by utilizing discrete wavelet transform (DWT) and discrete cosine transform (DCT) along with enhanced suppressed fuzzy C-means (EnSFCM) for the optimal selection of sub-blocks position to insert a watermark. Experimental results show that the proposed approach outperforms other methods in terms of peak signal to noise ratio (PSNR) and M-SVD. In addition, the proposed approach shows better robustness than other methods in normalized correlation (NC) values against several attacks, such as noise addition, filtering, JPEG compression, blurring, histogram equalization, and cropping.

The fuzzy transmission rate control method for the fairness bandwidty allocation of ABR servce in ATM networks (AYM망에서 ABR 서비스의 공정 대역폭 할당을 위한 퍼지 전송률 제어 기법)

  • 유재택;김용우;김영한;이광형
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.5
    • /
    • pp.939-948
    • /
    • 1997
  • In this paper, we propose the new rate-based transmission rates control algorithm that allocates the fair band-width for ABR service in ATM network. In the traditional ABR service, bandwidth is allocated with constant rate increment or decrement, but in the proposed algorithm, it is allocated fairly to the connected calls by the fuzzy inference of the available bandwidth. The fuzzy inference uses buffer state and the buffer variant rate as the input variables, and uses the total transmission rate as a output variable. This inference a bandwidth is fairly distributed over all ABR calls in service. By simmulation, we showed that the proposed method improved 0.17% in link effectiveness when RIF, RDF is 1/4, 38.6% when RIF, RDF 1/16, and 82.4% when RIF, RDF 1/32 than that of the traditional EFPCA.

  • PDF

A Robot Soccer Strategy and Tactic Using Fuzzy Logic (퍼지 로직을 적용한 로봇축구 전략 및 전술)

  • Lee, Jeong-Jun;Ji, Dong-Min;Lee, Won-Chang;Kang, Geun-Taek;Joo, Moon G.
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.16 no.1
    • /
    • pp.79-85
    • /
    • 2006
  • This paper presents a strategy and tactic for robot soccer using furry logic mediator that determines robot action depending on the positions and the roles of adjacent two robots. Conventional Q-learning algorithm, where the number of states increases exponentially with the number of robots, is not suitable for a robot soccer system, because it needs so much calculation that processing cannot be accomplished in real time. A modular Q-teaming algorithm reduces a number of states by partitioning the concerned area, where mediator algorithm for cooperation of robots is used additionally. The proposed scheme implements the mediator algorithm among robots by fuzzy logic system, where simple fuzzy rules make the calculation easy and hence proper for robot soccer system. The simulation of MiroSot shows the feasibility of the proposed scheme.