• Title/Summary/Keyword: 패킹

Search Result 170, Processing Time 0.032 seconds

A Patch Packing Method Using Guardband for Efficient 3DoF+ Video Coding (3DoF+ 비디오의 효율적인 부호화를 위한 보호대역을 사용한 패치 패킹 기법)

  • Kim, Hyun-Ho;Kim, Yong-Ju;Kim, Jae-Gon
    • Journal of Broadcast Engineering
    • /
    • v.25 no.2
    • /
    • pp.185-191
    • /
    • 2020
  • MPEG-I is actively working on standardization on the immersive video coding which provides up to 6 degree of freedom (6DoF) in terms of viewpoint. In a virtual space of 3DoF+, which is defined as an extension of 360 with motion parallax, looking at the scene from another viewpoint (another position in space) requires rendering an additional viewpoint using multiple videos included in the 3DoF+ video. In the MPEG-I Visual workgroup, efficient coding methods for 3DoF+ video are being studied, and they released Test Model for Immersive Video (TMIV) recently. This paper presents a patch packing method which packs the patches into atlases efficiently for improving coding efficiency of 3DoF+ video in TMIV. The proposed method improves the reconstructed view quality with reduced coding artifacts by introducing guardbands between patches in the atlas.

Packer Identification Using Adaptive Boosting Algorithm (Adaptive Boosting을 사용한 패커 식별 방법 연구)

  • Jang, Yun-Hwan;Park, Seong-Jun;Park, Yongsu
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.30 no.2
    • /
    • pp.169-177
    • /
    • 2020
  • Malware analysis is one of the important concerns of computer security, and advances in analysis techniques have become important for computer security. In the past, the signature-based method was used to detect malware. However, as the percentage of packed malware increased, it became more difficult to detect using the conventional method. In this paper, we propose a method for identifying packers of packed programs using machine learning. The proposed method parses the packed program to extract specific PE information that can identify the packer and identifies the packer using the Adaptive Boosting algorithm among the machine learning models. To verify the accuracy of the proposed method, we collected and tested 391 programs packed with 12 types of packers and found that the packers were identified with an accuracy of about 99.2%. In addition, we presented the results of identification using PEiD, a signature-based PE identification tool, and existing machine learning method. The proposed method shows better performance in terms of accuracy and speed in identifying packers than existing methods.

EPR : Enhanced Parallel R-tree Indexing Method for Geographic Information System (EPR : 지리 정보 시스템을 위한 향상된 병렬 R-tree 색인 기법)

  • Lee, Chun-Geun;Kim, Jeong-Won;Kim, Yeong-Ju;Jeong, Gi-Dong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.9
    • /
    • pp.2294-2304
    • /
    • 1999
  • Our research purpose in this paper is to improve the performance of query processing in GIS(Geographic Information System) by enhancing the I/O performance exploiting parallel I/O and efficient disk access. By packing adjacent spatial data, which are very likely to be referenced concurrently, into one block or continuous disk blocks, the number of disk accesses and the disk access overhead for query processing can be decreased, and this eventually leads to the I/O time decrease. So, in this paper, we proposes EPR(Enhanced Parallel R-tree) indexing method which integrates the parallel I/O method of the previous Parallel R-tree method and a packing-based clustering method. The major characteristics of EPR method are as follows. First, EPR method arranges spatial data in the increasing order of proximity by using Hilbert space filling curve, and builds a packed R-tree by bottom-up manner. Second, with packing-based clustering in which arranged spatial data are clustered into continuous disk blocks, EPR method generates spatial data clusters. Third, EPR method distributes EPR index nodes and spatial data clusters on multiple disks through round-robin striping. Experimental results show that EPR method achieves up to 30% or more gains over PR method in query processing speed. In particular, the larger the size of disk blocks is and the smaller the size of spatial data objects is, the better the performance of query processing by EPR method is.

  • PDF

Leakage Analysis of Angled-Labyrinth-Packing-Ring Seal for Steam Turbine Using CFD (CFD를 사용한 스팀터빈용 각이 진 패킹 링 실의 누설량 예측)

  • Ha, Tae-Woong;Kang, Jung-Hyun
    • Tribology and Lubricants
    • /
    • v.25 no.5
    • /
    • pp.298-304
    • /
    • 2009
  • An angled labyrinth seal is used for the diaphragm-packing-ring seal design of steam turbine due to its leakage reduction characteristic. CFD analysis using FLUENT has been performed to predict leakage and determine an optimum slanted angle which yields the best leakage reduction. Results show that the optimum value of slanted angle is $-30^{\circ}$ independent of number of labyrinth teeth, inlet pressure, and tooth height to pitch ratio. 3D CFD analysis has been performed for predicting leakage of the angled labyrinth seal. Comparing with the result of 2D CFD analysis, 3D CFD analysis shows 1.4% smaller.

Development of Algorithm for Two Dimensional Automatic Mesh Generation and Remeshing Technique Using Bubble Packing Method (II) - Nonlinear Analysis - (버블패킹방법을 이용한 2차원 자동격자 생성 및 재구성 알고리듬 개발 (II) -비선형 해석-)

  • Jeong, Sun-Wan;Kim, Seung-Jo
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.25 no.12
    • /
    • pp.1926-1932
    • /
    • 2001
  • In this second part of the paper, the automatic mesh generation and remeshing algorithm using bubble packing method is applied to the nonlinear problem. The remeshing/refinement procedure is necessary in the large deformation process especially because the mesh distortion deteriorates the convergence and accuracy. To perform the nonliear analysis, the transfer of state variables such as displacement and strain is added to the algorithm of Part 1. The equilibrium equation based on total Lagrangian formulation and elasto-viscoplastic model is used. For the numerical experiment, the upsetting process including the contact constraint condition is analyzed by two refinement criteria. And from the result, it is addressed that the present algorithm can generate the refined meshes easily at the largely deformed area with high error.