Skip to main content Accessibility help
×
Home

Optimal I-frame assignment based on Nash bargaining solution in HEVC

  • Chia-Hung Yeh (a1) (a2), Ren-Fu Tseng (a2), Mei-Juan Chen (a3) and Chuan-Yu Chang (a4)

Abstract

In most of video coding standards such as high efficiency video coding (HEVC), I-frame assignment is periodic even when the content change is minor, which degrades the coding efficiency. This paper proposes an I-frame assignment method based on Nash bargaining solution (NBS) in game theory to solve this problem. The encoded sequence is divided into several subsequences. Each subsequence is regarded as a game. All group of picture (GOP) in a subsequence is further divided into several sets of GOP. Each set of GOP is regarded as a player and compete for the number of I-frames. The optimal I-frame assignment is determined based on the generalized NBS. Experimental results show the proposed method outperforms HEVC by 5.21% bitrate saving.

  • View HTML
    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      Optimal I-frame assignment based on Nash bargaining solution in HEVC
      Available formats
      ×

      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      Optimal I-frame assignment based on Nash bargaining solution in HEVC
      Available formats
      ×

      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      Optimal I-frame assignment based on Nash bargaining solution in HEVC
      Available formats
      ×

Copyright

This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.

Corresponding author

Corresponding author: C-H. Yeh Email: chyeh@ntnu.edu.tw

References

Hide All
[1]Wiegand, T.; Sullivan, G.J.; Bjøntegaard, G.; Luthra, A.: Overview of the H.264/AVC video coding standard. IEEE Trans. Circuits Syst. Video Technol. 13 (7) (2003), 560576.
[2]Al-Najdawi, N.; Al-Najdawi, M.N.; Tedmori, S.: Employing a novel cross-diamond search in a modified hierarchical search motion estimation algorithm for video compression. Inf. Sci. (Ny) 268 (2014), 425435.
[3]Alzoubi, H.; Pan, W.D.: Fast and accurate global motion estimation algorithm using pixel subsampling. Inf. Sci. (Ny) 178 (2008), 34153425.
[4]Cai, J.; Pan, W.D.: On fast and accurate block-based motion estimation algorithms using particle swarm optimization. Inf. Sci. (Ny) 197 (2012), 5364.
[5]Sullivan, G.J.; Ohm, J.-R.; Han, W.-J.; Wiegand, T.: Overview of the high efficiency video coding (HEVC) standard. IEEE Trans. Circuits Syst. Video Technol. 22 (12) (2013), 16491668.
[6]Goswami, K.; Lee, J.H.; Kim, B.G.: Fast algorithm for the high efficiency video coding (HEVC) encoder using texture analysis. Inf. Sci. (Ny) 364 (2016), 7290.
[7]Fang, Z.; Gao, Y.; Xiong, N.; Vasilakos, A.V.; Fang, Y.: A general effective rate control system based on matching measurement and inter-quantizer. Inf. Sci. (Ny) 346 (2016), 351368.
[8]Usman, M.; Jan, M.A.; He, X.: Cryptography-based secure data storage and sharing using HEVC and public clouds. Inf. Sci. (Ny) 387 (2017), 90102.
[9]Lee, J.; Shin, I.; Park, H.: Adaptive intra-frame assignment and bit-rate estimation for variable GOP length in H.264. IEEE Trans. Circuits Syst. Video Technol. 16 (10) (2006), 12711279.
[10]Ding, J.-R.; Yang, J.-F.: Adaptive group-of-pictures and scene change detection methods based on existing H.264 advanced video coding information. IET Image Proc. 2 (2008), 8594.
[11]Osborne, M.J.; Rubinstein, A.: A Course in Game Theory. MIT Press, Cambridge, MA, USA, 1994.
[12]Miranda, E.; Troffaes, M.C.; Destercke, S.: A geometric and game-theoretic study of the conjunction of possibility measures. Inf. Sci. (Ny) 298 (2015), 373389.
[13]Moretti, S.; Vasilakos, A.V.: An overview of recent applications of game theory to bioinformatics. Inf. Sci. (Ny) 180 (2010), 43124322.
[14]Esposito, C.; Castiglione, A.; Palmieri, F.; Ficco, M.: Building a network embedded FEC protocol by using game theory. Inf. Sci. (Ny) 433 (2017), 365380.
[15]Martínez-Cánovas, G.; Del Val, E.; Botti, V.; Hernández, P.; Rebollo, M.: A formal model based on game theory for the analysis of cooperation in distributed service discovery. Inf. Sci. (Ny) 326 (2016), 5970.
[16]Fan, Q.; Xiong, N.; Zeitouni, K.; Wu, Q.; Vasilakos, A.; Tian, Y.C.: Game balanced multi-factor multicast routing in sensor grid networks. Inf. Sci. (Ny) 367 (2016), 550572.
[17]Leboucher, C.; Shin, H.S.; Siarry, P.; Le Ménec, S.; Chelouah, R.; Tsourdos, A.: Convergence proof of an enhanced particle swarm optimisation method integrated with evolutionary game theory. Inf. Sci. (Ny) 346 (2016), 389411.
[18]Ahmad, T.; Luo, J.: On using game theory to optimize the rate control in video coding. IEEE Trans. Circuits Syst. Video Technol. 16 (2) (2006), 209219.
[19]Wang, X.; Kwong, S.; Zhang, Y.: Applying game theory to rate control optimization for hierarchical B-pictures. IEEE Trans. Broadcast. 59 (4) (2013), 591601.
[20]Yeh, C.-H.; Tseng, R.-F.: Optimal LCU level bit allocation based on game theory for HEVC rate control, in Proceedings of 2015 International Workshop on Advanced Image Technology, Tainan, Taiwan, January 2015.
[21]Nash, J.: The bargaining problem. Econometrica 18 (1950), 155162.
[22]Kalai, E.; Smorodinsky, M.: Other solutions to Nash's bargaining problem. Econometrica 43 (1975), 513518.
[23]Kuhn, H.W.; Tucker, A.W.: Nonlinear programming, in Proceedings of 2nd Berkeley Symposium on Mathematical Statistics and Probability, Berkeley, University of California Press, 1951, 481492.
[24]Sundaram, R.K.: A First Course in Optimization Theory. Cambridge University Press, Cambridge, 1996.
[25]HEVC Reference Software HM15.0. (2014 April) [Online]. Available: https://hevc.hhi.fraunhofer.de/trac/hevc/browser/branches/HM-15.0-dev.
[26]Bjontegaard, G.: Calculation of average PSNR differences between RD-curves, ITU-T, Austin, Texas, USA, Tech. Rep. VCEG-M33, April 2001.

Keywords

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed