Skip Navigation

IEICE Transactions on Information and Systems 2007 E90-D(5):872-876; doi:10.1093/ietisy/e90-d.5.872
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Request Permissions
Google Scholar
Right arrow Articles by DONG, Y.
Right arrow Articles by YANG, J.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Copyright © 2007 The Institute of Electronics, Information and Communication Engineers

Regular Section -- Letters -- Image Processing and Video Processing

Frame-Level {rho}-Domain R-D Optimization in H.264

Yutao DONG1, Xiangzhong FANG1 and Jing YANG1

1 The authors are with the Institute of Image Communication and Information Processing, Shanghai Jiao Tong University, Shanghai, 200240, P.R.C. E-mail: ytdong{at}sjtu.edu.cn


   Abstract

The frame-level R-D optimization in H.264 is very important in video storage scenarios. Among all of the sub-optimal algorithms, a greedy iteration algorithm (GIA) can best lower the computational complexity of frame-level R-D optimization. In order to further lower the computational complexity, a {rho}-domain frame-level R-D optimization algorithm is proposed in this letter. Different from GIA, every frame's rate and distortion can be estimated accurately without actual encoding in our proposed algorithm. Simulation results show that our proposed algorithm can lower the computational complexity greatly with negligible variation in peak signal-to-noise ratio (PSNR) compared with GIA.

Key Words: {rho}-domain, R-D optimization, H.264, frame-level


Manuscript received September 21, 2006. Manuscript revised November 19, 2006.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.