• Title/Summary/Keyword: binary vector

Search Result 373, Processing Time 0.024 seconds

Authorship Attribution Framework Using Survival Network Concept : Semantic Features and Tolerances (서바이벌 네트워크 개념을 이용한 저자 식별 프레임워크: 의미론적 특징과 특징 허용 범위)

  • Hwang, Cheol-Hun;Shin, Gun-Yoon;Kim, Dong-Wook;Han, Myung-Mook
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.30 no.6
    • /
    • pp.1013-1021
    • /
    • 2020
  • Malware Authorship Attribution is a research field for identifying malware by comparing the author characteristics of unknown malware with the characteristics of known malware authors. The authorship attribution method using binaries has the advantage that it is easy to collect and analyze targeted malicious codes, but the scope of using features is limited compared to the method using source code. This limitation has the disadvantage that accuracy decreases for a large number of authors. This study proposes a method of 'Defining semantic features from binaries' and 'Defining allowable ranges for redundant features using the concept of survival network' to complement the limitations in the identification of binary authors. The proposed method defines Opcode-based graph features from binary information, and defines the allowable range for selecting unique features for each author using the concept of a survival network. Through this, it was possible to define the feature definition and feature selection method for each author as a single technology, and through the experiment, it was confirmed that it was possible to derive the same level of accuracy as the source code-based analysis with an improvement of 5.0% accuracy compared to the previous study.

Object Tracking Based on Exactly Reweighted Online Total-Error-Rate Minimization (정확히 재가중되는 온라인 전체 에러율 최소화 기반의 객체 추적)

  • JANG, Se-In;PARK, Choong-Shik
    • Journal of Intelligence and Information Systems
    • /
    • v.25 no.4
    • /
    • pp.53-65
    • /
    • 2019
  • Object tracking is one of important steps to achieve video-based surveillance systems. Object tracking is considered as an essential task similar to object detection and recognition. In order to perform object tracking, various machine learning methods (e.g., least-squares, perceptron and support vector machine) can be applied for different designs of tracking systems. In general, generative methods (e.g., principal component analysis) were utilized due to its simplicity and effectiveness. However, the generative methods were only focused on modeling the target object. Due to this limitation, discriminative methods (e.g., binary classification) were adopted to distinguish the target object and the background. Among the machine learning methods for binary classification, total error rate minimization can be used as one of successful machine learning methods for binary classification. The total error rate minimization can achieve a global minimum due to a quadratic approximation to a step function while other methods (e.g., support vector machine) seek local minima using nonlinear functions (e.g., hinge loss function). Due to this quadratic approximation, the total error rate minimization could obtain appropriate properties in solving optimization problems for binary classification. However, this total error rate minimization was based on a batch mode setting. The batch mode setting can be limited to several applications under offline learning. Due to limited computing resources, offline learning could not handle large scale data sets. Compared to offline learning, online learning can update its solution without storing all training samples in learning process. Due to increment of large scale data sets, online learning becomes one of essential properties for various applications. Since object tracking needs to handle data samples in real time, online learning based total error rate minimization methods are necessary to efficiently address object tracking problems. Due to the need of the online learning, an online learning based total error rate minimization method was developed. However, an approximately reweighted technique was developed. Although the approximation technique is utilized, this online version of the total error rate minimization could achieve good performances in biometric applications. However, this method is assumed that the total error rate minimization can be asymptotically achieved when only the number of training samples is infinite. Although there is the assumption to achieve the total error rate minimization, the approximation issue can continuously accumulate learning errors according to increment of training samples. Due to this reason, the approximated online learning solution can then lead a wrong solution. The wrong solution can make significant errors when it is applied to surveillance systems. In this paper, we propose an exactly reweighted technique to recursively update the solution of the total error rate minimization in online learning manner. Compared to the approximately reweighted online total error rate minimization, an exactly reweighted online total error rate minimization is achieved. The proposed exact online learning method based on the total error rate minimization is then applied to object tracking problems. In our object tracking system, particle filtering is adopted. In particle filtering, our observation model is consisted of both generative and discriminative methods to leverage the advantages between generative and discriminative properties. In our experiments, our proposed object tracking system achieves promising performances on 8 public video sequences over competing object tracking systems. The paired t-test is also reported to evaluate its quality of the results. Our proposed online learning method can be extended under the deep learning architecture which can cover the shallow and deep networks. Moreover, online learning methods, that need the exact reweighting process, can use our proposed reweighting technique. In addition to object tracking, the proposed online learning method can be easily applied to object detection and recognition. Therefore, our proposed methods can contribute to online learning community and object tracking, detection and recognition communities.

Classifying Windows Executables using API-based Information and Machine Learning (API 정보와 기계학습을 통한 윈도우 실행파일 분류)

  • Cho, DaeHee;Lim, Kyeonghwan;Cho, Seong-je;Han, Sangchul;Hwang, Young-sup
    • Journal of KIISE
    • /
    • v.43 no.12
    • /
    • pp.1325-1333
    • /
    • 2016
  • Software classification has several applications such as copyright infringement detection, malware classification, and software automatic categorization in software repositories. It can be also employed by software filtering systems to prevent the transmission of illegal software. If illegal software is identified by measuring software similarity in software filtering systems, the average number of comparisons can be reduced by shrinking the search space. In this study, we focused on the classification of Windows executables using API call information and machine learning. We evaluated the classification performance of machine learning-based classifier according to the refinement method for API information and machine learning algorithm. The results showed that the classification success rate of SVM (Support Vector Machine) with PolyKernel was higher than other algorithms. Since the API call information can be extracted from binary executables and machine learning-based classifier can identify tampered executables, API call information and machine learning-based software classifiers are suitable for software filtering systems.

Compiler Analysis Framework Using SVM-Based Genetic Algorithm : Feature and Model Selection Sensitivity (SVM 기반 유전 알고리즘을 이용한 컴파일러 분석 프레임워크 : 특징 및 모델 선택 민감성)

  • Hwang, Cheol-Hun;Shin, Gun-Yoon;Kim, Dong-Wook;Han, Myung-Mook
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.30 no.4
    • /
    • pp.537-544
    • /
    • 2020
  • Advances in detection techniques, such as mutation and obfuscation, are being advanced with the development of malware technology. In the malware detection technology, unknown malware detection technology is important, and a method for Malware Authorship Attribution that detects an unknown malicious code by identifying the author through distributed malware is being studied. In this paper, we try to extract the compiler information affecting the binary-based author identification method and to investigate the sensitivity of feature selection, probability and non-probability models, and optimization to classification efficiency between studies. In the experiment, the feature selection method through information gain and the support vector machine, which is a non-probability model, showed high efficiency. Among the optimization studies, high classification accuracy was obtained through feature selection and model optimization through the proposed framework, and resulted in 48% feature reduction and 53 faster execution speed. Through this study, we can confirm the sensitivity of feature selection, model, and optimization methods to classification efficiency.

A Mechanism to Determine Method Location among Classes using Neural Network (신경망을 이용한 클래스 간 메소드 위치 결정 메커니즘)

  • Jung, Young-A.;Park, Young-B.
    • The KIPS Transactions:PartB
    • /
    • v.13B no.5 s.108
    • /
    • pp.547-552
    • /
    • 2006
  • There have been various cohesion measurements studied considering reference relation among attributes and methods in a class. Generally, these cohesion measurement are camed out in one class. If the range of reference relation considered are extended from one class to two classes, we could find out the reference relation between two classes. Tn this paper, we proposed a neural network to determine the method location. Neural network is effective to predict output value from input data not to be included in training and generalize after training input and output pattern repeatedly. Learning vector is generated with 30-dimensional input vector and one target binary values of method location in a constraint that there are two classes which have less than or equal to 5 attributes and methods The result of the proposed neural network is about 95% in cross-validation and 88% in testing.

The development of herbicide-resistant maize: stable Agrobacterium-mediated transformation of maize using explants of type II embryogenic calli

  • Kim, Hyun A.;Utomo, Setyo Dwi;Kwon, Suk Yoon;Min, Sung Ran;Kim, Jin Seog;Yoo, Han Sang;Choi, Pil Son
    • Plant Biotechnology Reports
    • /
    • v.3 no.4
    • /
    • pp.277-283
    • /
    • 2009
  • One of the limitations to conducting maize Agrobacterium-mediated transformation using explants of immature zygotic embryos routinely is the availability of the explants. To produce immature embryos routinely and continuously requires a well-equipped greenhouse and laborious artificial pollination. To overcome this limitation, an Agrobacterium-mediated transformation system using explants of type II embryogenic calli was developed. Once the type II embryogenic calli are produced, they can be subcultured and/or proliferated conveniently. The objectives of this study were to demonstrate a stable Agrobacterium-mediated transformation of maize using explants of type II embryonic calli and to evaluate the efficiency of the protocol in order to develop herbicide-resistant maize. The type II embryogenic calli were inoculated with Agrobacterium tumefaciens strain C58C1 carrying binary vector pTF102, and then were subsequently cultured on the following media: co-cultivation medium for 1 day, delay medium for 7 days, selection medium for $4{\times}14$ days, regeneration medium, and finally on germination medium. The T-DNA of the vector carried two cassettes (Ubi promoter-EPSPs ORF-nos and 35S promoter-bar ORF-nos). The EPSPs conferred resistance to glyphosate and bar conferred resistance to phosphinothricin. The confirmation of stable transformation and the efficiency of transformation was based on the resistance to phosphinothricin indicated by the growth of putative transgenic calli on selection medium amended with $4mg\;1^{-1}$ phosphinothricin, northern blot analysis of bar gene, and leaf painting assay for detection of bar gene-based herbicide resistance. Northern blot analysis and leaf painting assay confirmed the expression of bar transgenes in the $R_1$ generation. The average transformation efficiency was 0.60%. Based on northern blot analysis and leaf painting assay, line 31 was selected as an elite line of maize resistant to herbicide.

A Study on Face Recognition Based on Modified Otsu's Binarization and Hu Moment (변형 Otsu 이진화와 Hu 모멘트에 기반한 얼굴 인식에 관한 연구)

  • 이형지;정재호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.11C
    • /
    • pp.1140-1151
    • /
    • 2003
  • This paper proposes a face recognition method based on modified Otsu's binarization and Hu moment. Proposed method is robust to brightness, contrast, scale, rotation, and translation changes. As the proposed modified Otsu's binarization computes other thresholds from conventional Otsu's binarization, namely we create two binary images, we can extract higher dimensional feature vector. Here the feature vector has properties of robustness to brightness and contrast changes because the proposed method is based on Otsu's binarization. And our face recognition system is robust to scale, rotation, and translation changes because of using Hu moment. In the perspective of brightness, contrast, scale, rotation, and translation changes, experimental results with Olivetti Research Laboratory (ORL) database and the AR database showed that average recognition rates of conventional well-known principal component analysis (PCA) are 93.2% and 81.4%, respectively. Meanwhile, the proposed method for the same databases has superior performance of the average recognition rates of 93.2% and 81.4%, respectively.

Facial Expression Recognition Using SIFT Descriptor (SIFT 기술자를 이용한 얼굴 표정인식)

  • Kim, Dong-Ju;Lee, Sang-Heon;Sohn, Myoung-Kyu
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.5 no.2
    • /
    • pp.89-94
    • /
    • 2016
  • This paper proposed a facial expression recognition approach using SIFT feature and SVM classifier. The SIFT was generally employed as feature descriptor at key-points in object recognition fields. However, this paper applied the SIFT descriptor as feature vector for facial expression recognition. In this paper, the facial feature was extracted by applying SIFT descriptor at each sub-block image without key-point detection procedure, and the facial expression recognition was performed using SVM classifier. The performance evaluation was carried out through comparison with binary pattern feature-based approaches such as LBP and LDP, and the CK facial expression database and the JAFFE facial expression database were used in the experiments. From the experimental results, the proposed method using SIFT descriptor showed performance improvements of 6.06% and 3.87% compared to previous approaches for CK database and JAFFE database, respectively.

Rotation Angle Estimation Method using Radial Projection Profile (방사 투영 프로파일을 이용한 회전각 추정 방법)

  • Choi, Minseok
    • Journal of Convergence for Information Technology
    • /
    • v.11 no.10
    • /
    • pp.20-26
    • /
    • 2021
  • In this paper, we studied the rotation angle estimation methods required for image alignment in an image recognition environment. In particular, a rotation angle estimation method applicable to a low specification embedded-based environment was proposed and compared with the existing method using complex moment. The proposed method estimates the rotation angle through similarity mathcing of the 1D projection profile along the radial axis after converting an image into polar coordinates. In addition, it is also possible to select a method of using vector sum of the projection profile, which more simplifies the calculation. Through experiments conducted on binary pattern images and gray-scale images, it was shown that the estimation error of the proposed method is not significantly different from that of complex moment-based method and requires less computation and system resources. For future expansion, a study on how to match the rotation center in gray-scale images will be needed.

FORECAST OF DAILY MAJOR FLARE PROBABILITY USING RELATIONSHIPS BETWEEN VECTOR MAGNETIC PROPERTIES AND FLARING RATES

  • Lim, Daye;Moon, Yong-Jae;Park, Jongyeob;Park, Eunsu;Lee, Kangjin;Lee, Jin-Yi;Jang, Soojeong
    • Journal of The Korean Astronomical Society
    • /
    • v.52 no.4
    • /
    • pp.133-144
    • /
    • 2019
  • We develop forecast models of daily probabilities of major flares (M- and X-class) based on empirical relationships between photospheric magnetic parameters and daily flaring rates from May 2010 to April 2018. In this study, we consider ten magnetic parameters characterizing size, distribution, and non-potentiality of vector magnetic fields from Solar Dynamics Observatory (SDO)/Helioseismic and Magnetic Imager (HMI) and Geostationary Operational Environmental Satellites (GOES) X-ray flare data. The magnetic parameters are classified into three types: the total unsigned parameters, the total signed parameters, and the mean parameters. We divide the data into two sets chronologically: 70% for training and 30% for testing. The empirical relationships between the parameters and flaring rates are used to predict flare occurrence probabilities for a given magnetic parameter value. Major results of this study are as follows. First, major flare occurrence rates are well correlated with ten parameters having correlation coefficients above 0.85. Second, logarithmic values of flaring rates are well approximated by linear equations. Third, using total unsigned and signed parameters achieved better performance for predicting flares than the mean parameters in terms of verification measures of probabilistic and converted binary forecasts. We conclude that the total quantity of non-potentiality of magnetic fields is crucial for flare forecasting among the magnetic parameters considered in this study. When this model is applied for operational use, it can be used using the data of 21:00 TAI with a slight underestimation of 2-6.3%.