• Title/Summary/Keyword: multimedia means

Search Result 424, Processing Time 0.025 seconds

Korean Onomatopoeia Clustering for Sound Database (음향 DB 구축을 위한 한국어 의성어 군집화)

  • Kim, Myung-Gwan;Shin, Young-Suk;Kim, Young-Rye
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.9
    • /
    • pp.1195-1203
    • /
    • 2008
  • Onomatopoeia of korean documents is to represent from natural or artificial sound to human language and it can express onomatopoeia language which is the nearest an object and also able to utilize as standard for clustering of Multimedia data. In this study, We get frequency of onomatopoeia in the experiment subject and select 100 onomatopoeia of use to our study In order to cluster onomatopoeia's relation, we extract feature of similarity and distance metric and then represent onomatopoeia's relation on vector space by using PCA. At the end, we can clustering onomatopoeia by using k-means algorithm.

  • PDF

Bayesian Nonlinear Blind Channel Equalizer based on Gaussian Weighted MFCM

  • Han, Soo-Whan;Park, Sung-Dae;Lee, Jong-Keuk
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.12
    • /
    • pp.1625-1634
    • /
    • 2008
  • In this study, a modified Fuzzy C-Means algorithm with Gaussian weights (MFCM_GW) is presented for the problem of nonlinear blind channel equalization. The proposed algorithm searches for the optimal channel output states of a nonlinear channel based on received symbols. In contrast to conventional Euclidean distance in Fuzzy C-Means (FCM), the use of the Bayesian likelihood fitness function and the Gaussian weighted partition matrix is exploited in this method. In the search procedure, all possible sets of desired channel states are constructed by considering the combinations of estimated channel output states. The set of desired states characterized by the maxima] value of the Bayesian fitness is selected and updated by using the Gaussian weights. After this procedure, the Bayesian equalizer with the final desired states is implemented to reconstruct transmitted symbols. The performance of the proposed method is compared with those of a simplex genetic algorithm (GA), a hybrid genetic algorithm (GA merged with simulated annealing (SA):GASA), and a previously developed version of MFCM. In particular, a relative]y high accuracy and a fast search speed have been observed.

  • PDF

Performance Improvement of Deep Clustering Networks for Multi Dimensional Data (다차원 데이터에 대한 심층 군집 네트워크의 성능향상 방법)

  • Lee, Hyunjin
    • Journal of Korea Multimedia Society
    • /
    • v.21 no.8
    • /
    • pp.952-959
    • /
    • 2018
  • Clustering is one of the most fundamental algorithms in machine learning. The performance of clustering is affected by the distribution of data, and when there are more data or more dimensions, the performance is degraded. For this reason, we use a stacked auto encoder, one of the deep learning algorithms, to reduce the dimension of data which generate a feature vector that best represents the input data. We use k-means, which is a famous algorithm, as a clustering. Sine the feature vector which reduced dimensions are also multi dimensional, we use the Euclidean distance as well as the cosine similarity to increase the performance which calculating the similarity between the center of the cluster and the data as a vector. A deep clustering networks combining a stacked auto encoder and k-means re-trains the networks when the k-means result changes. When re-training the networks, the loss function of the stacked auto encoder and the loss function of the k-means are combined to improve the performance and the stability of the network. Experiments of benchmark image ad document dataset empirically validated the power of the proposed algorithm.

Evaluation of Subtractive Clustering based Adaptive Neuro-Fuzzy Inference System with Fuzzy C-Means based ANFIS System in Diagnosis of Alzheimer

  • Kour, Haneet;Manhas, Jatinder;Sharma, Vinod
    • Journal of Multimedia Information System
    • /
    • v.6 no.2
    • /
    • pp.87-90
    • /
    • 2019
  • Machine learning techniques have been applied in almost all the domains of human life to aid and enhance the problem solving capabilities of the system. The field of medical science has improved to a greater extent with the advent and application of these techniques. Efficient expert systems using various soft computing techniques like artificial neural network, Fuzzy Logic, Genetic algorithm, Hybrid system, etc. are being developed to equip medical practitioner with better and effective diagnosing capabilities. In this paper, a comparative study to evaluate the predictive performance of subtractive clustering based ANFIS hybrid system (SCANFIS) with Fuzzy C-Means (FCM) based ANFIS system (FCMANFIS) for Alzheimer disease (AD) has been taken. To evaluate the performance of these two systems, three parameters i.e. root mean square error (RMSE), prediction accuracy and precision are implemented. Experimental results demonstrated that the FCMANFIS model produce better results when compared to SCANFIS model in predictive analysis of Alzheimer disease (AD).

Edge Detection in noisy Images by means of Fuzzy Entropy (퍼지엔트로피에 의한 잡음영상의 경계검출)

  • 박인규
    • Proceedings of the Korea Multimedia Society Conference
    • /
    • 2000.04a
    • /
    • pp.170-173
    • /
    • 2000
  • 잡음에 오염된 영상의 경계검출에 대한 퍼지연산자를 보강하였다. 제한된 방법은 데이터에 존재하는 잡음에 강인한 경계를 검출하기 위하여 퍼지 엔트로피에 의한 퍼지추론을 이용한다. 퍼지기법이 영상의 세세한 정보의 검출과 잡음에 대한 민감도의 관점에서 보았을 때 기존의 방법들보다 성능이 우수하다는 것을 여러 실험결과를 통하여 알 수 있었다.

  • PDF

Fault Detection of Ceramic Imaging using K-means Algorithm (K-means 알고리즘을 이용한 세라믹 영상에서의 결함 검출)

  • Kim, Kwang Beak;Woo, Young Woon
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2014.01a
    • /
    • pp.275-277
    • /
    • 2014
  • 본 논문에서는 세라믹 소재 영상에 가우시안 필터링 기법을 적용하여 잡음을 제거하고, K-means 알고리즘을 적용하여 결함 영역을 세분화 한 뒤, 세분화된 결함 영역에 Max-Min 이진화 기법을 이용하여 결함 영역을 추출한 후, 형태학적 기법을 이용하여 잡음을 제거하고 결함을 추출한다. 제안된 방법을 세라믹 소재 영상을 대상으로 실험한 결과, 기존의 방법보다 효율적으로 결함이 검출되는 것을 확인하였다.

  • PDF

Traffic Optimized FEC Control Algorithm for Multimedia Streaming Applications.

  • Magzumov, Alexander;Jang, Wonkap
    • Proceedings of the IEEK Conference
    • /
    • 2003.07a
    • /
    • pp.477-480
    • /
    • 2003
  • Packet losses in the Internet can dramatically degrade quality of multimedia streams. Forward Error Correction (FEC) is one of the best methods that can protect data from packet erasures by means of sending additional redundant information. Proposed control algorithm provides the possibility of receiving real-time multimedia streams of given quality wifth minimal traffic overhead. The traffic optimization is reached by adjusting packet size as well as block code parameters. Calculations and simulation results show that for non-bursty network conditions traffic optimization can lead to more than 50% bandwidth reduction.

  • PDF

Voice Activity Detection Algorithm using Fuzzy Membership Shifted C-means Clustering in Low SNR Environment (낮은 신호 대 잡음비 환경에서의 퍼지 소속도 천이 C-means 클러스터링을 이용한 음성구간 검출 알고리즘)

  • Lee, G.H.;Lee, Y.J.;Cho, J.H.;Kim, M.N.
    • Journal of Korea Multimedia Society
    • /
    • v.17 no.3
    • /
    • pp.312-323
    • /
    • 2014
  • Voice activity detection is very important process that find voice activity from noisy speech signal for noise cancelling and speech enhancement. Over the past few years, many studies have been made on voice activity detection, it has poor performance for speech signal of sentence form in a low SNR environment. In this paper, it proposed new voice activity detection algorithm that has beginning VAD process using entropy and main VAD process using fuzzy membership shifted c-means clustering. We conduct an experiment in various SNR environment of white noise to evaluate performance of the proposed algorithm and confirmed good performance of the proposed algorithm.

K-means based Clustering Method with a Fixed Number of Cluster Members

  • Yi, Faliu;Moon, Inkyu
    • Journal of Korea Multimedia Society
    • /
    • v.17 no.10
    • /
    • pp.1160-1170
    • /
    • 2014
  • Clustering methods are very useful in many fields such as data mining, classification, and object recognition. Both the supervised and unsupervised grouping approaches can classify a series of sample data with a predefined or automatically assigned cluster number. However, there is no constraint on the number of elements for each cluster. Numbers of cluster members for each cluster obtained from clustering schemes are usually random. Thus, some clusters possess a large number of elements whereas others only have a few members. In some areas such as logistics management, a fixed number of members are preferred for each cluster or logistic center. Consequently, it is necessary to design a clustering method that can automatically adjust the number of group elements. In this paper, a k-means based clustering method with a fixed number of cluster members is proposed. In the proposed method, first, the data samples are clustered using the k-means algorithm. Then, the number of group elements is adjusted by employing a greedy strategy. Experimental results demonstrate that the proposed clustering scheme can classify data samples efficiently for a fixed number of cluster members.

A Beta-distributed Timed Petri Net Model for Specification, Analysis and Playout Control of Multimedia Titles (멀티미디어 응용의 명세, 분석 및 재생제어를 위한 베타분포형 시간 패트리넷 모형)

  • 이진석;이강수
    • Journal of Korea Multimedia Society
    • /
    • v.2 no.2
    • /
    • pp.200-216
    • /
    • 1999
  • In this paper, we propose a BTPN (Beta-distributed Timed Petri Net) model which is not only an effective multimedia synchronization and authoring specification model, but also a direct control model for playout of a title. Methods of specification of relationships among all media objects in a title by using the BTPN structure and language, as well as methods of analysis of the BTPN by means of a Remaining Timed Reachability Graph and Timing diagram, are proposed. A concept of critical object path, coming from PERT/CPM, is useful for modeling the uncertainty of playout of a multimedia title and editing of title.

  • PDF