• Title/Summary/Keyword: Fast Encoder Algorithm

Search Result 91, Processing Time 0.027 seconds

Sub-Sampled Pixels based Fast Mode Selection Algorithm for Intra Prediction in H.264/AVC (H.264/AVC 화면 내 예측을 위한 서브 샘플링 된 화소 기반 고속 모드 선택 기법)

  • Kim, Young-Joon;Kim, Won-Kyun;Jung, Dong-Jin;Jeong, Je-Chang
    • Journal of Broadcast Engineering
    • /
    • v.17 no.3
    • /
    • pp.471-479
    • /
    • 2012
  • Intra prediction is one of the significant techniques in H.264/AVC reference software; however, it has heavy computational complexity. In order to solve this problem, many fast algorithms have been proposed. In this paper, we propose a fast intra mode decision algorithm which predicts the edge direction of the current block using sub-sampled pixels to reduce high computational complexity of the H.264/AVC encoder. The proposed algorithm shows that it not only improves the coding performance but also reduces the computational complexity of the H.264/AVC encoder compared to previous algorithms. The experimental results show that the proposed algorithm achieves the encoding time reduction of 75.93% on an average with slight peak signal-to-noise ratio (PSNR) drop and bit-rate increment.

Implementation of the Fast XML Encoding System for Fast Web Services (Fast 웹서비스를 위한 Fast XML 인코딩 시스템 구현)

  • Choi, Bong-Kyu;Cho, Tae-Beom;Jung, Hoe-Kyung
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.4
    • /
    • pp.800-807
    • /
    • 2007
  • Web services came true a services integration, but the XML document decreases the efficiency or the whole application program with connects frequently in relatively slow communication media like network environment embedded system or use the resource limited small-sized instrument like mobile. Thereupon, ITU-T and ISO/IEC suggested encoding standard of binary XML. In this paper, implementation, of Fast XML encoding system through introduction Fast Infoset algorithm and Fast Schema algorithm for web services increase performance. And, offered of test bed that build of Fast Web Services system through Fast XML Encoder.

A Skipping Method of Transformation and Quantization Process for Fast H.264 Encoder (H.264의 고속 부호화 처리를 위한 변환 및 양자화 과정 생략 기법)

  • Song, Won-Seon;Hong, Min-Cheol
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.10C
    • /
    • pp.968-974
    • /
    • 2009
  • In this paper, we present a skipping method of transformation and quantization process using skip blocks estimation in fast H.264 video encoder. In order to reduce the complexity, we estimate skip mode blocks using integer discrete cosine transform and quantization and a skipping condition is derived by the analysis of those processes. The experimental result show that the proposed algorithm has effective estimations.

Fast mode decision by skipping variable block-based motion estimation and spatial predictive coding in H.264 (H.264의 가변 블록 크기 움직임 추정 및 공간 예측 부호화 생략에 의한 고속 모드 결정법)

  • 한기훈;이영렬
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.40 no.5
    • /
    • pp.417-425
    • /
    • 2003
  • H.264, which is the latest video coding standard of both ITU-T(International Telecommunication Union-Telecommunication standardization sector) and MPEG(Moving Picture Experts Group), adopts new video coding tools such as variable block size motion estimation, multiple reference frames, quarter-pel motion estimation/compensation(ME/MC), 4${\times}$4 Integer DCT(Discrete Cosine Transform), and Rate-Distortion Optimization, etc. These new video coding tools provide good coding of efficiency compared with existing video coding standards as H.263, MPEG-4, etc. However, these new coding tools require the increase of encoder complexity. Therefore, in order to apply H.264 to many real applications, fast algorithms are required for H.264 coding tools. In this paper, when encoder MacroBlock(MB) mode is decided by rate-distortion optimization tool, fast mode decision algorithm by skipping variable block size ME/MC and spatial-predictive coding, which occupies most encoder complexity, is proposed. In terms of computational complexity, the proposed method runs about 4 times as far as JM(Joint Model) 42 encoder of H.264, while the PSNR(peak signal-to-noise ratio)s of the decoded images are maintained.

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.

Efficient Computing Algorithm for Inter Prediction SAD of HEVC Encoder (HEVC 부호기의 Inter Prediction SAD 연산을 위한 효율적인 알고리즘)

  • Jeon, Sung-Hun;Ryoo, Kwangki
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2016.10a
    • /
    • pp.397-400
    • /
    • 2016
  • In this paper, we propose an efficient algorithm for computing architecture for high-performance Inter Prediction SAD HEVC encoder. HEVC Motion Estimation (ME) of the Inter Prediction is a process for searching for the currently high prediction block PU and the correlation in the interpolated reference picture in order to remove temporal redundancy. ME algorithm uses full search(FS) or fast search algorithm. Full search technique has the guaranteed optimal results but has many disadvantages which include high calculation and operational time due to the motion prediction with respect to all candidate blocks in a given search area. Therefore, this paper proposes a new algorithm which reduces the computational complexity by reusing the SAD operation in full search to reduce the amount of calculation and computational time of the Inter Prediction. The proposed algorithm is applied to an HEVC standard software HM16.12. There was an improved operational time of 61% compared to the traditional full search algorithm, BDBitrate was decreased by 11.81% and BDPSNR increased by about 0.5%.

  • PDF

Modified ORB-SLAM Algorithm for Precise Indoor Navigation of a Mobile Robot (모바일로봇의 정밀 실내주행을 위한 개선된 ORB-SLAM 알고리즘)

  • Ock, Yongjin;Kang, Hosun;Lee, Jangmyung
    • The Journal of Korea Robotics Society
    • /
    • v.15 no.3
    • /
    • pp.205-211
    • /
    • 2020
  • In this paper, we propose a modified ORB-SLAM (Oriented FAST and Rotated BRIEF Simultaneous Localization And Mapping) for precise indoor navigation of a mobile robot. The exact posture and position estimation by the ORB-SLAM is not possible all the times for the indoor navigation of a mobile robot when there are not enough features in the environment. To overcome this shortcoming, additional IMU (Inertial Measurement Unit) and encoder sensors were installed and utilized to calibrate the ORB-SLAM. By fusing the global information acquired by the SLAM and the dynamic local location information of the IMU and the encoder sensors, the mobile robot can be obtained the precise navigation information in the indoor environment with few feature points. The superiority of the modified ORB-SLAM was verified to compared with the conventional algorithm by the real experiments of a mobile robot navigation in a corridor environment.

An Error Control Algorithm for Wireless Video Transmission based on Feedback Channel (무선 비디오 통신을 위한 피드백 채널 기반의 에러복구 알고리즘의 개발)

  • 노경택
    • Journal of the Korea Society of Computer and Information
    • /
    • v.7 no.2
    • /
    • pp.95-100
    • /
    • 2002
  • By feedback channel, the decoder reports the addresses of corrupted macroblocks induced by transmission errors back to the encoder With these negative acknowledgements, the encoder can make the next frame having propagated errors by using forward dependency based on GOBs and MBs of the frame happening transmission errors. The encoder can precisely calculate and track the propagated errors by examining the backward motion dependency for each of four comer pixels in the current encoding frame until before-mentioned the next frame. The error-propagation effects can be terminated completely by INTRA refreshing the affected macroblocks. Such a fast algorithm further reduce the computation and memory requirements. The advantages of the low computation complexity and the low memory requirement are Particularly suitable for real-time implementation.

  • PDF

Fast Intra Mode Selection Algorithm Based on Edge Activity in Transform Domain for H.264/AVC Video (변환영역에서의 에지활동도에 기반한 H.264/AVC 고속 인트라모드 선택 방법)

  • Seo, Jae-Sung;Kim, Dong-Hyung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.8C
    • /
    • pp.790-800
    • /
    • 2009
  • For the improvement of coding efficiency, the H.264/AYC standard uses new coding tools such as 1/4-pel-accurate motion estimation, multiple references, intra prediction, loop filter, variable block size etc. Using these coding tools, H.264/AYC has achieved significant improvements from rate-distortion point of view compared to existing standards. However, the encoder complexity was greatly increased due to these coding tools. We focus on the complexity reduction method of intra macroblock mode selection. The proposed algorithm for fast intra mode selection calculates the edge activity in transform domain, and performs fast encoding of intra frame in H.264/AYC through the fast prediction mode selection of intra4x4 and chrominance blocks. Simulation results show that the proposed method saves about 59.76% for QCIF sequences and 65.03% for CIF sequences of total encoding time, while bitrate increase and PSNR decrease are very small.