Telecommunications Science
Previous Articles Next Articles
Yao Yingbiao and Li Xiaojuan
Online:
Published:
Supported by:
Abstract: In order to reduce the intra coding complexity of HEVC, a fast block partitioning algorithm based on spatial correlation and image texture was proposed. Firstly, a concept of most possible depth range(MPDR) was proposed according to the correlation analysis of adjacent CTU depth range. Secondly, the difference between the current CTU texture and neighboring CTU texture was analyzed by detecting the dominant edge direction. According to the texture difference, the depth range of the current CTU was chose from MPDR and the origin range 0~3. Finally, a formula for texture complex threshold was formed by statistical calculation. Before CU coding, detect the texture complexity of the current CU by comparing the pixel variance and threshold, determine whether or not to skip the current unit coding calculation. Compared with HM13.0, experimental results reveal that the proposed algorithm can save about 20% computational complexity on average whereas the average bit rate increment is 0.84% and the decrement of PSNR is 0.04 dB.论文引用格式:姚英彪,李晓娟.基于图像空间相关性与纹理的HEVC块划分快速算法.电信科学,2015006Yao Y B,Li X J.Fast block partitioning algorithm for HEVC based on spatial correlation and image texture.Telecommunications Science,2015006
Yao Yingbiao and Li Xiaojuan. Fast Block Partitioning Algorithm for HEVC Based on Spatial Correlation and Image Texture[J]. Telecommunications Science.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://www.infocomm-journal.com/dxkx/EN/
https://www.infocomm-journal.com/dxkx/EN/Y2015/V31/I1/2015006