Computational Complexity Reduction of HEVC by Early Termination of Transform Unit Partitioning Using Raster Scan Approach
High efficiency video coding (HEVC) is the newest video coding standard which has been developed by the Joint Collaborative Team on Video Coding (JCT-VC). The performance of the HEVC is superior to its predecessor standard, H.264. The compression efficiency of the HEVC is higher by 50% at one half o...
Gespeichert in:
Veröffentlicht in: | SN computer science 2024-02, Vol.5 (2), p.208, Article 208 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | 2 |
container_start_page | 208 |
container_title | SN computer science |
container_volume | 5 |
creator | Vaidya, Yogita M. Metkar, Shilpa P. |
description | High efficiency video coding (HEVC) is the newest video coding standard which has been developed by the Joint Collaborative Team on Video Coding (JCT-VC). The performance of the HEVC is superior to its predecessor standard, H.264. The compression efficiency of the HEVC is higher by 50% at one half of the bit-rate without compromising on the video quality. Each Coding Unit (CU) in the HEVC is accompanied by a Transform Unit (TU). The Quad-Tree partition of the CU and the Residual Quad Tree (RQT) partitioning of TU accounts for the significant computation complexity at the intra prediction mode of HEVC. We have extended the idea of partitioning each TU to the same depth of its corresponding CU. In the proposed paper, the Raster-Scan approach for pruning of the Quad-Tree structure of the TU is implemented. The proposed approach could reduce the computational complexity of HEVC at the intra prediction mode. The CU is partitioned into a Quad-Tree structure based on the Rate-Distortion (RD) cost computation. The CU partition structure is scanned by using the Raster Scan technique. The purpose of the scanning is to get an estimate of the depth of the partitioning of the current CU. During scanning, the depth of the current CU partition is extracted. The extracted partition depth level is considered as the best depth level for the subsequent TU. Once the best TU depth is identified, further partitioning of the TU within the given CU is terminated. Thus, the pruning of the RQT of the TU reduces the computational burden of the HEVC at intra prediction mode. The reduction in computation complexity is measured in terms of the saving in the overall encoding time. We have achieved an average reduction of 37% in the total encoding time in comparison to the standard HM reference model. The peak signal to noise ratio (PSNR) is slightly increased by an average of 0.0052 with the average bit-rate reduction of 0.9 bits/s. The detailed analysis of the effect of the quantization parameter (QP) on the total encoding time is presented for four different QP values. The encoding time is drastically reduced with a negligible loss in the image quality. |
doi_str_mv | 10.1007/s42979-023-02538-x |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2933545337</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2933545337</sourcerecordid><originalsourceid>FETCH-LOGICAL-c185x-d3eba0e9067600a9ec1b8e20a1a934aa42ef767a663d7dc944ef5b06bc5d06a03</originalsourceid><addsrcrecordid>eNp9UEtPg0AQJkYTm9o_4GkTz-jALgscG1IfSRNNbb1uhmWpNLzchQT-vYto9ORh3t83k_kc59qDWw8gvDPMj8PYBZ9aC2jkDmfOwufcc6MYwvM_-aWzMuYEYGHAGA8Wzpg0Vdt32BVNjSWZqlINRTeSncp6ObVJk5PHzVtC0pFsUJcj2StdFTX-DPcaa5M3uiKHuujIC-qumGZFfSQHM_kdmk5p8iqxJuu21Q3K9yvnIsfSqNV3XDqH-80-eXS3zw9PyXrrSi8KBjejKkVQMfCQA2CspJdGygf0MKYMkfkqD3mInNMszGTMmMqDFHgqgww4Al06N_Nee_ajV6YTp6bX9lkj_JjSgAWUhhblzyipG2O0ykWriwr1KDwQk8piVllYlcWXymKwJDqTjAXXR6V_V__D-gS0-oH_</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2933545337</pqid></control><display><type>article</type><title>Computational Complexity Reduction of HEVC by Early Termination of Transform Unit Partitioning Using Raster Scan Approach</title><source>SpringerLink Journals - AutoHoldings</source><creator>Vaidya, Yogita M. ; Metkar, Shilpa P.</creator><creatorcontrib>Vaidya, Yogita M. ; Metkar, Shilpa P.</creatorcontrib><description>High efficiency video coding (HEVC) is the newest video coding standard which has been developed by the Joint Collaborative Team on Video Coding (JCT-VC). The performance of the HEVC is superior to its predecessor standard, H.264. The compression efficiency of the HEVC is higher by 50% at one half of the bit-rate without compromising on the video quality. Each Coding Unit (CU) in the HEVC is accompanied by a Transform Unit (TU). The Quad-Tree partition of the CU and the Residual Quad Tree (RQT) partitioning of TU accounts for the significant computation complexity at the intra prediction mode of HEVC. We have extended the idea of partitioning each TU to the same depth of its corresponding CU. In the proposed paper, the Raster-Scan approach for pruning of the Quad-Tree structure of the TU is implemented. The proposed approach could reduce the computational complexity of HEVC at the intra prediction mode. The CU is partitioned into a Quad-Tree structure based on the Rate-Distortion (RD) cost computation. The CU partition structure is scanned by using the Raster Scan technique. The purpose of the scanning is to get an estimate of the depth of the partitioning of the current CU. During scanning, the depth of the current CU partition is extracted. The extracted partition depth level is considered as the best depth level for the subsequent TU. Once the best TU depth is identified, further partitioning of the TU within the given CU is terminated. Thus, the pruning of the RQT of the TU reduces the computational burden of the HEVC at intra prediction mode. The reduction in computation complexity is measured in terms of the saving in the overall encoding time. We have achieved an average reduction of 37% in the total encoding time in comparison to the standard HM reference model. The peak signal to noise ratio (PSNR) is slightly increased by an average of 0.0052 with the average bit-rate reduction of 0.9 bits/s. The detailed analysis of the effect of the quantization parameter (QP) on the total encoding time is presented for four different QP values. The encoding time is drastically reduced with a negligible loss in the image quality.</description><identifier>ISSN: 2661-8907</identifier><identifier>ISSN: 2662-995X</identifier><identifier>EISSN: 2661-8907</identifier><identifier>DOI: 10.1007/s42979-023-02538-x</identifier><language>eng</language><publisher>Singapore: Springer Nature Singapore</publisher><subject>Algorithms ; Coding ; Complexity ; Computation ; Computer Imaging ; Computer Science ; Computer Systems Organization and Communication Networks ; Data Structures and Information Theory ; Efficiency ; Image quality ; Information Systems and Communication Service ; Original Research ; Partitioning ; Pattern Recognition and Graphics ; Pruning ; Raster ; Raster scanning ; Signal to noise ratio ; Software Engineering/Programming and Operating Systems ; Video compression ; Vision</subject><ispartof>SN computer science, 2024-02, Vol.5 (2), p.208, Article 208</ispartof><rights>The Author(s), under exclusive licence to Springer Nature Singapore Pte Ltd 2024. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c185x-d3eba0e9067600a9ec1b8e20a1a934aa42ef767a663d7dc944ef5b06bc5d06a03</cites><orcidid>0000-0001-8621-7347</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s42979-023-02538-x$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s42979-023-02538-x$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,776,780,27901,27902,41464,42533,51294</link.rule.ids></links><search><creatorcontrib>Vaidya, Yogita M.</creatorcontrib><creatorcontrib>Metkar, Shilpa P.</creatorcontrib><title>Computational Complexity Reduction of HEVC by Early Termination of Transform Unit Partitioning Using Raster Scan Approach</title><title>SN computer science</title><addtitle>SN COMPUT. SCI</addtitle><description>High efficiency video coding (HEVC) is the newest video coding standard which has been developed by the Joint Collaborative Team on Video Coding (JCT-VC). The performance of the HEVC is superior to its predecessor standard, H.264. The compression efficiency of the HEVC is higher by 50% at one half of the bit-rate without compromising on the video quality. Each Coding Unit (CU) in the HEVC is accompanied by a Transform Unit (TU). The Quad-Tree partition of the CU and the Residual Quad Tree (RQT) partitioning of TU accounts for the significant computation complexity at the intra prediction mode of HEVC. We have extended the idea of partitioning each TU to the same depth of its corresponding CU. In the proposed paper, the Raster-Scan approach for pruning of the Quad-Tree structure of the TU is implemented. The proposed approach could reduce the computational complexity of HEVC at the intra prediction mode. The CU is partitioned into a Quad-Tree structure based on the Rate-Distortion (RD) cost computation. The CU partition structure is scanned by using the Raster Scan technique. The purpose of the scanning is to get an estimate of the depth of the partitioning of the current CU. During scanning, the depth of the current CU partition is extracted. The extracted partition depth level is considered as the best depth level for the subsequent TU. Once the best TU depth is identified, further partitioning of the TU within the given CU is terminated. Thus, the pruning of the RQT of the TU reduces the computational burden of the HEVC at intra prediction mode. The reduction in computation complexity is measured in terms of the saving in the overall encoding time. We have achieved an average reduction of 37% in the total encoding time in comparison to the standard HM reference model. The peak signal to noise ratio (PSNR) is slightly increased by an average of 0.0052 with the average bit-rate reduction of 0.9 bits/s. The detailed analysis of the effect of the quantization parameter (QP) on the total encoding time is presented for four different QP values. The encoding time is drastically reduced with a negligible loss in the image quality.</description><subject>Algorithms</subject><subject>Coding</subject><subject>Complexity</subject><subject>Computation</subject><subject>Computer Imaging</subject><subject>Computer Science</subject><subject>Computer Systems Organization and Communication Networks</subject><subject>Data Structures and Information Theory</subject><subject>Efficiency</subject><subject>Image quality</subject><subject>Information Systems and Communication Service</subject><subject>Original Research</subject><subject>Partitioning</subject><subject>Pattern Recognition and Graphics</subject><subject>Pruning</subject><subject>Raster</subject><subject>Raster scanning</subject><subject>Signal to noise ratio</subject><subject>Software Engineering/Programming and Operating Systems</subject><subject>Video compression</subject><subject>Vision</subject><issn>2661-8907</issn><issn>2662-995X</issn><issn>2661-8907</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><recordid>eNp9UEtPg0AQJkYTm9o_4GkTz-jALgscG1IfSRNNbb1uhmWpNLzchQT-vYto9ORh3t83k_kc59qDWw8gvDPMj8PYBZ9aC2jkDmfOwufcc6MYwvM_-aWzMuYEYGHAGA8Wzpg0Vdt32BVNjSWZqlINRTeSncp6ObVJk5PHzVtC0pFsUJcj2StdFTX-DPcaa5M3uiKHuujIC-qumGZFfSQHM_kdmk5p8iqxJuu21Q3K9yvnIsfSqNV3XDqH-80-eXS3zw9PyXrrSi8KBjejKkVQMfCQA2CspJdGygf0MKYMkfkqD3mInNMszGTMmMqDFHgqgww4Al06N_Nee_ajV6YTp6bX9lkj_JjSgAWUhhblzyipG2O0ykWriwr1KDwQk8piVllYlcWXymKwJDqTjAXXR6V_V__D-gS0-oH_</recordid><startdate>20240201</startdate><enddate>20240201</enddate><creator>Vaidya, Yogita M.</creator><creator>Metkar, Shilpa P.</creator><general>Springer Nature Singapore</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>JQ2</scope><orcidid>https://orcid.org/0000-0001-8621-7347</orcidid></search><sort><creationdate>20240201</creationdate><title>Computational Complexity Reduction of HEVC by Early Termination of Transform Unit Partitioning Using Raster Scan Approach</title><author>Vaidya, Yogita M. ; Metkar, Shilpa P.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c185x-d3eba0e9067600a9ec1b8e20a1a934aa42ef767a663d7dc944ef5b06bc5d06a03</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Algorithms</topic><topic>Coding</topic><topic>Complexity</topic><topic>Computation</topic><topic>Computer Imaging</topic><topic>Computer Science</topic><topic>Computer Systems Organization and Communication Networks</topic><topic>Data Structures and Information Theory</topic><topic>Efficiency</topic><topic>Image quality</topic><topic>Information Systems and Communication Service</topic><topic>Original Research</topic><topic>Partitioning</topic><topic>Pattern Recognition and Graphics</topic><topic>Pruning</topic><topic>Raster</topic><topic>Raster scanning</topic><topic>Signal to noise ratio</topic><topic>Software Engineering/Programming and Operating Systems</topic><topic>Video compression</topic><topic>Vision</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Vaidya, Yogita M.</creatorcontrib><creatorcontrib>Metkar, Shilpa P.</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Computer Science Collection</collection><jtitle>SN computer science</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Vaidya, Yogita M.</au><au>Metkar, Shilpa P.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Computational Complexity Reduction of HEVC by Early Termination of Transform Unit Partitioning Using Raster Scan Approach</atitle><jtitle>SN computer science</jtitle><stitle>SN COMPUT. SCI</stitle><date>2024-02-01</date><risdate>2024</risdate><volume>5</volume><issue>2</issue><spage>208</spage><pages>208-</pages><artnum>208</artnum><issn>2661-8907</issn><issn>2662-995X</issn><eissn>2661-8907</eissn><abstract>High efficiency video coding (HEVC) is the newest video coding standard which has been developed by the Joint Collaborative Team on Video Coding (JCT-VC). The performance of the HEVC is superior to its predecessor standard, H.264. The compression efficiency of the HEVC is higher by 50% at one half of the bit-rate without compromising on the video quality. Each Coding Unit (CU) in the HEVC is accompanied by a Transform Unit (TU). The Quad-Tree partition of the CU and the Residual Quad Tree (RQT) partitioning of TU accounts for the significant computation complexity at the intra prediction mode of HEVC. We have extended the idea of partitioning each TU to the same depth of its corresponding CU. In the proposed paper, the Raster-Scan approach for pruning of the Quad-Tree structure of the TU is implemented. The proposed approach could reduce the computational complexity of HEVC at the intra prediction mode. The CU is partitioned into a Quad-Tree structure based on the Rate-Distortion (RD) cost computation. The CU partition structure is scanned by using the Raster Scan technique. The purpose of the scanning is to get an estimate of the depth of the partitioning of the current CU. During scanning, the depth of the current CU partition is extracted. The extracted partition depth level is considered as the best depth level for the subsequent TU. Once the best TU depth is identified, further partitioning of the TU within the given CU is terminated. Thus, the pruning of the RQT of the TU reduces the computational burden of the HEVC at intra prediction mode. The reduction in computation complexity is measured in terms of the saving in the overall encoding time. We have achieved an average reduction of 37% in the total encoding time in comparison to the standard HM reference model. The peak signal to noise ratio (PSNR) is slightly increased by an average of 0.0052 with the average bit-rate reduction of 0.9 bits/s. The detailed analysis of the effect of the quantization parameter (QP) on the total encoding time is presented for four different QP values. The encoding time is drastically reduced with a negligible loss in the image quality.</abstract><cop>Singapore</cop><pub>Springer Nature Singapore</pub><doi>10.1007/s42979-023-02538-x</doi><orcidid>https://orcid.org/0000-0001-8621-7347</orcidid></addata></record> |
fulltext | fulltext |
identifier | ISSN: 2661-8907 |
ispartof | SN computer science, 2024-02, Vol.5 (2), p.208, Article 208 |
issn | 2661-8907 2662-995X 2661-8907 |
language | eng |
recordid | cdi_proquest_journals_2933545337 |
source | SpringerLink Journals - AutoHoldings |
subjects | Algorithms Coding Complexity Computation Computer Imaging Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Efficiency Image quality Information Systems and Communication Service Original Research Partitioning Pattern Recognition and Graphics Pruning Raster Raster scanning Signal to noise ratio Software Engineering/Programming and Operating Systems Video compression Vision |
title | Computational Complexity Reduction of HEVC by Early Termination of Transform Unit Partitioning Using Raster Scan Approach |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-29T15%3A23%3A42IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Computational%20Complexity%20Reduction%20of%20HEVC%20by%20Early%20Termination%20of%20Transform%20Unit%20Partitioning%20Using%20Raster%20Scan%20Approach&rft.jtitle=SN%20computer%20science&rft.au=Vaidya,%20Yogita%20M.&rft.date=2024-02-01&rft.volume=5&rft.issue=2&rft.spage=208&rft.pages=208-&rft.artnum=208&rft.issn=2661-8907&rft.eissn=2661-8907&rft_id=info:doi/10.1007/s42979-023-02538-x&rft_dat=%3Cproquest_cross%3E2933545337%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2933545337&rft_id=info:pmid/&rfr_iscdi=true |