• Title/Summary/Keyword: kernel feature

Search Result 191, Processing Time 0.025 seconds

Homogeneous and Non-homogeneous Polynomial Based Eigenspaces to Extract the Features on Facial Images

  • Muntasa, Arif
    • Journal of Information Processing Systems
    • /
    • v.12 no.4
    • /
    • pp.591-611
    • /
    • 2016
  • High dimensional space is the biggest problem when classification process is carried out, because it takes longer time for computation, so that the costs involved are also expensive. In this research, the facial space generated from homogeneous and non-homogeneous polynomial was proposed to extract the facial image features. The homogeneous and non-homogeneous polynomial-based eigenspaces are the second opinion of the feature extraction of an appearance method to solve non-linear features. The kernel trick has been used to complete the matrix computation on the homogeneous and non-homogeneous polynomial. The weight and projection of the new feature space of the proposed method have been evaluated by using the three face image databases, i.e., the YALE, the ORL, and the UoB. The experimental results have produced the highest recognition rate 94.44%, 97.5%, and 94% for the YALE, ORL, and UoB, respectively. The results explain that the proposed method has produced the higher recognition than the other methods, such as the Eigenface, Fisherface, Laplacianfaces, and O-Laplacianfaces.

Handwritten Numeral Recognition using Composite Features and SVM classifier (복합특징과 SVM 분류기를 이용한 필기체 숫자인식)

  • Park, Joong-Jo;Kim, Tae-Woong;Kim, Kyoung-Min
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.12
    • /
    • pp.2761-2768
    • /
    • 2010
  • In this paper, we studied the use of the foreground and background features and SVM classifier to improve the accuracy of offline handwritten numeral recognition. The foreground features are two directional features: directional gradient feature by Kirsch operators and directional stroke feature by projection runlength, and the background feature is concavity feature which is extracted from the convex hull of the numeral, where concavity feature functions as complement to the directional features. During classification of the numeral, these three features are combined to obtain good discrimination power. The efficiency of our feature sets was tested by recognition experiments on the handwritten numeral database CENPARMI, where we used SVM with RBF kernel as a classifier. The experimental results showed that each combination of two or three features gave a better performance than a single feature. This means that each single feature works with a different discriminating power and cooperates with other features to enhance the recognition accuracy. By using the composite feature of the three features, we achieved a recognition rate of 98.90%.

Protecting Memory of Process Using Mandatory Access Control (강제적 접근제어를 통한 프로세스 메모리 보호)

  • Shim, Jong-Ik;Park, Tae-Kyou;Kim, Jin-Tae
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.9
    • /
    • pp.1947-1954
    • /
    • 2011
  • There are various attacks such as tampering, bypassing and spoofing which are caused with system-wide vulnerabilities of Windows operating system. The underlying operating system is responsible for protecting application-space mechanisms against such attacks. This paper provides the implementation of mandatory access control known as multi-level security (MLS) rating with TCSEC-B1 level on th kernel of Windows$^{TM}$. By adding especially the protection feature against tampering memory of processes to the security kernel, this implementation meets the responsibility against system-wide vulnerabilities.

Physiological Responses-Based Emotion Recognition Using Multi-Class SVM with RBF Kernel (RBF 커널과 다중 클래스 SVM을 이용한 생리적 반응 기반 감정 인식 기술)

  • Vanny, Makara;Ko, Kwang-Eun;Park, Seung-Min;Sim, Kwee-Bo
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.19 no.4
    • /
    • pp.364-371
    • /
    • 2013
  • Emotion Recognition is one of the important part to develop in human-human and human computer interaction. In this paper, we have focused on the performance of multi-class SVM (Support Vector Machine) with Gaussian RFB (Radial Basis function) kernel, which has been used to solve the problem of emotion recognition from physiological signals and to improve the accuracy of emotion recognition. The experimental paradigm for data acquisition, visual-stimuli of IAPS (International Affective Picture System) are used to induce emotional states, such as fear, disgust, joy, and neutral for each subject. The raw signals of acquisited data are splitted in the trial from each session to pre-process the data. The mean value and standard deviation are employed to extract the data for feature extraction and preparing in the next step of classification. The experimental results are proving that the proposed approach of multi-class SVM with Gaussian RBF kernel with OVO (One-Versus-One) method provided the successful performance, accuracies of classification, which has been performed over these four emotions.

Dual-Encoded Features from Both Spatial and Curvelet Domains for Image Smoke Recognition

  • Yuan, Feiniu;Tang, Tiantian;Xia, Xue;Shi, Jinting;Li, Shuying
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.4
    • /
    • pp.2078-2093
    • /
    • 2019
  • Visual smoke recognition is a challenging task due to large variations in shape, texture and color of smoke. To improve performance, we propose a novel smoke recognition method by combining dual-encoded features that are extracted from both spatial and Curvelet domains. A Curvelet transform is used to filter an image to generate fifty sub-images of Curvelet coefficients. Then we extract Local Binary Pattern (LBP) maps from these coefficient maps and aggregate histograms of these LBP maps to produce a histogram map. Afterwards, we encode the histogram map again to generate Dual-encoded Local Binary Patterns (Dual-LBP). Histograms of Dual-LBPs from Curvelet domain and Completed Local Binary Patterns (CLBP) from spatial domain are concatenated to form the feature for smoke recognition. Finally, we adopt Gaussian Kernel Optimization (GKO) algorithm to search the optimal kernel parameters of Support Vector Machine (SVM) for further improvement of classification accuracy. Experimental results demonstrate that our method can extract effective and reasonable features of smoke images, and achieve good classification accuracy.

A novel method to aging state recognition of viscoelastic sandwich structures

  • Qu, Jinxiu;Zhang, Zhousuo;Luo, Xue;Li, Bing;Wen, Jinpeng
    • Steel and Composite Structures
    • /
    • v.21 no.6
    • /
    • pp.1183-1210
    • /
    • 2016
  • Viscoelastic sandwich structures (VSSs) are widely used in mechanical equipment, but in the service process, they always suffer from aging which affect the whole performance of equipment. Therefore, aging state recognition of VSSs is significant to monitor structural state and ensure the reliability of equipment. However, non-stationary vibration response signals and weak state change characteristics make this task challenging. This paper proposes a novel method for this task based on adaptive second generation wavelet packet transform (ASGWPT) and multiwavelet support vector machine (MWSVM). For obtaining sensitive feature parameters to different structural aging states, the ASGWPT, its wavelet function can adaptively match the frequency spectrum characteristics of inspected vibration response signal, is developed to process the vibration response signals for energy feature extraction. With the aim to improve the classification performance of SVM, based on the kernel method of SVM and multiwavelet theory, multiwavelet kernel functions are constructed, and then MWSVM is developed to classify the different aging states. In order to demonstrate the effectiveness of the proposed method, different aging states of a VSS are created through the hot oxygen accelerated aging of viscoelastic material. The application results show that the proposed method can accurately and automatically recognize the different structural aging states and act as a promising approach to aging state recognition of VSSs. Furthermore, the capability of ASGWPT in processing the vibration response signals for feature extraction is validated by the comparisons with conventional second generation wavelet packet transform, and the performance of MWSVM in classifying the structural aging states is validated by the comparisons with traditional wavelet support vector machine.

Detecting Rogue AP using k-SVM method (k-SVM을 이용한 Rogue AP 탐지 기법 연구)

  • Lee, Jae-Wook;Lee, Si-Young;Moon, Jong-Sub
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.24 no.1
    • /
    • pp.87-95
    • /
    • 2014
  • Under only authorized AP is allowable environment, rogue AP which is generated by a smartphone tethering can be a serious security breach. To solve rogue AP problem, this paper proposes classifying algorithm of Kernel Support Vector Machine using features of RTT data. Through our experiment, we can detect rogue AP from LTE mobile network.

Domain Analysis of Device Drivers Using Code Clone Detection Method

  • Ma, Yu-Seung;Woo, Duk-Kyun
    • ETRI Journal
    • /
    • v.30 no.3
    • /
    • pp.394-402
    • /
    • 2008
  • Domain analysis is the process of analyzing related software systems in a domain to find their common and variable parts. In the case of device drivers, they are highly suitable for domain analysis because device drivers of the same domain are implemented similarly for each device and each system that they support. Considering this characteristic, this paper introduces a new approach to the domain analysis of device drivers. Our method uses a code clone detection technique to extract similarity among device drivers of the same domain. To examine the applicability of our method, we investigated whole device drivers of a Linux source. Results showed that many reusable similar codes can be discerned by the code clone detection method. We also investigated if our method is applicable to other kernel sources. However, the results show that the code clone detection method is not useful for the domain analysis of all kernel sources. That is, the applicability of the code clone detection method to domain analysis is a peculiar feature of device drivers.

  • PDF

Poring of WIPI HAL in Embedded Linux (리눅스 환경에서 WIPI를 지원하기 위한 HAL (Handset Abstraction Layer) 이식)

  • Park, Woo-Ram;Kim, Tae-Woong;Park, Chan-Ik
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.3 no.1
    • /
    • pp.30-33
    • /
    • 2008
  • This paper persents how to port HAL (Handset Abstraction Layer) on embedded Linux to support WIPI (Wireless Internet Platform for Interoperability). As smart phones are widespread nowdays, the operating system is changing from a simple kernel like Qualcomm REX OS to more feature-rich Linux kernel. For this reason, we investigate the internal structure of HAL on REX OS and design how to port it to embedded Linux. Careful analysis leads us to identify several porting issues such as thread support, graphical user interface. In addition, we describe some problems discovered during the implementation process and propose alternative architecture of HAL for WIPI on Linux.

  • PDF

A Fast SIFT Implementation Based on Integer Gaussian and Reconfigurable Processor

  • Su, Le Tran;Lee, Jong Soo
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.2 no.3
    • /
    • pp.39-52
    • /
    • 2009
  • Scale Invariant Feature Transform (SIFT) is an effective algorithm in object recognition, panorama stitching, and image matching, however, due to its complexity, real time processing is difficult to achieve with software approaches. This paper proposes using a reconfigurable hardware processor with integer half kernel. The integer half kernel Gaussian reduces the Gaussian pyramid complexity in about half [] and the reconfigurable processor carries out a parallel implementation of a full search Fast SIFT algorithm. We use a low memory, fine grain single instruction stream multiple data stream (SIMD) pixel processor that is currently being developed. This implementation fully exposes the available parallelism of the SIFT algorithm process and exploits the processing and I/O capabilities of the processor which results in a system that can perform real time image and video compression. We apply this novel implementation to images and measure the effectiveness. Experimental simulation results indicate that the proposed implementation is capable of real time applications.

  • PDF