• Title/Summary/Keyword: MPEG-4 AVC

Search Result 123, Processing Time 0.025 seconds

The Trend and Prospect of HEVC Technology (HEVC 기술 동향과 전망)

  • Yoon, Seok-Hyun
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2014.01a
    • /
    • pp.343-344
    • /
    • 2014
  • UHDTV와 UD 스마트폰의 보급을 앞두고 고해상도, 고화질의 영상에 대한 요구가 더욱 커지고 있다. 2013년 1월 국제표준으로 승인된 차세대 비디오 코덱인 HEVC는 현재 국제표준 코덱인 H.264/MPEG-4 AVC보다 50% 이상 높은 압축률을 지원하게 되어 향후 방송은 물론 스마트폰 등 디지털 영상의 새로운 혁신적인 기술이 될 것으로 보인다. 본 연구에서는 HEVC 기술의 동향과 전망에 대해 살펴본다.

  • PDF

An Efficient Coding Method for Stereoscopic Videos using HEVC (HEVC를 이용한 양안식 영상의 효율적인 부호화 방법)

  • Hwang, Soo-Jin;Ho, Yo-Sung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.12C
    • /
    • pp.721-726
    • /
    • 2011
  • The compression performance of HEVC (high efficiency video coding) is improved 40%, compared to H.264/AVC. Since the existing 3D video CODEC is based on H.264/AVC or MPEG-2, we can improve the compression performance when we use the proposed stereoscopic video coding method based on HEVC. Since the stereoscopic video has the temporal and inter-view correlations, the videos of the left and right cameras encode together to improve the performance. Especially, we implemented the proposed technique using HM(HEVC test model) 3.4. To compare the performance of the proposed method, we only compare the right view video which is coded using the inter-view prediction. The proposed method which is considered inter-view correlation is improved the performance which BDBR reduce about 36.24% and BDPSNR increase approximately 1.19 dB compared to the separated-coding method.

An Improved Block-matching Algorithm Based on Motion Similarity of Adjacent Macro-blocks (인접 매크로블록간 움직임유사도 기반 개선된 블록매칭 알고리즘)

  • Ryu, Tae-kyung;Jeong, Yong-jae;Moon, Kwang-seok;Kim, Jong-nam
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2009.05a
    • /
    • pp.663-667
    • /
    • 2009
  • 본 논문에서는 인접블록간의 움직임 유사도를 이용하여 불필요한 후보블록을 보다 빠르게 제거하는 PDE기반의 고속 블록매칭 알고리즘을 제안한다. 제안한 방법은 기존의 방법보다 불필요한 계수를 효율적으로 제거하기 위하여 인접 블록간의 영상의 유사성에 기초하여 인접한 네개의 매크로블록 가운데 최대 복잡도를 가지는 서브블록의 누적된 비율(cumulative distribution function-CDF)을 사용하고 서브블록별 복잡도가 집중되지 않도록 하기위하여 normalized 기반 매칭스캔 방법을 사용하여 효율적으로 계산량을 줄였다. 제안한 알고리즘은 화질의 저하 없이 기존의 PDE 알고리즘에 비해 60% 이상의 계산량을 줄였으며, MPEG-2 및 MPEG-4 AVC를 이용하는 비디오 압축 응용분야에 유용하게 사용될 수 있을 것이다.

  • PDF

A FAST PARTIAL DISTORTION ELIMINATION ALGORITHM USING IMPROVED SUB-BLOCK MATCHING SCAN

  • Kim, Jong-Nam;Ryu, Tae-Kyung;Moon, Kwang-Seok
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2009.01a
    • /
    • pp.278-281
    • /
    • 2009
  • In this paper, we propose a fast partial distortion algorithm using normalized dithering matching scan to get uniform distribution of partial distortion which can reduce only unnecessary computation significantly. Our algorithm is based on normalized dithering order matching scan and calibration of threshold error using LOG value for each sub-block continuously for efficient elimination of unlike candidate blocks while keeping the same prediction quality compared with the full search algorithm. Our algorithm reduces about 60% of computations for block matching error compared with conventional PDE (partial distortion elimination) algorithm without any prediction quality, and our algorithm will be useful to real-time video coding applications using MPEG-4 AVC or MPEG-2.

  • PDF

A Fast Partial Distortion Elimination Algorithm Using Motion Similarity of Macro-blocks (매크로블록 간 움직임유사도를 이용한 고속 PDE 알고리즘)

  • Ryu, Tae-Kyung;Jeong, Yong-Jae;Moon, Kwang-Seok;Kim, Jong-Nam
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.05a
    • /
    • pp.225-228
    • /
    • 2009
  • 본 논문에서는 인접블록간의 움직임 유사도를 이용하여 불필요한 후보블록을 보다 빠르게 제거하는 PDE기반의 고속 블록매칭 알고리즘을 제안한다. 제안한 방법은 기존의 방법보다 불필요한 계수를 효율적으로 제거하기 위하여 인접 블록간의 영상의 유사성에 기초하여 네 개의 인접 매크로블록 가운데 최대 복잡도를 가지는 서브블록의 누적 분포 함수(cumulative distribution function-CDF)와 서브블록별 복잡도가 집중되지 않도록 하기위하여 normalized스캔 방법에 사용하여 효율적으로 계산량을 감소하였다. 제안한 알고리즘은 화질의 저하 없이 기존의 PDE 알고리즘에 비해 55% 이상의 계산량을 줄였으며, MPEG-2 및 MPEG-4 AVC를 이용하는 비디오 압축 응용분야에 유용하게 사용될 수 있을 것이다.

  • PDF

An Algorithm with Low Complexity for Fast Motion Estimation in Digital Video Coding (디지털 비디오 부호화에서의 고속 움직임 추정을 위한 저복잡도 알고리즘)

  • Lee, Seung-Chul;Kim, Min-Ki;Jeong, Je-Chang
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.12C
    • /
    • pp.1232-1239
    • /
    • 2006
  • In video standards such as MPEG-1/2/4 and H.264/AVC, motion estimation / compensation(ME/MC) process causes the most encoding complexity of video encoder. The full search method, which is used in general video codecs, exhausts much encoding time because it compares current macroblock with those at all positions within search window for searching a matched block. For the alleviation of this problem, the fast search methods such as TSS, NTSS, DS and HEXBS are exploited at first. Thereafter, DS based MVFAST, PMVFAST, MAS and FAME, which utilize temporal or spacial correlation characteristics of motion vectors, are developed. But there remain the problems of image quality degradation and algorithm complexity increase. In this thesis, the proposed algorithm maximizes search speed and minimizes the degradation of image quality by determining initial search point correctly and using simple one-dimension search patterns considering motion characteristics of each frame.

An Efficient Intra Prediction Mode Decision for Spatial Enhancement Layer (공간 향상 계층에서 효율적인 화면 내 예측 모드 선택 방법)

  • Myung, Jin-Su;Park, Sung-Jae;Oh, Seoung-Jun;Sim, Dong-Gyu;Kim, Byung-Gyu
    • Journal of Broadcast Engineering
    • /
    • v.12 no.5
    • /
    • pp.491-502
    • /
    • 2007
  • In this parer, we propose an efficient intra prediction mode decision scheme in Scalable Video Coding(SVC) which is an emerging video coding standard as an extension of H.264/MPEG-4 AVC(Advanced Video Coding). The proposed method in base on the characteristic of macroblock smoothness follows the statistical analysis of intra prediction mode in an enhancement layer and it decides a candidate intra prediction mode. We also propose an early termination scheme for Intra_BL mode decision where the RD cost value of Intra_BL is utilized. Simulation results show that the proposed method reduces 54.67% of the computation complexity of intra prediction coding, while the degradation in video quality is negligible; for low QP values, the average PSNR loss is very negligible, equivalently the bit rate increases by 0.011%. For high QP values, the average PSNR loss is less than 0.01dB, which equals to 0.249% increase in bitrate.

A Fast Sub-pel Motion Estimation Scheme using a Parabolic SAD Model

  • Ahn, Sang-Soo;Lee, Bum-Shik;Kim, Mun-Churl;Park, Chang-Seob;Hahm, Sang-Jin;Cho, In-Jun
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2009.01a
    • /
    • pp.321-325
    • /
    • 2009
  • Sub-pel level motion estimation contributes to significant increase in R-D performance for H.264|MPEG 4 Part 10 AVC. However, several supplements, such as interpolation, block matching, and Hadamard transform which entails large computational complexity of encoding process, are essential to find best matching block in sub-pel level motion estimation and compensation. In this paper, a fast motion estimation scheme in sub-pel accuracy is proposed based on a parabolic model of SAD to avoid such computational complexity. In the proposed scheme, motion estimation (ME) is only performed in integer-pel levels and the following sub-pel level motion vectors are found from the parametric SAD model for which the model parameters are estimated from the SAD values obtained in the integer-pel levels. Fall-back check is performed to ensure the validity of the parabolic SAD model with the estimated parameters. The experiment result shows that the proposed scheme can reduce the motion estimation time up to about 30% of the total ME times in average with negligible amount of PSNR drops (0.14dB in maximum) and bit increments (2.54%in maximum).

  • PDF

Method for signaling intra prediction mode with merging MPM (MPM을 병합하여 인트라 예측 모드를 시그널링하는 방법)

  • Kim, Ki-Baek;Lee, Won-Jin;Jeong, Je-Chang
    • Journal of Broadcast Engineering
    • /
    • v.16 no.3
    • /
    • pp.416-426
    • /
    • 2011
  • In this paper, we proposed an intra coding method with merging intra prediction mode to achieve intra coding gain. The proposed method uses signaling of prediction mode with merging prediction modes, which is different from the conventional method. If the number of blocks that has the same prediction mode compared to that to be predicted from neighboring blocks exceeds the predefined threshold, then the proposed method is used in order to reduce bits of intra prediction mode for coding efficiency. Otherwise the conventional method is used. Experimental results show the proposed method achieves the PSNR gain of about 0.05 dB in RD curve and reduces the bit rates about 1 % compared with H.264/AVC. In particular, the PSNR gain of about 0.1 dB in RD curve and reduces the bit rates about 1.7 % compared with H.264/AVC at low bit-rates. we can know that the proposed method is efficient tool at low bit-rates.

Modified Adaptive Motion Vector Resolution (수정된 적응적 움직임 벡터 해상도 부호화 방법)

  • Jang, Myoung-Hun;Han, Jong-Ki;Bae, Jinsoo
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2011.11a
    • /
    • pp.46-48
    • /
    • 2011
  • 기존의 참조 소프트웨어인 MPEG-2, MPEG-4, H.264/AVC에서는 움직임 벡터를 찾을 때 항상 고정된 해상도를 사용하였으며 다른 참조 소프트웨어인 KTA에서는 움직임 벡터를 찾을 때 움직임벡터의 해상도를 슬라이스 단위로 성능이 가장 높은 해상도를 선택해서 사용하였다. 하지만 움직임 벡터의 해상도는 블록마다 서로 다르기 때문에 블록별로 서로 다른 해상도를 적응적으로 사용할 필요가 있다. 적응적인 움직임 벡터 해상도 부호화 방법은 이러한 점을 이용하여 블록 별로 현재 블록의 움직임 벡터가 1/4 해상도인지 1/8 해상도인지에 판단하고 그에 대한 정보를 복호기에 전송해준다. 제안하는 알고리즘은 적응적 움직임 벡터 해상도를 사용하여 부호화 할 때 1/8 해상도 움직임 벡터가 성능이 없다고 판단되는 곳에선 적응적 움직임 벡터 해상도 방식을 사용하지 않고 1/4 해상도로만 움직임 벡터를 찾는다. 이러한 경우 해상도 정보를 복호기에 전송하지 않아 부호화 효율을 높일 수 있고 또한 1/8 해상도에 대한 움직임 예측을 하지 않기 때문에 부호화기 복잡도를 낮출 수 있다. 실험결과 평균 0.2%의 성능을 얻을 수 있었으며 부호화기 복잡도는 4% 감소하였다.

  • PDF