• Title/Summary/Keyword: Intra Prediction Scheme

Search Result 44, Processing Time 0.023 seconds

Motion-Compensated Layered Video Coding for Dynamic Adaptation (동적 적응을 위한 움직임 보상 계층형 동영상 부호화)

  • 이재용;박희라;고성제
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.10B
    • /
    • pp.1912-1920
    • /
    • 1999
  • In this paper, we propose a layered video coding scheme which can generate multi-layered bitstream for heterogeneous environments. A new motion prediction structure with temporal hierarchy of frames is developed to afford temporal resolution scalability and the wavelet decomposition is adopted to offer spatial acalability. The proposed scheme can have a higher compression ratio than replenishment schemes by using motion estimation and compensation which can further reduce the temporal redundancy, and it effectively works with dynamic adaption or errors using dispersive intra-subband update (DISU). Moreover, data rate scalability can be attained by employing embeded zerotree wavelet (EZW) technique which can produce embeded bitstream. Therefore, the proposed scheme is expected to be effectively used in heterogeneous environments such as the Internet, ATM, and mobile networks where interoperability are required.

  • PDF

Mobility-Adaptive Routing Update Scheme for Wireless Networks with Group Mobility (그룹 이동성을 가지는 무선 네트워크에서 이동 적응적인 라우팅 업데이트 구조)

  • Kang, Hyun-Jae;Lim, Sung-Gook;Jeon, Hahn-Earl;Lee, Jai-Yong;Park, Soo-Bum;You, Young-Bin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.1B
    • /
    • pp.39-49
    • /
    • 2012
  • With group mobility, minimizing routing overhead among intra-group nodes can be achieved by making longer the routing update period, which may lead to degradation of inter-group's routing performance and consequently the inter-group packet delivery success ratio will be decreased. To reduce the inter-group routing overhead without lowering the inter-group packet delivery success ratio, a mobility-adaptive routing update(MARU) scheme is proposed in this paper. Main idea of the proposed scheme is group-based mobility prediction and updating routing paths by selecting intermediate common relay groups.

3D-Distortion Based Rate Distortion Optimization for Video-Based Point Cloud Compression

  • Yihao Fu;Liquan Shen;Tianyi Chen
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.2
    • /
    • pp.435-449
    • /
    • 2023
  • The state-of-the-art video-based point cloud compression(V-PCC) has a high efficiency of compressing 3D point cloud by projecting points onto 2D images. These images are then padded and compressed by High-Efficiency Video Coding(HEVC). Pixels in padded 2D images are classified into three groups including origin pixels, padded pixels and unoccupied pixels. Origin pixels are generated from projection of 3D point cloud. Padded pixels and unoccupied pixels are generated by copying values from origin pixels during image padding. For padded pixels, they are reconstructed to 3D space during geometry reconstruction as well as origin pixels. For unoccupied pixels, they are not reconstructed. The rate distortion optimization(RDO) used in HEVC is mainly aimed at keeping the balance between video distortion and video bitrates. However, traditional RDO is unreliable for padded pixels and unoccupied pixels, which leads to significant waste of bits in geometry reconstruction. In this paper, we propose a new RDO scheme which takes 3D-Distortion into account instead of traditional video distortion for padded pixels and unoccupied pixels. Firstly, these pixels are classified based on the occupancy map. Secondly, different strategies are applied to these pixels to calculate their 3D-Distortions. Finally, the obtained 3D-Distortions replace the sum square error(SSE) during the full RDO process in intra prediction and inter prediction. The proposed method is applied to geometry frames. Experimental results show that the proposed algorithm achieves an average of 31.41% and 6.14% bitrate saving for D1 metric in Random Access setting and All Intra setting on geometry videos compared with V-PCC anchor.

A New Method for Thumbnail Extraction in H.264/AVC Bitstreams (H.264/AVC 비트스트림에서 썸네일 추출을 위한 새로운 방법)

  • Hong, Seung-Hwan;Kim, Ji-Eon;Chin, Young-Min;Kwon, Jae-Cheol;Oh, Seoung-Jun
    • Journal of Broadcast Engineering
    • /
    • v.15 no.6
    • /
    • pp.853-867
    • /
    • 2010
  • Recently, thumbnail techniques are required to index a high-performance video at digital convergence-based multimedia service like IPTV and DMB. Therefore a thumbnail extraction method in H.264/AVC bitstreams has been proposed. However, thumbnail quality deterioration problem at converting the general equation of spatial domain to frequency domain which is generated by not considering about H.264/AVC transform and quantization processing and rounding-off operation in intra prediction. In this paper, we propose a new thumbnail extraction method in H.264/AVC bitstreams. The proposed scheme is based on H.264/AVC core-transform for a thumbnail extraction in frequency domain, and probability theory, intra rounding-off error compensation. Through the implementation and performance evaluation, the subjective quality difference between the output of our scheme and the output of reference decoder is negligible and better than the conventional method, and moreover PSNR gain by up to 8.66 dB.

Fast Intraframe Coding for High Efficiency Video Coding

  • Huang, Han;Zhao, Yao;Lin, Chunyu;Bai, Huihui
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.3
    • /
    • pp.1093-1104
    • /
    • 2014
  • The High Efficiency Video Coding (HEVC) is a new video coding standard that can provide much better compression efficiency than its predecessor H.264/AVC. However, it is computationally more intensive due to the use of flexible quadtree coding unit structure and more choices of prediction modes. In this paper, a fast intraframe coding scheme is proposed for HEVC. Firstly, a fast bottom-up pruning algorithm is designed to skip the mode decision process or reduce the candidate modes at larger block size coding unit. Then, a low complexity rough mode decision process is adopted to choose a small candidate set, followed by early DC and Planar mode decision and mode filtering to further reduce the number of candidate modes. The proposed method is evaluated by the HEVC reference software HM8.2. Averaging over 5 classes of HEVC test sequences, 41.39% encoding time saving is achieved with only 0.77% bitrate increase.

Scheme for Reducing HEVC Intra Coding Complexity Considering Video Resolution and Quantization Parameter (비디오 해상도 및 양자화 파라미터를 고려한 HEVC의 화면내 부호화 복잡도 감소 기법)

  • Lee, Hong-rae;Seo, Kwang-deok
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2014.06a
    • /
    • pp.97-100
    • /
    • 2014
  • 최근 초고화질 해상도(UHD) 영상 서비스에 따른 기존의 비디오 압축 기술인 H.264/AVC 대비 두 배 이상의 압축 성능을 가지는 HEVC(High-Efficiency Video Codec)의 표준화가 완료되었다. 그러나 높은 압축 효과를 얻기 위하여 복잡한 연산이 필요한 기법들이 많이 도입되어 HEVC의 부호화 복잡도는 H.264/AVC보다 크게 증가되었다. 예로써 HEVC의 화면내 예측 부호화는 예측 방향를 최대 35개까지 확장함으로써 기존 H.264/AVC에 비해서 향상된 부호화 효율을 갖지만 화면내 부호화의 복잡도는 크게 증가되어 복잡도 감소 기법이 필요하다. 본 논문은 화면내 예측 부호화에 사용되는 예측 방향 35가지를 비디오 해상도와 양자화 파라미터 크기를 고려하여 4가지 모드로 나누고 비디오 해상도의 따른 PU(Prediction Unit)의 크기의 점유율에 따라 예측 방향 개수를 변경함으로써 계산 복잡도를 감소시키는 기법을 제안한다. 실험 결과를 통해 제안된 기법을 적용함으로써 대략 2%의 BD-rate 증가로 부호화 시간을 4% 감소시킬 수 있었다.

  • PDF

Improved H.264/AVC $16{\times}16$ Intra Prediction Scheme (개선된 H.264/AVC $16{\times}16$ 인트라 예측 기술)

  • Yang, Hee-Chul;Yang, Jung-Youp;Jeon, Byeung-Woo
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2010.07a
    • /
    • pp.285-286
    • /
    • 2010
  • 최근 HDTV, 블루레이 등 고해상도, 고품질 디지털 멀티미디어 응용 기술의 보급으로 인하여, 고해상도, 고품질 비디오 부호화 기술에 대한 중요성이 증가하고 있다. 현재 고해상도 비디오 부호화에 사용되는 H.264/AVC 표준의 인트라 부호화 기술은 인터 부호화 기술의 복잡도가 크게 증가하는 고해상도 영상에서 인터 부호화 기술에 비해 낮은 복잡도를 가진 부호화기 및 복호화기의 구현이 가능하다는 장점을 가지고 있다. 그러나 인트라 부호화 기술은 인터 부호화 기술에 비하여 압축 효율이 매우 낮다는 문제점이 있다. 본 논문에서는 고해상도 영상을 위한 새로운 $16{\times}16$ 블록의 인트라 예측 기술을 제안한다. 실험을 통하여 제안한 새로운 $16{\times}16$ 인트라 예측 기술을 사용할 경우, HD급 고해상도 영상에 대해 평균 2.8%의 부호화 효율을 증가시킬 수 있음을 보여준다.

  • PDF

Fast Intra Prediction Mode Decision Scheme Using Sample Pixels in H.264 (H.264에서 대표 픽셀을 이용한 빠른 $4{\times}4$ 인트라 모드 결정)

  • Lee, Tak-Gi;Kim, Sung-Min;Kim, Ki-Wan;Chung, Ki-Dong
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2007.06d
    • /
    • pp.526-530
    • /
    • 2007
  • H.264는 가변 블록 크기, 다양한 방향성 예측 등과 같은 새로운 기법들을 도입하여 적은 비트율로 높은 압축효율을 가진다. 하지만 이와 같은 다양한 기법이 적용됨에 따라 계산복잡도가 크게 증가되었다. 본 논문에서는 계산복잡도를 줄이기 위해 효율적인 인트라 예측 모드 선택 기법을 제안한다. H.264의 $4{\times}4$ 인트라 예측을 위한 모드 선택에서는 8개의 방향성을 이용하는데 본 논문에서 제안하는 기법은 4개의 방향만을 사용하여 모드를 선택한 후, 선택한 모드의 방향성과 인접한 후보 모드를 추가하여 인트라 예측을 수행한다. 실험 결과, H.264 표준에서 제시한 $4{\times}4$ 인트라 모드 선택 기법과 비교하여 평균 83.7%의 정확도를 가지면서 계산복잡도는 63.3% 감소시켰다.

  • PDF

An Efficient Error Compensation Method for Thumbnail Extraction in H.264/AVC Bitstreams (H.264/AVC 비트스트림으로부터 썸네일 추출 시 효율적인 오차 보상 방법)

  • Yoon, Myung-Keun;Lee, Yeo-Song;Sohn, Chae-Bong;Park, Ho-Chong;Ahn, Chang-Beom;Oh, Seoung-Jun
    • Journal of Broadcast Engineering
    • /
    • v.13 no.5
    • /
    • pp.622-635
    • /
    • 2008
  • Recently, high definition media services like HDTV and IPTV are growing. A fast reduced-size image extracting method is required to meet what those services require. Conventional DC image extracting methods, however, can't be applied to H.264/AVC streams since a spatial domain prediction scheme is adopted in H.264/AVC intra mode. To solve this problem, a thumbnail extraction method in H.264/AVC was proposed. However, the method has mismatch problem which was caused by round-off operation in intra prediction and mismatch between integer and floating point calculation. In this paper, we propose an error compensation method for extracting thumbnail directly in H.264/AVC bitstreams. The compensation method introduces the mismatch problem in thumbnail extraction and presents compensation values. Through the implementation and performance evaluation, proposed method compensated round-off error efficiently in D1 and HD sequences while the additional extraction time is negligible.

Initial QP Determination Algorithm using Bit Rate Model (비트율 모델을 이용한 초기 QP 결정 알고리즘)

  • Park, Sang-Hyun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.9
    • /
    • pp.1947-1954
    • /
    • 2012
  • The first frame is encoded in intra mode which generates a larger number of bits. In addition, the first frame is used for the inter mode encoding of the following frames. Thus the initial QP for the first frame affects the first frame as well as the following frames. Traditionally, the initial QP is determined among four constant values only depending on the bpp. In the case of low bit rate video coding, the initial QP value is fixed to 40 regardless of the output bandwidth. Although this initialization scheme is simple, yet it is not accurate enough. An accurate initial QP prediction scheme should not only depends on bpp but also on the complexity of the video sequence and the output bandwidth. In the proposed scheme, we determine the initial QP according to the ratio of the first frame to the total bits allocated to a GOP. To estimate the QP of the allocated bits, Rate-QP model is used. It is shown by experimental results that the new algorithm can predict the optimal initial QP more accurately and generate the PSNR performance better than that of the existing JVT algorithm.