A two level mode decision algorithm for H.264 high profile intra encoding

Fast‐efficient algorithm of high‐profile intra prediction for H.264 encoding system

“…The algorithm of paper [16] can save more computational time, where it reduces 57.2% time consumption but increases 2.4% BR. The algorithm of [17] can achieve low BR, but the saved time is not enough in applications of fast intra-prediction. The algorithm of the paper [18] is not good in BR increase and time saving.…”

“…The RD optimisation (RDO) would result in intensive computations. Recently, many papers on fast intra-prediction and its very large-scale integration architecture have been presented [2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17]. Parlak et al [2] proposed a method to check whether neighbouring pixels are equal.…”

“…Li et al [16] used an adaptive threshold to do a prediction based on the textual features and complexity of pictures. Chang [17] presented two-level predictions, where level one decides block size based on edge-smoothness, and level two decides prediction modes based on the correlation between adjacent blocks. Li et al [18] determined the complexity of a coding block by comparing its texture feature using a dual-threshold criterion.…”

Fast intra mode decision for depth map coding

“…The new 3D video coding standards aim to compress 3D video including multiview color data and its corresponding depth map. With color data and depth map, virtual views can be synthesized using Depth-Image-Based-Rendering (DIBR) technique [3]. However, the computation complexity for the encoder is increasing because of coding the additional depth map.…”

“…Several researches on reducing computation complexity of intra mode decision for H.264 encoder are presented. Chang proposes a two-level mode decision algorithm [3]. The block size is early decided based on edge information calculated by Sobel filter.…”