Subscribe Now Subscribe Today
Science Alert
 
Blue
   
Curve Top
Information Technology Journal
  Year: 2010 | Volume: 9 | Issue: 4 | Page No.: 643-651
DOI: 10.3923/itj.2010.643.651
 
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail

Performance Modeling and Optimization of Hierarchical B Pictures Based on Directed Tree

Zheng Zhu, Dong-Xiao Li and Ming Zhang

Abstract:
A general methodology for performance modeling and optimization of hierarchical B pictures used in video coding is proposed in this study. First, an approach of directed tree decomposition is used to denote hierarchical B pictures. In combination with a proposed linear model for compression efficiency, the performance of any hierarchical B prediction structure can be evaluated conveniently from the directed tree. Then with a dynamic programming method, the optimal tree for any group length of hierarchical B pictures can be set up elegantly from recursive subtrees. This method can be adapted to tradeoff between compression efficiency and random access ability. Besides, experimental results show that the optimal tree of compression efficiency achieves higher performance than the existing hierarchical B prediction structures.
PDF Fulltext XML References Citation Report Citation
 RELATED ARTICLES:
  •    Stereo Matching for Dynamic Programming on TRIZ
How to cite this article:

Zheng Zhu, Dong-Xiao Li and Ming Zhang, 2010. Performance Modeling and Optimization of Hierarchical B Pictures Based on Directed Tree. Information Technology Journal, 9: 643-651.

DOI: 10.3923/itj.2010.643.651

URL: https://scialert.net/abstract/?doi=itj.2010.643.651

COMMENT ON THIS PAPER
 
 
 

 

 
 
 
 
 
 
 
 
 

 
 
 
 
 

Curve Bottom