• Title/Summary/Keyword: Mode Decision

Search Result 463, Processing Time 0.022 seconds

A study on the Improvement of Performance for H.264/AVC Encoder (H.264/AVC 부호기의 성능 향상에 관한 연구)

  • Kim Yong-Wook;Huh Do-Cuen
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.7
    • /
    • pp.1405-1409
    • /
    • 2004
  • This paper is studied new block mode decision algorithm for H.264/AVC. The fast block mode decision algorithm is consist of block range decision algorithm. The block range decision algorithm classifies the block over 8$\times$8 size or below for 16${\times}$16 macroblock to decide the size and type of sub blocks. As the sub blocks of 8$\times$8, 8r4, 4$\times$8 and 4$\times$4, which are the blocks below 8$\times$8 size, include important motion information, the exact sub block decision is required. RDC(RDO cost) is used as the matching parameter for the exact sub block decision. RDC is calculated with motion strength which is the mean value of neighbor pixels of each sub block. The sub block range decision reduces encoding arithmetic amount by 34.62% on the average more than the case not using block range decision. The block mode decision using motion strength shows improvement of PSNR of 0.05[dB].

A BLMS Adaptive Receiver for Direct-Sequence Code Division Multiple Access Systems

  • Hamouda Walaa;McLane Peter J.
    • Journal of Communications and Networks
    • /
    • v.7 no.3
    • /
    • pp.243-247
    • /
    • 2005
  • We propose an efficient block least-mean-square (BLMS) adaptive algorithm, in conjunction with error control coding, for direct-sequence code division multiple access (DS-CDMA) systems. The proposed adaptive receiver incorporates decision feedback detection and channel encoding in order to improve the performance of the standard LMS algorithm in convolutionally coded systems. The BLMS algorithm involves two modes of operation: (i) The training mode where an uncoded training sequence is used for initial filter tap-weights adaptation, and (ii) the decision-directed where the filter weights are adapted, using the BLMS algorithm, after decoding/encoding operation. It is shown that the proposed adaptive receiver structure is able to compensate for the signal-to­noise ratio (SNR) loss incurred due to the switching from uncoded training mode to coded decision-directed mode. Our results show that by using the proposed adaptive receiver (with decision feed­back block adaptation) one can achieve a much better performance than both the coded LMS with no decision feedback employed. The convergence behavior of the proposed BLMS receiver is simulated and compared to the standard LMS with and without channel coding. We also examine the steady-state bit-error rate (BER) performance of the proposed adaptive BLMS and standard LMS, both with convolutional coding, where we show that the former is more superior than the latter especially at large SNRs ($SNR\;\geq\;9\;dB$).

Fast Mode Decision For Depth Video Coding Based On Depth Segmentation

  • Wang, Yequn;Peng, Zongju;Jiang, Gangyi;Yu, Mei;Shao, Feng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.4
    • /
    • pp.1128-1139
    • /
    • 2012
  • With the development of three-dimensional display and related technologies, depth video coding becomes a new topic and attracts great attention from industries and research institutes. Because (1) the depth video is not a sequence of images for final viewing by end users but an aid for rendering, and (2) depth video is simpler than the corresponding color video, fast algorithm for depth video is necessary and possible to reduce the computational burden of the encoder. This paper proposes a fast mode decision algorithm for depth video coding based on depth segmentation. Firstly, based on depth perception, the depth video is segmented into three regions: edge, foreground and background. Then, different mode candidates are searched to decide the encoding macroblock mode. Finally, encoding time, bit rate and video quality of virtual view of the proposed algorithm are tested. Experimental results show that the proposed algorithm save encoding time ranging from 82.49% to 93.21% with negligible quality degradation of rendered virtual view image and bit rate increment.

Fast Mode Decision Algorithm for H.264 using Mode Classification (H.264 표준에서 모드 분류를 이용한 고속 모드결정 방법)

  • Kim, Hee-Soon;Ho, Yo-Sung
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.44 no.3
    • /
    • pp.88-96
    • /
    • 2007
  • H.264 is a new international video coding standard that can achieve considerably higher coding efficiency than conventional standards. Its coding gain has been achieved by employing advanced video coding methods. Specially, the increased number of macroblock modes and the complex mode decision procedure using the Lagrangian optimization are the main factors for increasing coding efficiency. Although H.264 obtains improved coding efficiency, it is difficult to do an real-time encoding because it considers all coding parameters in the mode decision procedure. In this paper, we propose a fast mode decision algorithm which classifies the macroblock modes in order to determine the optimal mode having low complexity quickly. Simulation results show that the proposed algorithm can reduce the encoding time by 34.95% on average without significant PSNR degradation or bit-rate increment. In addition, in order to show the validity of simulation results, we set up a low boundary condition for coding efficiency and complexity and show that the proposed algorithm satisfies the low boundary condition.

Fast Inter Block Mode Decision Using Image Complexity in H.264/AVC (H.264/AVC에서 영상 복잡도를 이용한 고속 인터 블록 모드 결정)

  • Kim, Seong-Hee;Oh, Jeong-Su
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.11C
    • /
    • pp.925-931
    • /
    • 2008
  • In video coding standard H.264/AVC, variable block size mode algorithm improves compression efficiency but has need of a large amount of computation for various block modes and mode decision. Meanwhile, decided inter block modes depend on the complexity of a block image, and then the more complex a macroblock is, the smaller its block size is. This paper proposes fast inter block mode decision algorithm. It limits valid block modes to the block modes with a great chance for decision using the image complexity and carries out motion estimation rate-distortion optimization with only the valid block modes. In addition to that, it applies fast motion estimation PDE to the valid block modes with only the $16{\times}16$ block mode. The reference software JM 9.5 was executed to estimate the proposed algorithm's performance. The simulation results showed that the proposed algorithm could save about 24.12% of the averaged motion estimation time while keeping the image quality and the bit rate to be -0.02dB and -0.12% on the average, respectively.

Depth-of-interest-based Bypass Coding-unit Algorithm for Inter-prediction in High-efficiency Video Coding

  • Rhee, Chae Eun
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.5 no.4
    • /
    • pp.231-234
    • /
    • 2016
  • The next-generation video coding standard known as High-Efficiency Video Coding (HEVC) was developed with the aim of doubling the bitrate reduction offered by H.264/Advanced Video Coding (AVC) at the expense of an increase in computational complexity. Mode decision with motion estimation is still one of the most time-consuming computations in HEVC, as it is with H.264/AVC. Several schemes for a fast mode decision have been presented in reference software and in other studies. However, a possible speed-up in conventional schemes is sometimes insignificant for videos that have inhomogeneous spatial and temporal characteristics. This paper proposes a bypass algorithm to skip large-block-size predictions for videos where small block sizes are preferred over large ones. The proposed algorithm does not overlap with those in previous works, and thus, is easily used with other fast algorithms. Consequently, an independent speed-up is possible.

Fast Intra Mode Decision using Transform Coefficients (변환 계수를 이용한 고속 인트라모드 결정법)

  • Hwang Gyu-Yong;Park Jong-Bin;Jeon Byeung-Woo
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2006.08a
    • /
    • pp.255-258
    • /
    • 2006
  • In the H.264/AVC standard, intra prediction increases the coding efficiency of intra macroblocks and by applying rate-distortion optimization to each macroblock, it is possible to choose Inter or Intra encoding adaptively. This sort of encoding scheme, however, increases encoding complexity dramatically and causes troubles in practical applications of the real-time mobile environment. In order to decrease the complexity, variety of methods is proposed but most of those take only its current block into consideration for selecting candidate modes which naturally causes degradation in PSNR (Peak Signal to Noise Ratio). The proposed fast intra mode decision finds the candidate modes by analyzing transformed coefficients of neighboring blocks stored in the buffer at the encoder stage of input sequences. We verify this proposed scheme in complexity, PSNR and bit-rate.

  • PDF

A Fast Rough Mode Decision Algorithm for HEVC

  • Yao, Wei-Xin;Yang, Dan;Lu, Gui-Fu;Wang, Jun
    • Journal of Information Processing Systems
    • /
    • v.15 no.3
    • /
    • pp.492-499
    • /
    • 2019
  • HEVC is the high efficiency video coding standard, which provides better coding efficiency contrasted with the other video coding standard. But at the same time the computational complexity increases drastically. Thirty-five kinds of intra-prediction modes are defined in HEVC, while 9 kinds of intra prediction modes are defined in H.264/AVC. This paper proposes a fast rough mode decision (RMD) algorithm which adopts the smoothness of the up-reference pixels and the left-reference pixels to decrease the computational complexity. The three step search method is implemented in RMD process. The experimental results compared with HM13.0 indicate that the proposed algorithm can save 39.7% of the encoding time, while Bjontegaard delta bitrate (BDBR) is increased slightly by 1.35% and Bjontegaard delta peak signal-to-noise ratio (BDPSNR) loss is negligible.

A study on the Fast Block Mode Decision Algorithm for Inter Block (Inter 블록을 위한 고속 블록 모드 결정 알고리즘에 관한 연구)

  • 김용욱;허도근
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.6
    • /
    • pp.1121-1125
    • /
    • 2004
  • This paper is studied the fast block mode decision algorithm for H.264/AVC. The fast block mode decision algorithm is consist of block range decision and merge algorithm. The block range decision algorithm classifies the block over 8$\times$8 size or below for 16$\times$16 macroblock to decide the size and type of sub blocks. The block over 8$\times$8 size is divided into the blocks of 16$\times$8, 8$\times$16 and 16$\times$16 size using merging algorithm which is considered MVD(motion vector difference) of 8$\times$8 block. The sub block range decision reduces encoding arithmetic amount by 48.25% on the average more than the case not using block range decision.

Analyzing a Differentiation of IT Governance Decision Structure: Application of IT Strategic Grid Framework (IT 거버넌스 의사결정 구조의 차이 분석: IT 전략 그리드 프레임워크 적용)

  • Lee, Bong-Gyou;Choi, Dong-Jin;Lee, Young-Hee;Oh, Ik-Jin
    • The KIPS Transactions:PartD
    • /
    • v.15D no.2
    • /
    • pp.285-296
    • /
    • 2008
  • The purpose of this paper is to examine the IT governance decision structure of the four strategic modes of IT strategy grid, and compare and analyze the differences in the IT governance decision structure of companies that produce superior results and those that produce inferior results. The survey method was used for this paper, and data from a total of 209 companies that were listed on the KOSDAQ 300 and KOSPI 200 were used for the analysis. The results show that each mode has a different IT governance decision structure from the others, and the IT governance decision structure of companies with high results and those with low results are also different for each mode. The results of this paper are significant in that, for each mode, it presents the decision structure framework for promoting desirable behavior of companies carrying out IT governance.