메뉴 건너뛰기
.. 내서재 .. 알림
소속 기관/학교 인증
인증하면 논문, 학술자료 등을  무료로 열람할 수 있어요.
한국대학교, 누리자동차, 시립도서관 등 나의 기관을 확인해보세요
(국내 대학 90% 이상 구독 중)
로그인 회원가입 고객센터 ENG
주제분류

추천
검색

논문 기본 정보

자료유형
학위논문
저자정보

유향미 (충북대학교, 충북대학교 대학원)

지도교수
徐在源
발행연도
2015
저작권
충북대학교 논문은 저작권에 의해 보호받습니다.

이용수0

표지
AI에게 요청하기
추천
검색

이 논문의 연구 히스토리 (2)

초록· 키워드

오류제보하기
Nowadays, the content growth of HD and the HD broadcasting service are offering users to enjoy high quality and high resolution. In the near future, the content growth of UHD and the UHD broadcasting service also will be offered to users following the demands to needs for higher quality and higher resolution. For these high quality and high resolution video, the HEVC standard, the next generation of video coding standard, was developed recently on the JCTVC team. This HEVC was aimed to have two times higher coding efficiency than H.264/AVC, and now HEVC has about 35% data compression ratio when compared to the H.264/AVC using HEVC Test Model (HM) 9.0.
The coding structure of the HEVC is based on the block based hybrid video coding structure by using the motion estimation/motion compensation (ME/MC) and discrete cosine transform (DCT) but it is much more sophisticated than the previous video coding standards. The fixed-size ME for the macroblock (MB) is changed into the variable-size prediction unit (PU) ME for the variable-size coding unit (CU). The H.264/AVC first introduced the variable-size ME varying from 16×16 down to 4×4 within the 16×16 MB and then achieved high video coding gain. However, the 16×16 block size is too small when applied to high resolution video such as 4k×2k and 8k×4k. For these high quality and resolution video sequences, the HEVC adapted a recursive quad-tree structured CU, which significantly improved coding efficiency but leaded to dramatic increase of the computational complexity.
To reduce the computational complexity of the HEVC encoder, the fast CU size decision algorithms for the fast encoding of HEVC are proposed in this paper. First, we propose a fast CU decision algorithm based on initial CU estimation and early PU termination by using the CBF and RD cost. The HEVC encoder tests almost every CU for finding the best CU combination, which begins with LCU and ends with the smallest CU. This unconditional encoding start with LCU tends to waste the encoding time. Thus, we predict the initial CU depth effectively by using spatial and temporal characteristics of the video sequence before LCU encoding. Therefore, unnecessary large size CU encoding could be skipped and we can reduce the encoding time. In addition, we skipped the remaining PU process by early PU termination algorithm. We check and save the CBF and RD cost for each Inter PU mode. If these CBF and RD cost are satisfied with our condition, any remaining PU process are terminated within the current CU. In addition, encoding of sub-CUs of the CU is omitted. If early Inter PU termination is not occurred during the process of Inter PU modes, we apply Intra PU skip algorithm based on sub-CBF values obtained in Inter PU modes. This proposed algorithm achieves significant encoding time saving. In random access coding, The average encoding time savings are 37.97%, 49.91 when the weighted factor α value is 1.0 and 1.5 respectively. In low-delay P coding, The average encoding time savings are 33.61%, 43.52% depending on the weighted factor α value.
we also propose the fast CU size decision based on hierarchical layer in temporal prediction structure of HEVC. This algorithm use the frame’s visual quality change depending on the hierarchical layers in random access structure which is one of the temporal prediction structures in HEVC to reduce the computational complexity in CU decision procedure. The structure of random access has four hierarchical layers according to the frame’s QP. Thus, the frames in this structure have the hierarchical visual quality change depending on layer. The proposed algorithm uses this characteristic of the hierarchical layer to select the reference in the previously encoded frame for estimating the current CU size early. And this algorithm performs the CU encoding from 64×64 CU to the predicted CU size. And also, In order to increase the rate of CU size decision more, the method using the distortion of SKIP mode is grafted onto the proposed algorithm. The proposed algorithm significantly reduce computational complexity of the HEVC encoder by up to 37.39% with only a small PSNR loss and bit rate increment.

목차

Ⅰ. 서론 1
Ⅱ. HEVC의 부호화 기술 8
2.1 HEVC의 블록 구조 9
2.1.1 CU (Coding Unit) 9
2.1.2 PU (Prediction Unit) 11
2.1.3 TU (Transform Unit) 12
2.2 CU 부호화 15
2.2.1 화면내 예측(Intra prediction) 15
2.2.2 화면간 예측(Inter prediction) 32
2.3 시간적 예측 구조 48
2.4 CU 크기 결정 방법 54
Ⅲ. 기존의 고속 CU 결정 기법들 57
3.1 HEVC 참조 소프트웨어에 추가된 고속 CU 크기 결정 기법들 57
3.1.1 Early Termination of CU Encoding to Reduce HEVC Complexity 57
3.1.2 Coding tree pruning based CU early termination 59
3.1.3 Early SKIP Detection for HEVC 62
3.2 다른 고속 CU 크기 결정 기법들 66
3.2.1 CU Depth Pruning for Fast Coding Tree Block Decision 66
3.2.2 Adaptive Coding Unit Early Termination Algorithm for HEVC 68
3.2.3 Early MERGE Mode Decision Based on Motion Estimation and Hierarchical Depth Correlation for HEVC 72
3.2.4 Early Coding Unit (CU) Splitting Termination Algorithm for High Efficiency Video Coding 75
Ⅳ. 제안하는 고속 CU 크기 결정 기법 80
4.1 초기 CU 크기 예측과 PU 모드 예측 비용을 이용한 고속 CU 크기 결정 기법 80
4.1.1 초기 CU 크기 결정 80
4.1.2 CBF와 PU모드 비용을 이용한 고속 CU 결정 84
4.1.3 Intra 모드 생략 87
4.2 HEVC의 시간적 예측 구조에서 계층별 프레임의 화질 변화 특성을 이용한 고속 CU 크기 결정 기법 89
4.2.1 시간적 예측 구조의 계층적 구조에서 현재 CU 크기 예측을 위한 프레임(REF_LOWLEVEL_FRAME)을 결정 89
4.2.2 현재 CU의 균일성(Homogeneity) 판별 94
4.2.3 전체적인 알고리즘 97
V. 실험결과 103
5.1 초기 CU 크기 예측과 PU 모드 예측 비용을 이용한 고속 CU 결정 기법의 실험결과 103
5.2 HEVC의 시간적 예측 구조에서 계층별 프레임의 화질 변화 특성을 이용한 고속 CU 크기 결정 기법의 실험결과 113
Ⅵ. 결론 121
참고문헌 123

최근 본 자료

전체보기

댓글(0)

0