• 제목/요약/키워드: feature vector classification

검색결과 532건 처리시간 0.029초

A Study on the Optimal Mahalanobis Distance for Speech Recognition

  • Lee, Chang-Young
    • 음성과학
    • /
    • 제13권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.

  • PDF

Seabed Sediment Classification Algorithm using Continuous Wavelet Transform

  • Lee, Kibae;Bae, Jinho;Lee, Chong Hyun;Kim, Juho;Lee, Jaeil;Cho, Jung Hong
    • Journal of Advanced Research in Ocean Engineering
    • /
    • 제2권4호
    • /
    • pp.202-208
    • /
    • 2016
  • In this paper, we propose novel seabed sediment classification algorithm using feature obtained by continuous wavelet transform (CWT). Contrast to previous researches using direct reflection coefficient of seabed which is function of frequency and is highly influenced by sediment types, we develop an algorithm using both direct reflection signal and backscattering signal. In order to obtain feature vector, we employ CWT of the signal and obtain histograms extracted from local binary patterns of the scalogram. The proposed algorithm also adopts principal component analysis (PCA) to reduce dimension of the feature vector so that it requires low computational cost to classify seabed sediment. For training and classification, we adopts K-means clustering algorithm which can be done with low computational cost and does not require prior information of the sediment. To verify the proposed algorithm, we obtain field data measured at near Jeju island and show that the proposed classification algorithm has reliable discrimination performance by comparing the classification results with actual physical properties of the sediments.

음악에 따른 감정분류을 위한 EEG특징벡터 비교 (Comparison of EEG Feature Vector for Emotion Classification according to Music Listening)

  • 이소민;변성우;이석필
    • 전기학회논문지
    • /
    • 제63권5호
    • /
    • pp.696-702
    • /
    • 2014
  • Recently, researches on analyzing relationship between the state of emotion and musical stimuli using EEG are increasing. A selection of feature vectors is very important for the performance of EEG pattern classifiers. This paper proposes a comparison of EEG feature vectors for emotion classification according to music listening. For this, we extract some feature vectors like DAMV, IAV, LPC, LPCC from EEG signals in each class related to music listening and compare a separability of the extracted feature vectors using Bhattacharyya distance. So more effective feature vectors are recommended for emotion classification according to music listening.

망 분리를 이용한 딥러닝 학습시간 단축에 대한 연구 (A Study on Reducing Learning Time of Deep-Learning using Network Separation)

  • 이희열;이승호
    • 전기전자학회논문지
    • /
    • 제25권2호
    • /
    • pp.273-279
    • /
    • 2021
  • 본 논문에서는 딥러닝 구조를 분할을 이용한 개별 학습을 수행하여 학습시간을 단축하는 알고리즘을 제안한다. 제안하는 알고리즘은 망 분류 기점 설정 과정, 특징 벡터 추출 과정, 특징 노이즈 제거 과정, 클래스 분류 과정 등의 4가지 과정으로 구성된다. 첫 번째로 망 분류 기점 설정 과정에서는 효과적인 특징 벡터 추출을 위한 망 구조의 분할 기점을 설정한다. 두 번째로 특징 벡터 추출 과정에서는 기존에 학습한 가중치를 사용하여 추가 학습 없이 특징 벡터를 추출한다. 세 번째로 특징 노이즈 제거 과정에서는 추출된 특징 벡터를 입력받아 각 클래스의 출력값을 학습하여 데이터의 노이즈를 제거한다. 네 번째로 클래스 분류 과정에서는 노이즈가 제거된 특징 벡터를 입력받아 다층 퍼셉트론 구조에 입력하고 이를 출력하고 학습한다. 제안된 알고리즘의 성능을 평가하기 위하여 Extended Yale B 얼굴 데이터베이스를 사용하여 실험 하였다. 실험 결과, 1회 학습에 소요되는 시간의 경우 제안하는 알고리즘이 기존 알고리즘 기준 40.7% 단축하였다. 또한 목표 인식률까지 학습 횟수가 기존 알고리즘과 비교하여 단축하였다. 실험결과를 통해 1회 학습시간과 전체 학습시간을 감소시켜 기존의 알고리즘보다 향상됨을 확인하였다.

Median Filtering Detection of Digital Images Using Pixel Gradients

  • RHEE, Kang Hyeon
    • IEIE Transactions on Smart Processing and Computing
    • /
    • 제4권4호
    • /
    • pp.195-201
    • /
    • 2015
  • For median filtering (MF) detection in altered digital images, this paper presents a new feature vector that is formed from autoregressive (AR) coefficients via an AR model of the gradients between the neighboring row and column lines in an image. Subsequently, the defined 10-D feature vector is trained in a support vector machine (SVM) for MF detection among forged images. The MF classification is compared to the median filter residual (MFR) scheme that had the same 10-D feature vector. In the experiment, three kinds of test items are area under receiver operating characteristic (ROC) curve (AUC), classification ratio, and minimal average decision error. The performance is excellent for unaltered (ORI) or once-altered images, such as $3{\times}3$ average filtering (AVE3), QF=90 JPEG (JPG90), 90% down, and 110% up to scale (DN0.9 and Up1.1) images, versus $3{\times}3$ and $5{\times}5$ median filtering (MF3 and MF5, respectively) and MF3 and MF5 composite images (MF35). When the forged image was post-altered with AVE3, DN0.9, UP1.1 and JPG70 after MF3, MF5 and MF35, the performance of the proposed scheme is lower than the MFR scheme. In particular, the feature vector in this paper has a superior classification ratio compared to AVE3. However, in the measured performances with unaltered, once-altered and post-altered images versus MF3, MF5 and MF35, the resultant AUC by 'sensitivity' (TP: true positive rate) and '1-specificity' (FN: false negative rate) is achieved closer to 1. Thus, it is confirmed that the grade evaluation of the proposed scheme can be rated as 'Excellent (A)'.

Fault Diagnosis of Low Speed Bearing Using Support Vector Machine

  • Widodo, Achmad;Son, Jong-Duk;Yang, Bo-Suk;Gu, Dong-Sik;Choi, Byeong-Keun;Kim, Yong-Han;Tan, Andy C.C;Mathew, Joseph
    • 한국소음진동공학회:학술대회논문집
    • /
    • 한국소음진동공학회 2007년도 추계학술대회논문집
    • /
    • pp.891-894
    • /
    • 2007
  • This study presents fault diagnosis of low speed bearing using support vector machine (SVM). The data used in the experiment was acquired using acoustic emission (AE) sensor and accelerometer. The aim of this study is to compare the performance of fault diagnosis based on AE signal and vibration signal with same load and speed. A low speed test rig was developed to simulate various defects with shaft speeds as low as 10 rpm under several loading conditions. In this study, component analysis was also performed to extract the feature and reduce the dimensionality of original data feature. Moreover, the classification for fault diagnosis was also conducted using original data feature without feature extraction. The result shows that extracted feature from AE sensor gave better performance in faults classification.

  • PDF

One-Class Support Vector Learning and Linear Matrix Inequalities

  • Park, Jooyoung;Kim, Jinsung;Lee, Hansung;Park, Daihee
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • 제3권1호
    • /
    • pp.100-104
    • /
    • 2003
  • The SVDD(support vector data description) is one of the most well-known one-class support vector learning methods, in which one tries the strategy of utilizing balls defined on the kernel feature space in order to distinguish a set of normal data from all other possible abnormal objects. The major concern of this paper is to consider the problem of modifying the SVDD into the direction of utilizing ellipsoids instead of balls in order to enable better classification performance. After a brief review about the original SVDD method, this paper establishes a new method utilizing ellipsoids in feature space, and presents a solution in the form of SDP(semi-definite programming) which is an optimization problem based on linear matrix inequalities.

지지벡터기계와 적응적 특징을 이용한 강인한 지문분류 (A Robust Fingerprint Classification using SVMs with Adaptive Features)

  • 민준기;조성배
    • 한국정보과학회논문지:소프트웨어및응용
    • /
    • 제35권1호
    • /
    • pp.41-49
    • /
    • 2008
  • 지문분류는 지문을 전역특징에 따라 미리 정의된 클래스로 분류하여 대규모 지문식별시스템의 매칭시간을 감소시키는데 유용하다. 그런데, 지문의 고유성으로 인해 전역특징이 다양하게 분포함에도 불구하고, 기존의 지문분류 방법들은 모든 지문에 대해 고정된 영역으로부터 비적응적으로 전역특징을 추출하였다. 본 논문에서는 다양한 지문을 효과적으로 분류하기 위해 각 지문에 적응적으로 특징을 추출하는 방법을 제안한다. 이는 각 지문의 융선 방향의 변화량을 계산하여 적응적으로 특징영역을 탐색한 후, 특징영역내의 융선 방향 값을 특징벡터로 추출하고 지지벡터기계(Support Vector Machines)를 이용해 분류한다. 본 논문에서는 NIST4 데이타베이스를 이용하여 실험을 수행하였다. 그 결과 5클래스 분류에 대해 90.3%, 4클래스 분류에 대해 93.7%의 분류성능을 얻었으며, 비적응적으로 추출한 특징벡터와의 비교실험을 통해 제안하는 적응적 특징추출방법의 유용성을 입증하였다.

AUTOMATIC SELECTION AND ADJUSTMENT OF FEATURES FOR IMAGE CLASSIFICATION

  • Saiki, Kenji;Nagao, Tomoharu
    • 한국방송∙미디어공학회:학술대회논문집
    • /
    • 한국방송공학회 2009년도 IWAIT
    • /
    • pp.525-528
    • /
    • 2009
  • Recently, image classification has been an important task in various fields. Generally, the performance of image classification is not good without the adjustment of image features. Therefore, it is desired that the way of automatic feature extraction. In this paper, we propose an image classification method which adjusts image features automatically. We assume that texture features are useful in image classification tasks because natural images are composed of several types of texture. Thus, the classification accuracy rate is improved by using distribution of texture features. We obtain texture features by calculating image features from a current considering pixel and its neighborhood pixels. And we calculate image features from distribution of textures feature. Those image features are adjusted to image classification tasks using Genetic Algorithm. We apply proposed method to classifying images into "head" or "non-head" and "male" or "female".

  • PDF

Classification of Textured Images Based on Discrete Wavelet Transform and Information Fusion

  • Anibou, Chaimae;Saidi, Mohammed Nabil;Aboutajdine, Driss
    • Journal of Information Processing Systems
    • /
    • 제11권3호
    • /
    • pp.421-437
    • /
    • 2015
  • This paper aims to present a supervised classification algorithm based on data fusion for the segmentation of the textured images. The feature extraction method we used is based on discrete wavelet transform (DWT). In the segmentation stage, the estimated feature vector of each pixel is sent to the support vector machine (SVM) classifier for initial labeling. To obtain a more accurate segmentation result, two strategies based on information fusion were used. We first integrated decision-level fusion strategies by combining decisions made by the SVM classifier within a sliding window. In the second strategy, the fuzzy set theory and rules based on probability theory were used to combine the scores obtained by SVM over a sliding window. Finally, the performance of the proposed segmentation algorithm was demonstrated on a variety of synthetic and real images and showed that the proposed data fusion method improved the classification accuracy compared to applying a SVM classifier. The results revealed that the overall accuracies of SVM classification of textured images is 88%, while our fusion methodology obtained an accuracy of up to 96%, depending on the size of the data base.