• 제목/요약/키워드: Dual machine learning structure

검색결과 4건 처리시간 0.018초

Development of Eye-Tracking System Using Dual Machine Learning Structure (이중 기계학습 구조를 이용한 안구이동추적 기술개발)

  • Gang, Gyeong Woo;Min, Chul Hong;Kim, Tae Seon
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • 제66권7호
    • /
    • pp.1111-1116
    • /
    • 2017
  • In this paper, we developed bio-signal based eye tracking system using electrooculogram (EOG) and electromyogram (EMG) which measured simultaneously from same electrodes. In this system, eye gazing position can be estimated using EOG signal and we can use EMG signal at the same time for additional command control interface. For EOG signal processing, PLA algorithms are applied to reduce processing complexity but still it can guarantee less than 0.2 seconds of reaction delay time. Also, we developed dual machine learning structure and it showed robust and enhanced tracking performances. Compare to conventional EOG based eye tracking system, developed system requires relatively light hardware system specification with only two skin contact electrodes on both sides of temples and it has advantages on application to mobile equipments or wearable devices. Developed system can provide a different UX for consumers and especially it would be helpful to disabled persons with application to orthotics for those of quadriplegia or communication tools for those of intellectual disabilities.

Multi-Radial Basis Function SVM Classifier: Design and Analysis

  • Wang, Zheng;Yang, Cheng;Oh, Sung-Kwun;Fu, Zunwei
    • Journal of Electrical Engineering and Technology
    • /
    • 제13권6호
    • /
    • pp.2511-2520
    • /
    • 2018
  • In this study, Multi-Radial Basis Function Support Vector Machine (Multi-RBF SVM) classifier is introduced based on a composite kernel function. In the proposed multi-RBF support vector machine classifier, the input space is divided into several local subsets considered for extremely nonlinear classification tasks. Each local subset is expressed as nonlinear classification subspace and mapped into feature space by using kernel function. The composite kernel function employs the dual RBF structure. By capturing the nonlinear distribution knowledge of local subsets, the training data is mapped into higher feature space, then Multi-SVM classifier is realized by using the composite kernel function through optimization procedure similar to conventional SVM classifier. The original training data set is partitioned by using some unsupervised learning methods such as clustering methods. In this study, three types of clustering method are considered such as Affinity propagation (AP), Hard C-Mean (HCM) and Iterative Self-Organizing Data Analysis Technique Algorithm (ISODATA). Experimental results on benchmark machine learning datasets show that the proposed method improves the classification performance efficiently.

A Branch-and-Bound Algorithm for Finding an Optimal Solution of Transductive Support Vector Machines (Transductive SVM을 위한 분지-한계 알고리즘)

  • Park Chan-Kyoo
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • 제31권2호
    • /
    • pp.69-85
    • /
    • 2006
  • Transductive Support Vector Machine(TSVM) is one of semi-supervised learning algorithms which exploit the domain structure of the whole data by considering labeled and unlabeled data together. Although it was proposed several years ago, there has been no efficient algorithm which can handle problems with more than hundreds of training examples. In this paper, we propose an efficient branch-and-bound algorithm which can solve large-scale TSVM problems with thousands of training examples. The proposed algorithm uses two bounding techniques: min-cut bound and reduced SVM bound. The min-cut bound is derived from a capacitated graph whose cuts represent a lower bound to the optimal objective function value of the dual problem. The reduced SVM bound is obtained by constructing the SVM problem with only labeled data. Experimental results show that the accuracy rate of TSVM can be significantly improved by learning from the optimal solution of TSVM, rather than an approximated solution.

Dual Branched Copy-Move Forgery Detection Network Using Rotation Invariant Energy in Wavelet Domain (웨이블릿 영역에서 회전 불변 에너지 특징을 이용한 이중 브랜치 복사-이동 조작 검출 네트워크)

  • Jun Young, Park;Sang In, Lee;Il Kyu, Eom
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • 제17권6호
    • /
    • pp.309-317
    • /
    • 2022
  • In this paper, we propose a machine learning-based copy-move forgery detection network with dual branches. Because the rotation or scaling operation is frequently involved in copy-move forger, the conventional convolutional neural network is not effectively applied in detecting copy-move tampering. Therefore, we divide the input into rotation-invariant and scaling-invariant features based on the wavelet coefficients. Each of the features is input to different branches having the same structure, and is fused in the combination module. Each branch comprises feature extraction, correlation, and mask decoder modules. In the proposed network, VGG16 is used for the feature extraction module. To check similarity of features generated by the feature extraction module, the conventional correlation module used. Finally, the mask decoder model is applied to develop a pixel-level localization map. We perform experiments on test dataset and compare the proposed method with state-of-the-art tampering localization methods. The results demonstrate that the proposed scheme outperforms the existing approaches.