Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/82177
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Electronic and Information Engineering-
dc.creatorFu, CH-
dc.creatorChen, H-
dc.creatorChan, YL-
dc.creatorTsang, SH-
dc.creatorHong, H-
dc.creatorZhu, XH-
dc.date.accessioned2020-05-05T05:58:59Z-
dc.date.available2020-05-05T05:58:59Z-
dc.identifier.urihttp://hdl.handle.net/10397/82177-
dc.language.isoenen_US
dc.publisherInstitute of Electrical and Electronics Engineersen_US
dc.rightsThis work is licensed under a Creative Commons Attribution 4.0 License. For more information, see http://creativecommons.org/licenses/by/4.0/en_US
dc.rightsThe following publication C. Fu, H. Chen, Y. Chan, S. Tsang, H. Hong and X. Zhu, "Fast Depth Intra Coding Based on Decision Tree in 3D-HEVC," in IEEE Access, vol. 7, pp. 173138-173147, 2019 is available at https://dx.doi.org/10.1109/ACCESS.2019.2956994en_US
dc.subject3D-HEVCen_US
dc.subjectCU size decisionen_US
dc.subjectDecision treeen_US
dc.subjectGini thresholdsen_US
dc.subjectDepth intra codingen_US
dc.subjectFast mode decisionen_US
dc.titleFast depth intra coding based on decision tree in 33D-HEVCen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.spage173138-
dc.identifier.epage173147-
dc.identifier.volume7-
dc.identifier.doi10.1109/ACCESS.2019.2956994-
dcterms.abstractThe coding units (CU) partitioning in the 3D extension of the high efficiency video coding standard (3D-HEVC) is recursively conducted on different block sizes from 64 x 64 to 8 x 8. Besides, the depth coding in 3D-HEVC introduces several new coding tools for each CU to improve the coding efficiency, however, with great computational complexity. It is noted that only a small number of the CUs in recursive partitioning are encoded into the final bitstream. Among these CUs, the CUs with Intra 2N x 2N or Intra N x N as optimal modes have a very small proportion. In this paper, we thus propose an early determination of depth intra coding, where the coding stage of Intra 2N x 2N, Intra N x N or CU Splitting for the CUs could be early skipped based on several Decision Trees. Simulation results show that, with restrict the results from the tree leaves by different Gini thresholds, the proposed algorithm could save 41.14%-71.63% of the depth coding time with only a slight increase in BDBR.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationIEEE access, 2 Dec. 2019, v. 7, p. 173138-173147-
dcterms.isPartOfIEEE access-
dcterms.issued2019-
dc.identifier.isiWOS:000509374200144-
dc.identifier.eissn2169-3536-
dc.description.validate202006 bcrc-
dc.description.oaVersion of Recorden_US
dc.identifier.FolderNumberOA_Scopus/WOSen_US
dc.description.pubStatusPublisheden_US
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
Fu_Coding_Based_Decision.pdf7.19 MBAdobe PDFView/Open
Open Access Information
Status open access
File Version Version of Record
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

26
Citations as of Jul 3, 2022

Downloads

35
Citations as of Jul 3, 2022

SCOPUSTM   
Citations

7
Citations as of Jun 30, 2022

WEB OF SCIENCETM
Citations

7
Citations as of Jun 30, 2022

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.