A fast algorithm for macroblock mode selection in H.264 video coding
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Donghyung | - |
dc.contributor.author | Kim, Jongho | - |
dc.contributor.author | Kim, Seungjong | - |
dc.contributor.author | Jeong, Jechang | - |
dc.date.accessioned | 2022-12-21T10:38:37Z | - |
dc.date.available | 2022-12-21T10:38:37Z | - |
dc.date.created | 2022-08-26 | - |
dc.date.issued | 2006-09 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/181081 | - |
dc.description.abstract | To improve coding efficiency, the H.264 video coding standard uses new coding tools, such as variable block size, quarter-pixel-accuracy motion estimation, multiple reference frames, intra prediction and a loop filter. Using these coding tools, H.264 achieves significant improvement in coding efficiency compared with existing standards. However, encoder complexity also increases tremendously. Among the tools, macroblock mode selection and motion estimation contribute most to total encoder complexity. This paper focuses on complexity reduction in macroblock mode selection. Of the macroblock modes which can be selected, inter8x8 and intra4x4 have the highest complexity. We propose two methods for complexity reduction of inter8x8 and intra4x4 by using the costs of the other macroblock modes. Simulation results show that the proposed methods save about 53% of total encoding time compared with the H.264 reference implementation, whereas the average PSNR decreases less than 0.05 dB. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | SPRINGER-VERLAG BERLIN | - |
dc.title | A fast algorithm for macroblock mode selection in H.264 video coding | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kim, Donghyung | - |
dc.contributor.affiliatedAuthor | Jeong, Jechang | - |
dc.identifier.doi | 10.1007/11867586_43 | - |
dc.identifier.scopusid | 2-s2.0-33749666701 | - |
dc.identifier.wosid | 000241552700043 | - |
dc.identifier.bibliographicCitation | IMAGE ANALYSIS AND RECOGNITION, PT 1, v.4141, pp.458 - 467 | - |
dc.relation.isPartOf | IMAGE ANALYSIS AND RECOGNITION, PT 1 | - |
dc.citation.title | IMAGE ANALYSIS AND RECOGNITION, PT 1 | - |
dc.citation.volume | 4141 | - |
dc.citation.startPage | 458 | - |
dc.citation.endPage | 467 | - |
dc.type.rims | ART | - |
dc.type.docType | Article; Proceedings Paper | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Artificial Intelligence | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
dc.subject.keywordPlus | Algorithms | - |
dc.subject.keywordPlus | Computational complexity | - |
dc.subject.keywordPlus | Computer simulation | - |
dc.subject.keywordPlus | Motion estimation | - |
dc.identifier.url | https://link.springer.com/chapter/10.1007/11867586_43 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1365
COPYRIGHT © 2021 HANYANG UNIVERSITY.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.