• Proceedings of the IEEK Conference
• /
• 2000.11d
• /
• pp.159-162
• /
• 2000

In this paper, we propose an efficient method to detect shot changes in compressed MPEG video data by using reference features among video frames. The reference features among video frames imply the similarities among adjacent frames by prediction coded type of each frame. A shot change is detected if the similarity degrees of a frame and its adjacent frames are low. And the shot change detection algorithm is improved by using Fuzzy c-means (FCM) clustering algorithm. The FCM clustering algorithm uses the shot change probabilities evaluated in the mask matching of reference ratios and difference measure values based on frame reference ratios.

• Journal of Korean Institute of Industrial Engineers
• /
• v.23 no.4
• /
• pp.803-816
• /
• 1997

In this paper we propose a new approach far part families considering multiple attributes of parts in the design and operating stage of flexible manufacturing systems. We first represent the relationship of parts and the relative attributes using fuzzy membership function, AHP method and normalization. As a result, more realistic nonbinary data of the relationship is obtained. Then we group parts into part families based on the nonbinary data using fuzzy $\alpha$-cut and new similarity coefficient method. The performance of our method is compared numerically with others.

• Journal of the Korean Data and Information Science Society
• /
• v.21 no.3
• /
• pp.605-619
• /
• 2010

Caching of frequently accessed data in multi-hop ad hoc environment is a technique that can improve data access performance and availability. Cooperative caching, which allows sharing and coordination of cached data among several clients, can further en-hance the potential of caching techniques. In this paper, we propose a fuzzy cooperative caching scheme in mobile ad hoc networks. The cache management of the proposed caching scheme not only uses adaptively CacheData or CachePath based on data sim-ilarity and data utility, but also uses the replacement manager based on data pro t. Also, the proposed caching scheme uses a prefetch manager. When the TTL of the cached data expires, the prefetch manager evaluates the popularity index of the data. If the popularity index is larger than a threshold, the data is prefetched. Otherwise, its space is released. The performance of the proposed scheme is evaluated analytically and is compared to that of other cooperative caching schemes.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.23 no.61
• /
• pp.41-50
• /
• 2000

Cell formation(CF) Is to group parts with similar geometry, function, material and process into part families, and the corresponding machines into machine cells. Cell formation solutions often contain exceptional elements(EEs). Also, the following objective functions - minimizing the total costs of dealing with exceptional elements and maximizing total similarity coefficients between parts - have been used in CF modeling. Thus, multiobjective programming approach can be developed to model cell formation problems with two conflicting objective functions. This paper presents an effective cell formation method with fuzzy multiobjective nonlinear mixed-integer programming simultaneously to form machine cells and to minimize the cost of eliminating EEs.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.7
• /
• pp.101-108
• /
• 1998

In this paper, after we got to realized FDNN (fuzzy decision neural network) applied the quantization triangularity fuzzy function to DBNN(decision based neural network) of a hierarchical structure for image process, we could esign hardware of the realized FDNN. Also it is normalized the standard image and the input image as the same size. We are applied DWW algorithm which selected the closest value with finding similarity of an interval image by this distance to FDNN. So we could calulated in terms of distance to weight of pixel which composed two image and eliminated the nise of image, minimized the lost of information, obtained the optimal information. It is designed hardware of high speed weighted FDNN using COMPASS tool. Aslo, the total circuit is realized as gates of 61,000 and could show to superiority of FDNN using the simulation.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.376-376
• /
• 2000

Several algorithmic models have been proposed to estimate software cost and other management parameters. In particular, early prediction of completion time is absolutely essential for proper advance planning and a version of the possible ruin of a project. However, estimation is difficult because of its similarity to export judgment approaches and for its potential as an expert assistant in support of human judgment. Especially, the nature of the Norden/Rayleigh curve used by Putnam, renders it unreliable during the initial phases of the project, in projects involving a fast manpower buildup, as is the case with most software projects. Estimating software development effort is more complexity, because of infrastructure software related to target-machines hardware and process characteristics should be considered in software development for DCS (Distributed Control System). In this paper, we propose software development effort estimation technique using adaptive neural fuzzy inference system. The methods is applied to case-based projects and discussed.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10d
• /
• pp.190-192
• /
• 2002

데이터 마이닝(Data Mining)이란 저장된 많은 양의 자료로부터 통계적 수학적 분석방법을 이용하여 다양한 가치 있는 정보를 찾아내는 일련의 과정이다. 데이터 클러스터링은 이러한 데이터 마이닝을 위한 하나의 중요한 기법이다. 본 논문에서는 Fuzzy C-Means 알고리즘을 이용하여 웹 사용자들의 행위가 기록되어 있는 웹 로그 데이터를 데이터 클러스터링 하는 방법에 관하여 연구하고자 한다. Fuzzv C-Means 클러스터링 알고리즘은 각 데이터와 각 클러스터 중심과의 거리를 고려한 유사도 측정에 기초한 목적 함수의 최적화 방식을 사용한다. 웹 로그 데이터의 여러 필드 중에서 사용자 IP, 시간, 웹 페이지 필드를 WLDF(Web Log Data for FCM)으로 가공한 후, 다차원 Fuzzy C-Means 클러스터링을 한다. 그리고 이를 이용하여 샘플 데이터와 임의의 데이터간의 유사 패턴 분석을 하고자 한다.

• Speech Sciences
• /
• v.13 no.4
• /
• pp.177-186
• /
• 2006

In an effort to enhance the quality of feature vector classification and thereby reduce the recognition error rate of the speaker-independent speech recognition, we employ the Mahalanobis distance in the calculation of the similarity measure between feature vectors. It is assumed that the metric matrix of the Mahalanobis distance be diagonal for the sake of cost reduction in memory and time of calculation. We propose that the diagonal elements be given in terms of the variations of the feature vector components. Geometrically, this prescription tends to redistribute the set of data in the shape of a hypersphere in the feature vector space. The idea is applied to the speech recognition by hidden Markov model with fuzzy vector quantization. The result shows that the recognition is improved by an appropriate choice of the relevant adjustable parameter. The Viterbi score difference of the two winners in the recognition test shows that the general behavior is in accord with that of the recognition error rate.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.8
• /
• pp.1748-1754
• /
• 2004

In this paper, We propose a image watermarking method which combine frequence-domain with fuzzy inference. In our method, the original image is transformed and decomposed using DWT. The watermark is added to high-frequency coefficients, which analyzed optimally so as to genarate the fuzzfied data. In order to evaluate the robustness, the embeded watermark is detected in case of attacking by JPEG compression and cropping. Experimental results showed that proposed scheme is superior to the typical method with PSNR and similarity under the same conditions.

• Journal of Advanced Navigation Technology
• /
• v.13 no.5
• /
• pp.773-780
• /
• 2009

This study proposed a face region detection algorithm using fuzzy inference of pixel hue and intensity. The proposed algorithm is composed of light compensate and face detection. The light compensation process performs calibration for the change of light. The face detection process evaluates similarity by generating membership functions using as feature parameters hue and intensity calculated from 20 skin color models. From the extracted face region candidate, the eyes were detected with element C of color model CMY, and the mouth was detected with element Q of color model YIQ, the face region was detected based on the knowledge of an ordinary face. The result of experiment are conducted with frontal face color images of face as input images, the method detected the face region regardless of the position and size of face images.