• Title/Summary/Keyword: Block partition

Search Result 77, Processing Time 0.025 seconds

An Early Termination Algorithm of Prediction Unit (PU) Search for Fast HEVC Encoding (HEVC 고속 부호화를 위한 PU 탐색 조기 종료 기법)

  • Kim, Jae-Wook;Kim, Dong-Hyun;Kim, Jae-Gon
    • Journal of Broadcast Engineering
    • /
    • v.19 no.5
    • /
    • pp.627-630
    • /
    • 2014
  • The latest video coding standard, high efficiency video coding (HEVC) achieves high coding efficiency by employing a quadtree-based coding unit (CU) block partitioning structure which allows recursive splitting into four equally sized blocks. At each depth level, each CU is partitioned into variable sized blocks of prediction units (PUs). However, the determination of the best CU partition for each coding tree unit (CTU) and the best PU mode for each CU causes a dramatic increase in computational complexity. To reduce such computational complexity, we propose a fast PU decision algorithm that early terminates PU search. The proposed method skips the computation of R-D cost for certain PU modes in the current CU based on the best mode and the rate-distortion (RD) cost of the upper depth CU. Experimental results show that the proposed method reduces the computational complexity of HM12.0 to 18.1% with only 0.2% increases in BD-rate.

Design and Performance Analysis of the SPW Method for PAPR Reduction in OFDM System (OFDM 시스템에서 PAPR 처감을 위한 SPW 방식의 설계와 성능 분석)

  • 이재은;유흥균;정영호;함영권
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.14 no.7
    • /
    • pp.677-684
    • /
    • 2003
  • This paper addresses the subblock phase weighting(SPW) method to reduce the PAPR in OFDM system. This method divides the input block of OFDM signal into many subblocks and lower the peak power by weighting the phase of each subblocks properly. SPW method can be realized by only one IFFT. PAPR reduction performance is novelly examined when the adjacent, interleaved and random subblock partitioning schemes are used in the SPW system. The random subblock partition scheme has the most effective. More subblocks can effectively reduce the PAPR, but there is a problem that the processing time of iteration is increased. We propose a new weighting factor combination of the complementary sequence characteristic with threshold technique. OFDM data can be recovered by the inserted side information of weighting factor in the feed forward type. Also, BER performance of this SPW system is analyzed when error happens in the side information.

Fast Mode Decision for H.264/AVC P Slices Using Classification of SKIP Mode Distortion (SKIP 모드 왜곡의 구분을 통한 H.264/AVC 부호화 P 슬라이스에서의 고속 모드 결정 방법)

  • You, Jong-Min;Jeong, Je-Chang
    • Journal of Broadcast Engineering
    • /
    • v.14 no.1
    • /
    • pp.28-35
    • /
    • 2009
  • H.264/AVC, a recently developed video compression standard, is used for various applications because of its high coding efficiency. Variable block mode plays important role in the high coding efficiency of H.264/AVC but involves significant computations to select the optimal mode. In this paper, a fast mode decision method for H.264/AVC P slices is presented. To reduce computations for mode decision, the proposed mode decision method skips the mode decision processes for small partition modes using distortions of SKIP mode and intra16x16 mode. The experimental results show that the proposed method can reduce encoding time up to 66.41% while maintaining compression efficiency.

A Study on the Interframe Image Coding Using Motion Compensated and Classified Vector Quantizer (Ⅰ: Theory and Computer Simulation) (이동 보상과 분류 벡터 양자화기를 이용한 영상 부호화에 관한 연구 (Ⅰ: 이론및 모의실험))

  • Kim, Joong-Nam;Choi, Sung-Nam;Park, Kyu-Tae
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.27 no.3
    • /
    • pp.13-20
    • /
    • 1990
  • This paper describes an interframe image coding using motion compensated and classified vector quantizer (MC-CVQ). It is essential to carefully encode blocks with significant pels in motion compensated vector quantizers (MCVQ). In this respect, we propose a new CVQ algorithm which is appropriate to the coding of interframe prediction error after motion compensation. In order to encode an image efficiently at a low bit rate, we partition each block, which is the processing element in MC, into equally sized 4 vectors, and classify vectors into 15 classes according to the position of significant pels. Vectors in each class are then encoded by the vector quantizer with the codebook independently designed for the class. The computer simulation shows that the signal-to-noise ratio and the average bit rate of MC-CVQ are 35-37dB and 0.2-0.25bit/pel, respectively, for the videophone or video conference type image.

  • PDF

A New Efficient Group-wise Spatial Multiplexing Design for Closed-Loop MIMO Systems (폐루프 다중입출력 시스템을 위한 효율적인 그룹별 공간 다중화 기법 설계)

  • Moon, Sung-Myun;Lee, Heun-Chul;Kim, Young-Tae;Lee, In-Kyu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.4A
    • /
    • pp.322-331
    • /
    • 2010
  • This paper introduces a new efficient design scheme for spatial multiplexing (SM) systems over closed loop multiple-input multiple-output (MIMO) wireless channels. Extending the orthogonalized spatial multiplexing (OSM) scheme which was developed recently for transmitting two data streams, we propose a new SM scheme where a larger number of data streams can be supported. To achieve this goal, we partition the data streams into several subblocks and execute the block-diagonalization process at the receiver. The proposed scheme still guarantees single-symbol maximum likelihood (ML) detection with small feedback information. Simulation results verify that the proposed scheme achieves a huge performance gain at a bit error rate (BER) of $10^{-4}$ over conventional closed-loop schemes based on minimum mean-square error (MSE) or bit error rate (BER) criterion. We also show that an additional 2.5dB gain can be obtained by optimizing the group selection with extra feedback information.

Gamma Camera Design to Improve Spatial Resolution and Sensitivity (공간분해능 및 민감도 향상을 위한 새로운 감마카메라 설계)

  • Seung-Hun Kang;Seung-Jae Lee
    • Journal of the Korean Society of Radiology
    • /
    • v.17 no.2
    • /
    • pp.201-206
    • /
    • 2023
  • In order to improve the spatial resolution of the gamma camera, the size of the hole in the collimator must be reduced, so the sensitivity is reduced. In order to improve the sensitivity, the size of the hole must be increased, and thus the spatial resolution is reduced. In other words, spatial resolution and sensitivity show opposite characteristics. In this study, a gamma camera was designed to improve both spatial resolution and sensitivity. In order to obtain higher sensitivity in gamma cameras with the same spatial resolution, the structure of the scintillator was designed differently from the existing system. A scintillation pixel was used, and a partition wall was placed between the scintillation pixels to prevent incident gamma rays from being transmitted to other scintillation pixels to interact. Geant4 Application for Tomographic Emission (GATE) simulation was performed to evaluate the performance of the designed gamma camera. When the same sensitivity as the block-type scintillator was obtained, the spatial resolution increased by 16.5%, and when the same spatial resolution was obtained, the sensitivity increased by 61.5%. It is considered that the use of the gamma camera designed in this study can improve the sensitivity compared to the existing system while securing excellent spatial resolution.

Database Security System supporting Access Control for Various Sizes of Data Groups (다양한 크기의 데이터 그룹에 대한 접근 제어를 지원하는 데이터베이스 보안 시스템)

  • Jeong, Min-A;Kim, Jung-Ja;Won, Yong-Gwan;Bae, Suk-Chan
    • The KIPS Transactions:PartD
    • /
    • v.10D no.7
    • /
    • pp.1149-1154
    • /
    • 2003
  • Due to various requirements for the user access control to large databases in the hospitals and the banks, database security has been emphasized. There are many security models for database systems using wide variety of policy-based access control methods. However, they are not functionally enough to meet the requirements for the complicated and various types of access control. In this paper, we propose a database security system that can individually control user access to data groups of various sites and is suitable for the situation where the user's access privilege to arbitrary data is changed frequently. Data group(s) in different sixes d is defined by the table name(s), attribute(s) and/or record key(s), and the access privilege is defined by security levels, roles and polices. The proposed system operates in two phases. The first phase is composed of a modified MAC (Mandatory Access Control) model and RBAC (Role-Based Access Control) model. A user can access any data that has lower or equal security levels, and that is accessible by the roles to which the user is assigned. All types of access mode are controlled in this phase. In the second phase, a modified DAC(Discretionary Access Control) model is applied to re-control the 'read' mode by filtering out the non-accessible data from the result obtained at the first phase. For this purpose, we also defined the user group s that can be characterized by security levels, roles or any partition of users. The policies represented in the form of Block(s, d, r) were also defined and used to control access to any data or data group(s) that is not permitted in 'read ' mode. With this proposed security system, more complicated 'read' access to various data sizes for individual users can be flexibly controlled, while other access mode can be controlled as usual. An implementation example for a database system that manages specimen and clinical information is presented.