An efficient block mode decision for temporal scalability in scalable video coding

Lee, Bumshik; Kim, Munchurl; Hahm, Sangjin; Park, Changseob; Park, Keunsoo

doi:10.1117/12.765858

Cited by 4 publications

(6 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If all are measured in ratio, our time saving is better than [29] by about 10% with a slightly better RD quality. And our time saving is slightly worse than [30] by 5% but both the PSNR and the bit rate losses are 50% better. However, we like to point out that our approach, focusing on the temporal prediction type reduction, is very different from the fast mode decision schemes in [29] and [30].…”

Section: Performance Comparison With Other Fast Algorithmsmentioning

confidence: 97%

“…The Lee's method [30] has the best time saving at about 65%, but it has also the highest coding quality loss, 0.15 dB Y-PSNR and 3.6% bits. Our scheme has roughly the least RD loss, 0.08 dB Y-PSNR and 1.8% bits, and its time saving is about 62%.…”

Section: Performance Comparison With Other Fast Algorithmsmentioning

confidence: 99%

“…In addition to the exhaustive search, we also compare our approaches with two well recognized fast algorithms, Li's method [29] and Lee's method [30]; both save the computing time based on mode reduction. Therefore, our approach is very different from theirs.…”

Section: Performance Comparison With Other Fast Algorithmsmentioning

confidence: 99%

“…Based on these analyses, Section IV presents our fast bi-directional prediction selection algorithm. In Section V, our proposed scheme is compared with JSVM 9.11 [6] and the state-of-the-art algorithms [29], [30] in terms of complexity reduction and RD performance. Lastly, Section VI ends with a summary of our work.…”

Section: Introductionmentioning

confidence: 99%

“…In [29], the characteristics of low/high-motion areas at low temporal layers are employed to select the block mode at high temporal layers. Lee et al [30] make use of the statistical hypothesis testing to conditionally skip the partitions smaller than 16 16. However, only the encoding parameter in the mode partition is considered in constructing their fast algorithms.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Fast Bi-Directional Prediction Selection in H.264/MPEG-4 AVC Temporal Scalable Video Coding

Lin

Hang

Peng

2011

IEEE Trans. on Image Process.

View full text Add to dashboard Cite

Abstract-In this paper, we propose a fast algorithm that efficiently selects the temporal prediction type for the dyadic hierarchical-B prediction structure in the H.264/MPEG-4 temporal scalable video coding (SVC). We make use of the strong correlations in prediction type inheritance to eliminate the superfluous computations for the bi-directional (BI) prediction in the finer partitions, , by referring to the best temporal prediction type of 16 16. In addition, we carefully examine the relationship in motion bit-rate costs and distortions between the BI and the uni-directional temporal prediction types. As a result, we construct a set of adaptive thresholds to remove the unnecessary BI calculations. Moreover, for the block partitions smaller than 8 8, either the forward prediction (FW) or the backward prediction (BW) is skipped based upon the information of their 8 8 partitions. Hence, the proposed schemes can efficiently reduce the extensive computational burden in calculating the BI prediction. As compared to the JSVM 9.11 software, our method saves the encoding time from 48% to 67% for a large variety of test videos over a wide range of coding bit-rates and has only a minor coding performance loss.Index Terms-Bi-directional prediction, bi-directionally predictive frame, encoder optimization, hierarchical prediction structure, H.264/MPEG-4 AVC scalable video coding, temporal scalability.

show abstract