• Title/Summary/Keyword: bitstreams

Search Result 64, Processing Time 0.024 seconds

Statistical Characteristics and Complexity Analysis of HEVC Encoder Software (HEVC 부호화기 소프트웨어의 통계적 특성 및 복잡도 분석)

  • Ahn, Yongjo;Hwang, Taejin;Yoo, Sungeun;Han, Woo-Jin;Sim, Donggyu
    • Journal of Broadcast Engineering
    • /
    • v.17 no.6
    • /
    • pp.1091-1105
    • /
    • 2012
  • In this paper, we analyzed statistical characteristics and complexity of HEVC encoder as a leading research of acceleration, optimization and parallelization. Computational complexity of the HEVC encoder is approximately twice the compression performance compared to H.264/AVC. But, the increase of encoder complexity remains a problem to be solved in the future. Before performing the research on acceleration, optimization and parallelization to reduce high complexity of HEVC encoder, we measure the complexity each module for HEVC encoder using it's reference software HM 7.1. We also measured the predicted complexity of fast HEVC encoder software, used in real applications, using HM 7.1 applying fast encoding method. The complexity is measured in terms of the operating cycle of the encoder software under the common test sequences and conditions in the Windows PC environment. In addition, we analyze statistical characteristics of HEVC encoder software according to encoding structures and limitation using coded bitstreams.

Selective temporal error concealment method for H.264/AVC (H.264/AVC를 위한 선택적 시간축 에러 은닉 방법)

  • Jung Bongsoo;Choi Woongil;Jeon Byeungwoo;Kim Myung-Don;Choi Song-In
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.42 no.2 s.302
    • /
    • pp.87-100
    • /
    • 2005
  • In this paper, we propose a new selective temporal error concealment algerian best suited for H.264/AVC. The proposed algorithm performs selective temporal error concealment depending on whether the lost block is at background or foreground. It the corrupted macroblock is decided as at background, then the simple temporal replacement is performed. Also we propose replacing a lost block at foreground with the selective average of respectively estimated blocks from the multiple reference frames. This paper supposes error-corrupted H.264/AVC video bitstreams over CDMA2000 (or UMTS) air interface. It is shown that under Flexible Macroblock Ordering (FMO) coding of H.264/AVC, the proposed algorithm provides PSNR gain up to 1.18dB compared to built-in algorithm in the K264/AVC test model. In addition, the proposed error concealment method has average PSNR improvement of 0.33dB compared with that under N-slice coding mode. The proposed algorithm also provides better subjective video quality than other conventional error concealment algorithms.

Whole Frame Error Concealment with an Adaptive PU-based Motion Vector Extrapolation and Boundary Matching (적응적인 PU 기반 움직임 벡터 외삽과 경계 정합을 통한 프레임 전체 오류 은닉 방법에 관한 연구)

  • Kim, Seounghwi;Lee, Dongkyu;Oh, Seoung-Jun
    • Journal of Broadcast Engineering
    • /
    • v.20 no.4
    • /
    • pp.533-544
    • /
    • 2015
  • Recently, most of the video services are usually transmitted in wireless networks. In networks environment, a packet of video is likely to be lost during transmission. For this reason, this paper proposes a new Error Concealment (EC) algorithm. For High Efficiency Video Coding (HEVC) bitstreams, the proposed algorithm includes Adaptive Prediction Unit-based Motion Vector Extrapolation (APMVE) and Boundary Matching (BM) algorithm, which employs both the temporal and spatial correlation. APMVE adaptively decides a Error Concealment Basic Unit (ECBU) by using the PU information of the previous frame and BM employing the spatial correlation is applied to only unreliable blocks. Simulation results show that the proposed algorithm provides the higher subjective quality by reducing blocking artifacts which appear in other existing algorithms.

An Error-Resilient Image Compression Base on the Zerotree Wavelet Algorithm (오류에 강인한 제로트리 웨이블릿 영상 압축)

  • 장우영;송환종;손광훈
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.7A
    • /
    • pp.1028-1036
    • /
    • 2000
  • In this paper, an error-resilient image compression technique using wavelet transform is proposed. The zerotree technique that uses properties of statistics, energy and directions of wavelet coefficients in the space-frequency domain shows effective compression results. Since it is highly sensitive to the propagation of channel errors, evena single bit error degrades the whole image quality severely. In the proposed algorithm, the image is encoded by the SPIHT(Set Partitioning in Hierarchical Trees) algorithm using the zerotree coding technique. Encoded bitstreams are partitioned into some blocks using the subband correlations and then fixed-length blocks are made by using the effective bit reorganization algorithm. finally, an effective bit allocation technique is used to limit error propagation in each block. Therefore, in low BER the proposed algorithm shows similar compression performance to the zerotree compression technique and in high BER it shows better performance in terms of PSNR than the conventional methods.

  • PDF

H.263-Based Scalable Video Codec (H.263을 기반으로 한 확장 가능한 비디오 코덱)

  • 노경택
    • Journal of the Korea Society of Computer and Information
    • /
    • v.5 no.3
    • /
    • pp.29-32
    • /
    • 2000
  • Layered video coding schemes allow the video information to be transmitted in multiple video bitstreams to achieve scalability. they are attractive in theory for two reasons. First, they naturally allow for heterogeneity in networks and receivers in terms of client processing capability and network bandwidth. Second, they correspond to optimal utilization of available bandwidth when several video qualify levels are desired. In this paper we propose a scalable video codec architectures with motion estimation, which is suitable for real-time audio and video communication over packet networks. The coding algorithm is compatible with ITU-T recommendation H.263+ and includes various techniques to reduce complexity. Fast motion estimation is Performed at the H.263-compatible base layer and used at higher layers, and perceptual macroblock skipping is performed at all layers before motion estimation. Error propagation from packet loss is avoided by Periodically rebuilding a valid Predictor in Intra mode at each layer.

  • PDF

Data Level Parallelism for H.264/AVC Decoder on a Multi-Core Processor and Performance Analysis (멀티코어 프로세서에서의 H.264/AVC 디코더를 위한 데이터 레벨 병렬화 성능 예측 및 분석)

  • Cho, Han-Wook;Jo, Song-Hyun;Song, Yong-Ho
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.46 no.8
    • /
    • pp.102-116
    • /
    • 2009
  • There have been lots of researches for H.264/AVC performance enhancement on a multi-core processor. The enhancement has been performed through parallelization methods. Parallelization methods can be classified into a task-level parallelization method and a data level parallelization method. A task-level parallelization method for H.264/AVC decoder is implemented by dividing H.264/AVC decoder algorithms into pipeline stages. However, it is not suitable for complex and large bitstreams due to poor load-balancing. Considering load-balancing and performance scalability, we propose a horizontal data level parallelization method for H.264/AVC decoder in such a way that threads are assigned to macroblock lines. We develop a mathematical performance expectation model for the proposed parallelization methods. For evaluation of the mathematical performance expectation, we measured the performance with JM 13.2 reference software on ARM11 MPCore Evaluation Board. The cycle-accurate measurement with SoCDesigner Co-verification Environment showed that expected performance and performance scalability of the proposed parallelization method was accurate in relatively high level

An Optimal Adaptation Framework for Transmission of Multiple Visual Objects (다중 시각 객체 전송을 위한 최적화 적응 프래임워크)

  • Lim, Jeong-Yeon;Kim, Mun-Churl
    • Journal of KIISE:Software and Applications
    • /
    • v.35 no.4
    • /
    • pp.207-218
    • /
    • 2008
  • With the growth of the Internet, multimedia streaming becomes an important means to deliver video contents over the Internet and the amount of the streaming multimedia contents is also getting increased. However, it becomes difficult to guarantee the quality of service in real-time over the IP network environment with instantaneously varying bandwidth. In this paper, we propose an optimal adaptation framework for streaming contents over the Internet in the sense that the perceptual quality of the multi-angie content with multiple visual objects is maximized given the constraints such as available bandwidth and transcoding cost. In the multi-angle video service framework, the user can select his/her preferred alternate views among the given multiple video streams captured at different view angles for a same event. This enhanced experience often entails streaming problems in real-time over the network, such as instantaneous bandwidth changes in the Internet. In order to cope with this problem, we assume that multi-angle video contents are encoded at different bitrates and the appropriate video streams are then selected or transcoded for delivery to meet such bandwidth constraints. For the user selective consumption of the various bitstreams in the multi-angle video service, the bitstream in each angle can be encoded in various bitrate, and the user can select a sub-bitrstream in the given bitrstreams or transcode the corresponding content in order to deliver the optimally adapted video contents to the instantaneously changing network condition. Therefore, we define the transcoding cost which means the time taken for transcoding the video stream and formulate a unified optimization framework which maximizes the perceptual quality of the multiple video objects in the given constraints such as the transcoding cost and the network bandwidth. Finally, we present plenty of the experimental results to show the effectiveness of the proposed method.

Edge Detection System for Noisy Video Sequences Using Partial Reconfiguration (부분 재구성을 이용한 노이즈 영상의 경계선 검출 시스템)

  • Yoon, Il-Jung;Joung, Hee-Won;Kim, Seung-Jong;Min, Byong-Seok;Lee, Joo-Heung
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.18 no.1
    • /
    • pp.21-31
    • /
    • 2017
  • In this paper, the Zynq system-on-chip (SoC) platform is used to design an adaptive noise reduction and edge-detection system using partial reconfiguration. Filters are implemented in a partially reconfigurable (PR) region to provide high computational complexity in real-time, 1080p video processing. In addition, partial reconfiguration enables better utilization of hardware resources in the embedded system from autonomous replacement of filters in the same PR region. The proposed edge-detection system performs adaptive noise reduction if the noise density level in the incoming video sequences exceeds a given threshold value. Results of implementation show that the proposed system improves the accuracy of edge-detection results (14~20 times in Pratt's Figure of Merit) through self-reconfiguration of filter bitstreams triggered by noise density level in the video sequences. In addition, the ZyCAP controller implemented in this paper enables about 2.1 times faster reconfiguration when compared to a PCAP controller.

Transcoding from Distributed Video Coding to H.264/AVC Based on Motion Vectors of Side Information (보조정보의 움직임 벡터를 이용한 분산 비디오 코딩에서 H.264/AVC로의 트랜스코딩)

  • Min, Kyung-Yeon;Yoo, Sung-Eun;Sim, Dong-Gyu;Jeon, Byeung-Woo
    • Journal of Broadcast Engineering
    • /
    • v.16 no.1
    • /
    • pp.108-122
    • /
    • 2011
  • In this paper, a transcoding method with low computational complexity and high coding efficiency is proposed to transcode distributed video coding (DVC) bitstreams to H.264/AVC ones. For the proposed high-performance transcoding with low complexity, not only Wyner-Ziv frames but also key frames can be transcoded with motion vectors estimated in generation of side information. As a motion vector is estimated from a key frame to a prior key frame for side information generation, the motion vector can be used to encode the intra key frame as a predicted frame. Motion estimation is performed with two predicted motion vectors. One is the motion vector from side information generation and the other is median of motion vectors of neighboring blocks. The proposed method selects the best motion vector between two motion vectors based on rate-distortion optimization. Coding efficiency can be improved with a small size of search range, because a motion vector estimated in side information generation is used as an initial motion vector for transcoding. In the experimental results, complexity of transcoder is reduced about 12% and bitrate performance increases about 28.7%.

Multiplexing of UHDTV Based on MPEG-2 TS (MPEG-2 TS 기반의 UHDTV 다중화)

  • Jang, Euy-Doc;Park, Dong-Il;Kim, Jae-Gon;Lee, Eung-Don;Cho, Suk-Hee;Choi, Jin-Soo
    • Journal of Broadcast Engineering
    • /
    • v.15 no.2
    • /
    • pp.205-216
    • /
    • 2010
  • In this paper, a method of MPEG-2 Transport Stream (TS) multiplexing for Ultra HDTV (UHDTV) and its design and implementation as a SW tool is described. In practice, UHD video may be divided into several HD videos and each video is encoded in parallel. Therefore, it is necessary to synchronize and multiplex multiple bitstreams encoding each HD video for transmitting and storing UHD video. In this paper, it is assumed that 4 HD videos partitioning a UHD spatially are encoded as H.264/AVC and two 5.0 channel audios are encoded by AC-3. Therefore, 4 H.264/AVC elementary streams (ESs) and 2 AC-3 ESs is mainly considered in the TS multiplexing of UHD. For the carriage of H.264/AVC and AC-3 over MPEG-2 TS, PES packetization and TS multiplexing are designed and implemented based on the extended specification of the MPEG-2 Systems and ATSC (Digital audio compressed standard), respectively. The implemented UHD TS multiplexing tool emulates real time HW operation in the time unit corresponding to the duration of one TS packet transmission in a given TS rate. In particular, in order to satisfy the timing model, the buffers defined in the TS System Target Decoder (T-STD) are monitored and their statuses are considered in the scheduling of TS multiplexing. For UHD multiplexing, two kinds of multiplexing structures, which are UHD re-multiplexing and UHD program multiplexing, are implemented and their strength and weakness are investigated. The developed UHD TS multiplexing tool is tested and verified in terms of the syntax and semantics conformance and functionalities by using a commercial analyzer and real-time presentation tools.