• Title/Summary/Keyword: 중복제거기법

Search Result 221, Processing Time 0.026 seconds

Aggregated Encoder Control Exploiting Interlayer Statistical Characteristics for Advanced Terrestrial-DMB (지상파 DMB 고도화망에서 계층간 통계적 특성을 이용한 통합 부호기 제어)

  • Kim, Jin-Soo;Park, Jong-Kab;Seo, Kwang-Deok;Kim, Jae-Gon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.8
    • /
    • pp.1513-1526
    • /
    • 2009
  • The SVC (Scalable Video Coding) scheme can be effectively used for reducing the redundancy and for improving the coding efficiency but, it requires very high computational complexities. In order to accelerate the successful standardization and commercialization of the Advanced Terrestrial-DMB service, it is necessary to overcome this problem. For this aim, in this paper, we propose an efficient aggregated encoder control algorithm, which shows better performances than the conventional control scheme. Computer simulation result shows that the proposed scheme performs about up to 0.3dB better than those of the conventional scheme. Additionally, based on this control scheme, we propose a fast mode decision method by constraining the redundant coding modes based on the statistical properties of the quantization parameter in the spatial scalable encoder. Through computer simulations, it is shown that the proposed control schemes reduce the heavy computational burden up to 12% compared to the conventional scheme, while keeping the objective visual qualify very high.

Multiple ASR for efficient defense against brute force attacks (무차별 공격에 효과적인 다중 Address Space Randomization 방어 기법)

  • Park, Soo-Hyun;Kim, Sun-Il
    • The KIPS Transactions:PartC
    • /
    • v.18C no.2
    • /
    • pp.89-96
    • /
    • 2011
  • ASR is an excellent program security technique that protects various data memory areas without run-time overhead. ASR hides the addresses of variables from attackers by reordering variables within a data memory area; however, it can be broken by brute force attacks because of a limited data memory space. In this paper, we propose Multiple ASR to overcome the limitation of previous ASR approaches. Multiple ASR separates a data memory area into original and duplicated areas, and compares variables in each memory area to detect an attack. In original and duplicated data memory areas variables are arranged in the opposite order. This makes it impossible to overwrite the same variables in the different data areas in a single attack. Although programs with Multiple ASR show a relatively high run-time overhead due to duplicated execution, programs with many I/O operations such as web servers, a favorite attack target, show 40~50% overhead. In this paper we develop and test a tool that transforms a program into one with Multiple ASR applied.

Para-virtualized Library for Bare-metal Network Performance in Virtualized Environment (가상화 환경의 고성능 I/O를 위한 반가상화 라이브러리)

  • Lee, Dongwoo;Cho, Youngjoong;Eom, Young Ik
    • Journal of KIISE
    • /
    • v.41 no.9
    • /
    • pp.605-610
    • /
    • 2014
  • Now, virtualization is no more emerging research area, and we can easily find its application in our circumstance. Nevertheless, I/O workloads are reluctant to be applied in virtual environment since they still suffer from unacceptable performance degradation due to virtualization latency. Many previous papers identified that virtual I/O overhead is mainly caused by exits and redundant I/O stack, and proposed several techniques to reduce them. However, they still have some limitations. In this paper, we introduce a novel I/O virtualization framework which improves I/O performance by exploiting multicore architecture. We applied our framework to the virtual network, and it improves TCP throughput up to 169%, and decreases UDP latency up to 38% on the network with the 10Gbps NIC.

A Study on Motion Estimator Design Using Bit Plane (비트 플레인을 이용한 움직임 추정기 설계에 관한 연구)

  • 박종진;이권철;김은원;조원경
    • The Journal of Information Technology
    • /
    • v.3 no.2
    • /
    • pp.39-47
    • /
    • 2000
  • Among the compression methods of moving picture information, a motion estimation method is used to remove time-repeating. The Block Matching Algorithm in motion estimation methods is the commonest one. In recent days, it is required the more advanced high quality in many image processing fields, for example HDTV, etc. Therefore, we have to accomplish not by means of Partial Search Algorithm, but by means of Full Search Algorithm in Block Matching Algorithm. In this paper, it is suggested a structure that reduce total calculation quantity and size, because the structure using Bit Plane select and use only 3bit of 8bit luminance signal.

  • PDF

An Efficient Index Buffer Management Scheme for a B+ tree on Flash Memory (플래시 메모리상에 B+트리를 위한 효율적인 색인 버퍼 관리 정책)

  • Lee, Hyun-Seob;Joo, Young-Do;Lee, Dong-Ho
    • The KIPS Transactions:PartD
    • /
    • v.14D no.7
    • /
    • pp.719-726
    • /
    • 2007
  • Recently, NAND flash memory has been used for a storage device in various mobile computing devices such as MP3 players, mobile phones and laptops because of its shock-resistant, low-power consumption, and none-volatile properties. However, due to the very distinct characteristics of flash memory, disk based systems and applications may result in severe performance degradation when directly adopting them on flash memory storage systems. Especially, when a B-tree is constructed, intensive overwrite operations may be caused by record inserting, deleting, and its reorganizing, This could result in severe performance degradation on NAND flash memory. In this paper, we propose an efficient buffer management scheme, called IBSF, which eliminates redundant index units in the index buffer and then delays the time that the index buffer is filled up. Consequently, IBSF significantly reduces the number of write operations to a flash memory when constructing a B-tree. We also show that IBSF yields a better performance on a flash memory by comparing it to the related technique called BFTL through various experiments.

A Study on Physical Security factors of National Major Facilities - Focussed on Port Security - (국가중요시설의 물리적 보안 요인 분석 - 항만보안을 중심으로 -)

  • Lee, Min Hyung;Lee, Jung Hun
    • Convergence Security Journal
    • /
    • v.15 no.6_2
    • /
    • pp.45-53
    • /
    • 2015
  • The security activity suitable for the port can be achieved, provided that the physical security factors specialized for the port security should be presented as preceding conditions. The advanced research about the theoretical data of the port security factors is incomplete and the study on the physical security factors of the port facilities should be done. In this study, the necessity and suitability of port security factors was evaluated with Delphi technique. Consequently, 19 variables of physical security factors were derived in the primary survey and through the second survey of necessity evaluation and the third survey of suitability evaluation 12 variables were selected as the physical security factors of th port facilities.

An Atlas Generation Method with Tiny Blocks Removal for Efficient 3DoF+ Video Coding (효율적인 3DoF+ 비디오 부호화를 위한 작은 블록 제거를 통한 아틀라스 생성 기법)

  • Lim, Sung-Gyun;Kim, Hyun-Ho;Kim, Jae-Gon
    • Journal of Broadcast Engineering
    • /
    • v.25 no.5
    • /
    • pp.665-671
    • /
    • 2020
  • MPEG-I is actively working on standardization on the coding of immersive video which provides up to 6 degree of freedom (6DoF) in terms of viewpoint. 3DoF+ video, which provides motion parallax to omnidirectional view of 360 video, renders a view at any desired viewpoint using multiple view videos acquisitioned in a limited 3D space covered with upper body motion at a fixed position. The MPEG-I visual group is developing a test model called TMIV (Test Model for Immersive Video) in the process of development of the standard for 3DoF+ video coding. In the TMIV, the redundancy between a set of input view videos is removed, and several atlases are generated by packing patches including the remaining texture and depth regions into frames as compact as possible, and coded. This paper presents an atlas generation method that removes small-sized blocks in the atlas for more efficient 3DoF+ video coding. The proposed method shows a performance improvement of BD-rate bit savings of 0.7% and 1.4%, respectively, in natural and graphic sequences compared to TMIV.

Removal of Intersected Region for Efficient Transmission of Spatial Objects (공간 객체의 효율적 전송을 위한 교차영역의 제거)

  • Lee, Kyung-Mo;Park, Dong-Seon;Kim, Jae-Hong;Bae, Hae-Young
    • Journal of Korea Spatial Information System Society
    • /
    • v.1 no.2 s.2
    • /
    • pp.137-149
    • /
    • 1999
  • Spatial database systems in client-server environment have network overload due to the large amount of spatial data transmission. Users use the window query that loads partial region of a whole map for quick response time in the environment. A series of window query such as screen movement, enlargement or shrinkage requires data in similar region and this increases network overload by re-transmitting the same data in intersected region with the earlier transmitted region. Removing the transmitted data from query results can solve this problem. In this paper, we design and implement a spatial object manager in order to remove the intersected region occurred by a series of window query. The spatial object manager manages the object identifiers of transmitted objects and removes transmitted objects from spatial objects of the query result by using the removal technique of the intersected region for the transmission and comparison. We utilize GEOMania Millennium server, an open client-server spatial database system, as spatial object manager in this paper. The result of the performance evaluation shows that the spatial object manager removes the transmission of the data redundancy, reduces network overload and improves the overall system performance.

  • PDF

Efficient Multispectral Image Compression Using Variable Block Size Vector Quantization (가변 블럭 벡터 양자화를 이용한 효율적인 다분광 화상 데이터 압축)

  • Ban, Seong-Won;Kim, Byeong-Ju;Seok, Jeong-Yeop;Gwon, Seong-Geun;Gwon, Gi-Gu;Kim, Yeong-Chun;Lee, Geon-Il
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.38 no.6
    • /
    • pp.703-711
    • /
    • 2001
  • In this paper, we propose efficient multispectral image compression using variable block size vector quantization (VQ). In wavelet domain, we perform the variable block size VQ to remove intraband redundancy for a reference band image that has the lowest spatial variance and the best correlation with other band. And in wavelet domain, we perform the classified interband prediction to remove interband redundancy for the remaining bands. Then error wavelet coefficients between original image and predicted image are residual variable block size vector quantized to reduce prediction error. Experiments on remotely sensed satellite image show that coding efficiency of the proposed method is better than that of the conventional method.

  • PDF

Implementation of Personalized Recommendation System using RFM method in Mobile Internet Environment (모바일 환경하에 RFM 기법을 이용한 개인화된 추천 시스템 개발)

  • Cho, Young-Sung;Huh, Moon-Haeng;Ryu, Keun-Ho
    • Journal of the Korea Society of Computer and Information
    • /
    • v.13 no.2
    • /
    • pp.41-50
    • /
    • 2008
  • This paper proposes the recommendation system which is a new method using RFM method in mobile internet environment. Using a implict method which is not used user's profile for rating, is not used complicated query processing of the request and the response for rating, it is necessary for user to keep the RFM score about users and items based on the whole purchased data in order to recommend the items. As there are some problems which didn't exactly recommend the items with high purchasablity for new customer and new item that do not have the purchase history data. in existing recommendation systems, this proposing system is possible to solve existing problems, and also this system can avoid the duplicated recommendation by the cross comparison with the purchase history data. It can be improved and evaluated according to the criteria of logicality through the experiment with dataset, collected in a cosmetic cyber shopping mall. Finally, it is able to realize the personalized recommendation system with high purchasablity for one to one web marketing through the mobile internet.

  • PDF