• Title/Summary/Keyword: Feature data file

Search Result 68, Processing Time 0.021 seconds

Support Vector Machines-based classification of video file fragments (서포트 벡터 머신 기반 비디오 조각파일 분류)

  • Kang, Hyun-Suk;Lee, Young-Seok
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.16 no.1
    • /
    • pp.652-657
    • /
    • 2015
  • BitTorrent is an innovative protocol related to file-sharing and file-transferring, which allows users to receive pieces of files from multiple sharer on the Internet to make the pieces into complete files. In reality, however, free distribution of illegal or copyright related video data is counted for crime. Difficulty of regulation on the copyright of data on BitTorrent is caused by the fact that data is transferred with the pieces of files instead of the complete file formats. Therefore, the classification process of file formats of the digital contents should take precedence in order to restore digital contents from the pieces of files received from BitTorrent, and to check the violation of copyright. This study has suggested SVM classifier for the classification of digital files, which has the feature vector of histogram differential on the pieces of files. The suggested classifier has evaluated the performance with the division factor by applying the classifier to three different formats of video files.

CutPaste-Based Anomaly Detection Model using Multi Scale Feature Extraction in Time Series Streaming Data

  • Jeon, Byeong-Uk;Chung, Kyungyong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.8
    • /
    • pp.2787-2800
    • /
    • 2022
  • The aging society increases emergency situations of the elderly living alone and a variety of social crimes. In order to prevent them, techniques to detect emergency situations through voice are actively researched. This study proposes CutPaste-based anomaly detection model using multi-scale feature extraction in time series streaming data. In the proposed method, an audio file is converted into a spectrogram. In this way, it is possible to use an algorithm for image data, such as CNN. After that, mutli-scale feature extraction is applied. Three images drawn from Adaptive Pooling layer that has different-sized kernels are merged. In consideration of various types of anomaly, including point anomaly, contextual anomaly, and collective anomaly, the limitations of a conventional anomaly model are improved. Finally, CutPaste-based anomaly detection is conducted. Since the model is trained through self-supervised learning, it is possible to detect a diversity of emergency situations as anomaly without labeling. Therefore, the proposed model overcomes the limitations of a conventional model that classifies only labelled emergency situations. Also, the proposed model is evaluated to have better performance than a conventional anomaly detection model.

Managing and Modeling Strategy of Geo-features in Web-based 3D GIS

  • Kim, Kyong-Ho;Choe, Seung-Keol;Lee, Jong-Hun;Yang, Young-Kyu
    • Proceedings of the KSRS Conference
    • /
    • 1999.11a
    • /
    • pp.75-79
    • /
    • 1999
  • Geo-features play a key role in object-oriented or feature-based geo-processing system. So the strategy for how-to-model and how-to-manage the geo-features builds the main architecture of the entire system and also supports the efficiency and functionality of the system. Unlike the conventional 2D geo-processing system, geo-features in 3B GIS have lots to be considered to model regarding the efficient manipulation and analysis and visualization. When the system is running on the Web, it should also be considered that how to leverage the level of detail and the level of automation of modeling in addition to the support for client side data interoperability. We built a set of 3D geo-features, and each geo-feature contains a set of aspatial data and 3D geo-primitives. The 3D geo-primitives contain the fundamental modeling data such as the height of building and the burial depth of gas pipeline. We separated the additional modeling data on the geometry and appearance of the model from the fundamental modeling data to make the table in database more concise and to allow the users more freedom to represent the geo-object. To get the users to build and exchange their own data, we devised a file format called VGFF 2.0 which stands for Virtual GIS File Format. It is to describe the three dimensional geo-information in XML(eXtensible Markup Language). The DTD(Document Type Definition) of VGFF 2.0 is parsed using the DOM(Document Object Model). We also developed the authoring tools for. users can make their own 3D geo-features and model and save the data to VGFF 2.0 format. We are now expecting the VGFF 2.0 evolve to the 3D version of SVG(Scalable Vector Graphics) especially for 3D GIS on the Web.

  • PDF

Implement of MapReduce-based Big Data Processing Scheme for Reducing Big Data Processing Delay Time and Store Data (빅데이터 처리시간 감소와 저장 효율성이 향상을 위한 맵리듀스 기반 빅데이터 처리 기법 구현)

  • Lee, Hyeopgeon;Kim, Young-Woon;Kim, Ki-Young
    • Journal of the Korea Convergence Society
    • /
    • v.9 no.10
    • /
    • pp.13-19
    • /
    • 2018
  • MapReduce, the Hadoop's essential core technology, is most commonly used to process big data based on the Hadoop distributed file system. However, the existing MapReduce-based big data processing techniques have a feature of dividing and storing files in blocks predefined in the Hadoop distributed file system, thus wasting huge infrastructure resources. Therefore, in this paper, we propose an efficient MapReduce-based big data processing scheme. The proposed method enhances the storage efficiency of a big data infrastructure environment by converting and compressing the data to be processed into a data format in advance suitable for processing by MapReduce. In addition, the proposed method solves the problem of the data processing time delay arising from when implementing with focus on the storage efficiency.

3D Shape Reconstruction of Cross-sectional Images using Image Processing Technology and B-spline Approximation (영상 처리 기법과 B-spline 근사화를 이용한 단면영상의 3차원 재구성)

  • 임오강;이진식;김종구
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2001.10a
    • /
    • pp.93-100
    • /
    • 2001
  • The three dimensional(3D) reconstruction from two dimensional(2D) image data is using in many fields such as RPD(Rapid Product Development) and reverse engineering. In this paper, the main step of 3D reconstruction is comprised of two steps : image processing step and B-spline surface approximation step. In the image processing step, feature points of each cross-section are obtained by means of several image processing technologies. In the B-spline surface approximation step, using the data of feature points obtained in the image processing step, the control points of B-spline surface are obtained, which are used for IGES file of 3D CAD model.

  • PDF

Vector Approximation Bitmap Indexing Method for High Dimensional Multimedia Database (고차원 멀티미디어 데이터 검색을 위한 벡터 근사 비트맵 색인 방법)

  • Park Joo-Hyoun;Son Dea-On;Nang Jong-Ho;Joo Bok-Gyu
    • The KIPS Transactions:PartD
    • /
    • v.13D no.4 s.107
    • /
    • pp.455-462
    • /
    • 2006
  • Recently, the filtering approach using vector approximation such as VA-file[1] or LPC-file[2] have been proposed to support similarity search in high dimensional data space. This approach filters out many irrelevant vectors by calculating the approximate distance from a query vector using the compact approximations of vectors in database. Accordingly, the total elapsed time for similarity search is reduced because the disk I/O time is eliminated by reading the compact approximations instead of original vectors. However, the search time of the VA-file or LPC-file is not much lessened compared to the brute-force search because it requires a lot of computations for calculating the approximate distance. This paper proposes a new bitmap index structure in order to minimize the calculating time. To improve the calculating speed, a specific value of an object is saved in a bit pattern that shows a spatial position of the feature vector on a data space, and the calculation for a distance between objects is performed by the XOR bit calculation that is much faster than the real vector calculation. According to the experiment, the method that this paper suggests has shortened the total searching time to the extent of about one fourth of the sequential searching time, and to the utmost two times of the existing methods by shortening the great deal of calculating time, although this method has a longer data reading time compared to the existing vector approximation based approach. Consequently, it can be confirmed that we can improve even more the searching performance by shortening the calculating time for filtering of the existing vector approximation methods when the database speed is fast enough.

Optimal Tool Length Computation of NC Data for 5-axis Ball-ended Milling (5축 볼엔드밀 가공 NC 데이터의 최적 공구 길이 계산)

  • Cho, Hyeon-Uk;Park, Jung-Whan
    • Korean Journal of Computational Design and Engineering
    • /
    • v.15 no.5
    • /
    • pp.354-361
    • /
    • 2010
  • The paper presents an efficient computation of optimal tool length for 5-axis mold & die machining. The implemented procedure processes an NC file as an initial input, where the NC data is generated by another commercial CAM system. A commercial CAM system generates 5-axis machining NC data which, in its own way, is optimal based on pre-defined machining condition such as tool-path pattern, tool-axis control via inclination angles, etc. The proper tool-length should also be provided. The tool-length should be as small as possible in order to enhance machinability as well as surface finish. A feasible tool-length at each NC block can be obtained by checking interference between workpiece and tool components, usually when the tool-axis is not modified at this stage for most CAM systems. Then the minimum feasible tool-length for an NC file consisting of N blocks is the maximum of N tool-length values. However, it can be noted that slight modification of tool-axis at each block may reduce the minimum feasible tool-length in mold & die machining. This approach can effectively be applied in machining feature regions such as steep wall or deep cavity. It has been implemented and is used at a molding die manufacturing company in Korea.

A Vertical File Partitioning Method Using SOFM in Database Design (데이터베이스 설계에서 SOFM 을 이용한 화일 수직분할 방법)

  • Shin, K.H.;Kim, J.Y.
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.24 no.4
    • /
    • pp.661-671
    • /
    • 1998
  • It is important to minimize the number of disk accesses which is necessary to transfer data in disk into main memory when processing transactions in physical database design. A vertical file partitioning method is used to reduce the number of disk accesses by partitioning relations vertically and accessing only necessay fragments. In this paper, SOFM(Self-Organizing Feature Maps) network is used to solve vertical partitioning problems. This paper shows that SOFM network is efficient in solving vertical partitioning problem by comparing approximate solution of SOFM network with optimal solution of N-ary branch and bound method. And this paper presents a heuristic algorithm for allocating duplicate attributes to vertically partitioned fragments. As branch and bound method requires particularly much computing time to solve large-sized problems, it is shown that SOFM network is able to overcome this limitation of branch and bound method and solve large-sized problems efficiently in a short time.

  • PDF

Automatic Generation of Interactive 3D PDF Document in a 3D Viewer Environment (CAD 뷰어 기반 대화형 3D PDF 문서 생성 자동화)

  • Park, Kyeong-Ho;Choi, Young;Yang, Sang-Wook;Song, In-Ho
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.25 no.4
    • /
    • pp.77-85
    • /
    • 2008
  • PDF is widely accepted as a standard document format and now it supports 3D contents as well. Within the engineering application areas, this new 3D feature may be used to support sharing of 3D documents and thus collaboration between engineering departments, suppliers and partners. In this paper, we describe a system that automatically generates formatted engineering documents including 3D data converted from 3D applications such as commercial 3D CAD viewer. The system consists of two major modules. One is U3D conversion module and the other is PDF conversion module. U3D conversion module extracts geometry, view data, assembly and disassembly information from 3D viewer and converts to U3D format, currently in IDTF text file format. PDF conversion module generates a PDF file and inserts U3D data, various annotation information, and scripts for custom generated operations such as assembly and disassembly in the PDF document.

A Study on Malware Identification System Using Static Analysis Based Machine Learning Technique (정적 분석 기반 기계학습 기법을 활용한 악성코드 식별 시스템 연구)

  • Kim, Su-jeong;Ha, Ji-hee;Oh, Soo-hyun;Lee, Tae-jin
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.29 no.4
    • /
    • pp.775-784
    • /
    • 2019
  • Malware infringement attacks are continuously increasing in various environments such as mobile, IOT, windows and mac due to the emergence of new and variant malware, and signature-based countermeasures have limitations in detection of malware. In addition, analytical performance is deteriorating due to obfuscation, packing, and anti-VM technique. In this paper, we propose a system that can detect malware based on machine learning by using similarity hashing-based pattern detection technique and static analysis after file classification according to packing. This enables more efficient detection because it utilizes both pattern-based detection, which is well-known malware detection, and machine learning-based detection technology, which is advantageous for detecting new and variant malware. The results of this study were obtained by detecting accuracy of 95.79% or more for benign sample files and malware sample files provided by the AI-based malware detection track of the Information Security R&D Data Challenge 2018 competition. In the future, it is expected that it will be possible to build a system that improves detection performance by applying a feature vector and a detection method to the characteristics of a packed file.