• Title/Summary/Keyword: 퍼지 변환 함수

Search Result 63, Processing Time 0.019 seconds

Development of Algorithm for Analyzing Priority Area of Forest Fire Surveillance Using Viewshed Analysis (가시권 분석을 이용한 산불감시 우선지역 선정 방안)

  • Lee, Byung-Doo;Ryu, Gye-Sun;Kim, Sun-Young;Kim, Kyong-Ha;Lee, Myung-Boa
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.14 no.3
    • /
    • pp.126-135
    • /
    • 2011
  • In this study, the algorithm for priority area of forest fire surveillance was developed to enhance the effectiveness of fire detection. The high priority surveillance area for forest fire detection was defined as the area with not only low value of viewshed analysis of the lookouts and detection cameras but also high fire occurrence probability. To build the priority map, fuzzy function and map algebra were used. The analysis results of Bonghwa-gun, Gyeongbuk Province, showed that the surveillance priority of central and southern area is higher than north area. This algorithm could be used in the allocation of fire prevention resources and selection of suitable point for new fire detection system.

Context Dependent Fusion with Support Vector Machines (Support Vector Machine을 이용한 문맥 민감형 융합)

  • Heo, Gyeongyong
    • Journal of the Korea Society of Computer and Information
    • /
    • v.18 no.7
    • /
    • pp.37-45
    • /
    • 2013
  • Context dependent fusion (CDF) is a fusion algorithm that combines multiple outputs from different classifiers to achieve better performance. CDF tries to divide the problem context into several homogeneous sub-contexts and to fuse data locally with respect to each sub-context. CDF showed better performance than existing methods, however, it is sensitive to noise due to the large number of parameters optimized and the innate linearity limits the application of CDF. In this paper, a variant of CDF using support vector machines (SVMs) for fusion and kernel principal component analysis (K-PCA) for context extraction is proposed to solve the problems in CDF, named CDF-SVM. Kernel PCA can shape irregular clusters including elliptical ones through the non-linear kernel transformation and SVM can draw a non-linear decision boundary. Regularization terms is also included in the objective function of CDF-SVM to mitigate the noise sensitivity in CDF. CDF-SVM showed better performance than CDF and its variants, which is demonstrated through the experiments with a landmine data set.

Comparison of HRV Time and Frequency Domain Features for Myocardial Ischemia Detection (심근허혈검출을 위한 심박변이도의 시간과 주파수 영역에서의 특징 비교)

  • Tian, Xue-Wei;Zhang, Zhen-Xing;Lee, Sang-Hong;Lim, Joon-S.
    • The Journal of the Korea Contents Association
    • /
    • v.11 no.3
    • /
    • pp.271-280
    • /
    • 2011
  • Heart Rate Variability (HRV) analysis is a convenient tool to assess Myocardial Ischemia (MI). The analysis methods of HRV can be divided into time domain and frequency domain analysis. This paper uses wavelet transform as frequency domain analysis in contrast to time domain analysis in short term HRV analysis. ST-T and normal episodes are collected from the European ST-T database and the MIT-BIH Normal Sinus Rhythm database, respectively. An episode can be divided into several segments, each of which is formed by 32 successive RR intervals. Eighteen HRV features are extracted from each segment by the time and frequency domain analysis. To diagnose MI, the Neural Network with Weighted Fuzzy Membership functions (NEWFM) is used with the extracted 18 features. The results show that the average accuracy from time and frequency domain features is 75.29% and 80.93%, respectively.