• 제목/요약/키워드: Mean vector

검색결과 701건 처리시간 0.03초

Dataset을 활용한 뇌파 데이터 분석 방법에 관한 연구 (A Study on the analyzation method of EEG adapting Dataset)

  • 이현주;신동일;신동규
    • 한국정보처리학회:학술대회논문집
    • /
    • 한국정보처리학회 2014년도 춘계학술발표대회
    • /
    • pp.995-997
    • /
    • 2014
  • 뇌파는 최근에 가장 많이 연구되고 있는 생체신호이다. 본 연구에서는 오픈 감정뇌파데이터인 DEAP Dataset를 활용한 데이터 분석 실험을 시행하였다. DEAP Dataset는 총 32개의 데이터이며, 32채널로 구성되어 있다. 전처리 과정에서는 디지털 필터인 IIR(Infinite Impulse Response) Filter를 사용하여 잡음을 제거하였고, 인공산물인 안구잡파(EOG: Electrooculograms) 제거에는 LMS(the Least Mean squares) 알고리즘을 사용하였다. 감정분류는 Valence-Arousal 평면을 사용하여 네 개의 감정으로 구분하였고, 분류 실험으로는 패턴인식 알고리즘인 SVM(support Vector Machine)를 사용하였다. 실험결과 SVM이 70%대의 결과를 도출하여 이전 실험결과보다 높은 정확도를 도출하였다.

A Study on Face Recognition and Reliability Improvement Using Classification Analysis Technique

  • Kim, Seung-Jae
    • International journal of advanced smart convergence
    • /
    • 제9권4호
    • /
    • pp.192-197
    • /
    • 2020
  • In this study, we try to find ways to recognize face recognition more stably and to improve the effectiveness and reliability of face recognition. In order to improve the face recognition rate, a lot of data must be used, but that does not necessarily mean that the recognition rate is improved. Another criterion for improving the recognition rate can be seen that the top/bottom of the recognition rate is determined depending on how accurately or precisely the degree of classification of the data to be used is made. There are various methods for classification analysis, but in this study, classification analysis is performed using a support vector machine (SVM). In this study, feature information is extracted using a normalized image with rotation information, and then projected onto the eigenspace to investigate the relationship between the feature values through the classification analysis of SVM. Verification through classification analysis can improve the effectiveness and reliability of various recognition fields such as object recognition as well as face recognition, and will be of great help in improving recognition rates.

Academic Registration Text Classification Using Machine Learning

  • Alhawas, Mohammed S;Almurayziq, Tariq S
    • International Journal of Computer Science & Network Security
    • /
    • 제22권1호
    • /
    • pp.93-96
    • /
    • 2022
  • Natural language processing (NLP) is utilized to understand a natural text. Text analysis systems use natural language algorithms to find the meaning of large amounts of text. Text classification represents a basic task of NLP with a wide range of applications such as topic labeling, sentiment analysis, spam detection, and intent detection. The algorithm can transform user's unstructured thoughts into more structured data. In this work, a text classifier has been developed that uses academic admission and registration texts as input, analyzes its content, and then automatically assigns relevant tags such as admission, graduate school, and registration. In this work, the well-known algorithms support vector machine SVM and K-nearest neighbor (kNN) algorithms are used to develop the above-mentioned classifier. The obtained results showed that the SVM classifier outperformed the kNN classifier with an overall accuracy of 98.9%. in addition, the mean absolute error of SVM was 0.0064 while it was 0.0098 for kNN classifier. Based on the obtained results, the SVM is used to implement the academic text classification in this work.

Machine learning models for predicting the compressive strength of concrete containing nano silica

  • Garg, Aman;Aggarwal, Paratibha;Aggarwal, Yogesh;Belarbi, M.O.;Chalak, H.D.;Tounsi, Abdelouahed;Gulia, Reeta
    • Computers and Concrete
    • /
    • 제30권1호
    • /
    • pp.33-42
    • /
    • 2022
  • Experimentally predicting the compressive strength (CS) of concrete (for a mix design) is a time-consuming and laborious process. The present study aims to propose surrogate models based on Support Vector Machine (SVM) and Gaussian Process Regression (GPR) machine learning techniques, which can predict the CS of concrete containing nano-silica. Content of cement, aggregates, nano-silica and its fineness, water-binder ratio, and the days at which strength has to be predicted are the input variables. The efficiency of the models is compared in terms of Correlation Coefficient (CC), Root Mean Square Error (RMSE), Variance Account For (VAF), Nash-Sutcliffe Efficiency (NSE), and RMSE to observation's standard deviation ratio (RSR). It has been observed that the SVM outperforms GPR in predicting the CS of the concrete containing nano-silica.

Fisher Information and the Kullback-Leibler Distance in Concomitants of Generalized Order Statistics Under Iterated FGM family

  • Barakat, Haroon Mohammed;Husseiny, Islam Abdullah
    • Kyungpook Mathematical Journal
    • /
    • 제62권2호
    • /
    • pp.389-405
    • /
    • 2022
  • We study the Fisher Information (FI) of m-generalized order statistics (m-GOSs) and their concomitants about the shape-parameter vector of the Iterated Farlie-Gumbel-Morgenstern (IFGM) bivariate distribution. We carry out a computational study and show how the FI matrix (FIM) helps in finding information contained in singly or multiply censored bivariate samples from the IFGM. We also run numerical computations about the FIM for the sub-models of order statistics (OSs) and sequential order statistics (SOSs). We evaluate FI about the mean and the shape-parameter of exponential and power distributions, respectively. Finally, we investigate the Kullback-Leibler distance in concomitants of m-GOSs.

HOPF HYPERSURFACES OF THE HOMOGENEOUS NEARLY KÄHLER 𝕊3 × 𝕊3 SATISFYING CERTAIN COMMUTING CONDITIONS

  • Xiaomin, Chen;Yifan, Yang
    • 대한수학회보
    • /
    • 제59권6호
    • /
    • pp.1567-1594
    • /
    • 2022
  • In this article, we first introduce the notion of commuting Ricci tensor and pseudo-anti commuting Ricci tensor for Hopf hypersurfaces in the homogeneous nearly Kähler 𝕊3 × 𝕊3 and prove that the mean curvature of hypersurface is constant under certain assumptions. Next, we prove the nonexistence of Ricci soliton on Hopf hypersurface with potential Reeb vector field, which improves a result of Hu et al. on the nonexistence of Einstein Hopf hypersurfaces in the homogeneous nearly Kähler 𝕊3 × 𝕊3.

A NEW MODELLING OF TIMELIKE Q-HELICES

  • Yasin Unluturk ;Cumali Ekici;Dogan Unal
    • 호남수학학술지
    • /
    • 제45권2호
    • /
    • pp.231-247
    • /
    • 2023
  • In this study, we mean that timelike q-helices are curves whose q-frame fields make a constant angle with a non-zero fixed axis. We present the necessary and sufficient conditions for timelike curves via the q-frame to be q-helices in Lorentz-Minkowski 3-space. Then we find some results of the relations between q-helices and Darboux q-helices. Furthermore, we portray Darboux q-helices as special curves whose Darboux vector makes a constant angle with a non-zero fixed axis by choosing the curve as one of the types of q-helices, and also the general case.

딥러닝 기반의 눈 랜드마크 위치 검출이 통합된 시선 방향 벡터 추정 네트워크 (Deep Learning-based Gaze Direction Vector Estimation Network Integrated with Eye Landmark Localization)

  • 주희영;고민수;송혁
    • 한국방송∙미디어공학회:학술대회논문집
    • /
    • 한국방송∙미디어공학회 2021년도 하계학술대회
    • /
    • pp.180-182
    • /
    • 2021
  • 본 논문은 눈 랜드마크 위치 검출과 시선 방향 벡터 추정이 하나의 딥러닝 네트워크로 통합된 시선 추정 네트워크를 제안한다. 제안하는 네트워크는 Stacked Hourglass Network[1]를 백본(Backbone) 구조로 이용하며, 크게 랜드마크 검출기, 특징 맵 추출기, 시선 방향 추정기라는 세 개의 부분으로 구성되어 있다. 랜드마크 검출기에서는 눈 랜드마크 50개 포인트의 좌표를 추정하며, 특징 맵 추출기에서는 시선 방향 추정을 위한 눈 이미지의 특징 맵을 생성한다. 그리고 시선 방향 추정기에서는 각 출력 결과를 조합하고 이를 통해 최종 시선 방향 벡터를 추정한다. 제안하는 네트워크는 UnityEyes[2] 데이터셋을 통해 생성된 가상의 합성 눈 이미지와 랜드마크 좌표 데이터를 이용하여 학습하였으며, 성능 평가는 실제 사람의 눈 이미지로 구성된 MPIIGaze[3] 데이터 셋을 이용하였다. 실험을 통해 시선 추정 오차는 0.0396 MSE(Mean Square Error)의 성능을 보였으며, 네트워크의 추정 속도는 42 FPS(Frame Per Second)를 나타내었다.

  • PDF

ROTATIONAL HYPERSURFACES CONSTRUCTED BY DOUBLE ROTATION IN FIVE DIMENSIONAL EUCLIDEAN SPACE 𝔼5

  • Erhan Guler
    • 호남수학학술지
    • /
    • 제45권4호
    • /
    • pp.585-597
    • /
    • 2023
  • We introduce the rotational hypersurface x = x(u, v, s, t) constructed by double rotation in five dimensional Euclidean space 𝔼5. We reveal the first and the second fundamental form matrices, Gauss map, shape operator matrix of x. Additionally, defining the i-th curvatures of any hypersurface via Cayley-Hamilton theorem, we compute the curvatures of the rotational hypersurface x. We give some relations of the mean and Gauss-Kronecker curvatures of x. In addition, we reveal Δx=𝓐x, where 𝓐 is the 5 × 5 matrix in 𝔼5.

COMPLETE NONCOMPACT SUBMANIFOLDS OF MANIFOLDS WITH NEGATIVE CURVATURE

  • Ya Gao;Yanling Gao;Jing Mao;Zhiqi Xie
    • 대한수학회지
    • /
    • 제61권1호
    • /
    • pp.183-205
    • /
    • 2024
  • In this paper, for an m-dimensional (m ≥ 5) complete non-compact submanifold M immersed in an n-dimensional (n ≥ 6) simply connected Riemannian manifold N with negative sectional curvature, under suitable constraints on the squared norm of the second fundamental form of M, the norm of its weighted mean curvature vector |Hf| and the weighted real-valued function f, we can obtain: • several one-end theorems for M; • two Liouville theorems for harmonic maps from M to complete Riemannian manifolds with nonpositive sectional curvature.