• Türkçe
    • English
  • English 
    • Türkçe
    • English
  • Login
View Item 
  •   DSpace@Işık
  • 1- Fakülteler | Faculties
  • Mühendislik Fakültesi / Faculty of Engineering
  • Elektrik-Elektronik Mühendisliği Bölümü / Department of Electrical-Electronics Engineering
  • MF - Makale Koleksiyonu | Elektrik-Elektronik Mühendisliği Bölümü / Department of Electrical-Electronics Engineering
  • View Item
  •   DSpace@Işık
  • 1- Fakülteler | Faculties
  • Mühendislik Fakültesi / Faculty of Engineering
  • Elektrik-Elektronik Mühendisliği Bölümü / Department of Electrical-Electronics Engineering
  • MF - Makale Koleksiyonu | Elektrik-Elektronik Mühendisliği Bölümü / Department of Electrical-Electronics Engineering
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Rate-distortion and complexity optimized motion estimation for H.264 video coding

Thumbnail

View/Open

Publisher's Version (962.6Kb)
Author Post Print (301.7Kb)

Date

2008-02

Author

Ateş, Hasan Fehmi
Altunbaşak, Yücel

Metadata

Show full item record

Citation

Ateş, H. F. & Altunbasak, Y. (2008). Rate-distortion and complexity optimized motion estimation for H.264 video coding. IEEE Transactions on Circuits and Systems for Video Technology, 18; 16(2), 159-171. doi:10.1109/TCSVT.2008.918114

Abstract

11.264 video coding standard supports several inter-prediction coding modes that use macroblock (MB) partitions with variable block sizes. Rate-distortion (R-D) optimal selection of both the motion vectors (MVs) and the coding mode of each MB is essential for an H.264 encoder to achieve superior coding efficiency. Unfortunately, searching for optimal MVs of each possible subblock incurs a heavy computational cost. In this paper, in order to reduce the computational burden of integer-pel motion estimation (ME) without sacrificing from the coding performance, we propose a R-D and complexity joint optimization framework. Within this framework, we develop a simple method that determines for each MB which partitions are likely to be optimal. MV search is carried out for only the selected partitions, thus reducing the complexity of the ME step. The mode selection criteria is based on a measure of spatiotemporal activity within the MB. The procedure minimizes the coding loss at a given level of computational complexity either for the full video sequence or for each single frame. For the latter case, the algorithm provides a tight upper bound on the worst case complexity/execution time of the ME module. Simulation results show that the algorithm speeds up integer-pel ME by a factor of up to 40 with less than 0.2 dB loss in coding efficiency.

Source

IEEE Transactions on Circuits and Systems for Video Technology

Volume

18

Issue

2

URI

https://hdl.handle.net/11729/300
http://dx.doi.org/10.1109/TCSVT.2008.918114

Collections

  • MF - Makale Koleksiyonu | Elektrik-Elektronik Mühendisliği Bölümü / Department of Electrical-Electronics Engineering [181]
  • Scopus İndeksli Makale Koleksiyonu [916]
  • WoS İndeksli Makale Koleksiyonu [933]



DSpace software copyright © 2002-2015  DuraSpace
Contact Us | Send Feedback
Theme by 
@mire NV
 

 




| Policy | Guide | Contact |

DSpace@Işık

by OpenAIRE
Advanced Search

sherpa/romeo

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsTypeLanguageDepartmentCategoryPublisherAccess TypeIşık AuthorCitationThis CollectionBy Issue DateAuthorsTitlesSubjectsTypeLanguageDepartmentCategoryPublisherAccess TypeIşık AuthorCitation

My Account

LoginRegister

Statistics

View Google Analytics Statistics

DSpace software copyright © 2002-2015  DuraSpace
Contact Us | Send Feedback
Theme by 
@mire NV
 

 


|| Policy || Guide || Library || Işık University || OAI-PMH ||

Işık University Library, Şile, İstanbul, Turkey
If you find any errors in content please report us

Creative Commons License
Işık University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..

DSpace@Işık:


DSpace 6.2

tarafından İdeal DSpace hizmetleri çerçevesinde özelleştirilerek kurulmuştur.