{"title":"行内复制HEVC屏幕内容编码","authors":"Tsui-Shan Chang, Chun-Chi Chen, Ru-Ling Liao, Che-Wei Kuo, Wen-Hsiao Peng","doi":"10.1109/APSIPA.2014.7041533","DOIUrl":null,"url":null,"abstract":"This paper presents an intra line copy mode, which introduces a finer-granularity block partitioning structure for the intra copying technique, to further improve the coding efficiency for screen content. This mode first divides a prediction block horizontally or vertically into 1-pixel-wide lines and then operates intra copying line-by-line from the reconstructed pixels in the current frame. It shares some parallels with the notion of string matching widely used for lossless data compression. It, however, is more compliant to the current HEVC design and is parallel-friendly. This paper shall detail its various design issues, including the design of a fast algorithm based on hashing techniques and the impact of search window size on its performance and complexity trade-off. Experimental results show that the proposed mode can offer 2.7-12.9% of BD-rate reductions, with 26% increase of encoding runtime while keeping the decoding runtime unchanged, when integrated into the SCM-1.0 test model.","PeriodicalId":231382,"journal":{"name":"Signal and Information Processing Association Annual Summit and Conference (APSIPA), 2014 Asia-Pacific","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Intra line copy for HEVC screen content coding\",\"authors\":\"Tsui-Shan Chang, Chun-Chi Chen, Ru-Ling Liao, Che-Wei Kuo, Wen-Hsiao Peng\",\"doi\":\"10.1109/APSIPA.2014.7041533\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents an intra line copy mode, which introduces a finer-granularity block partitioning structure for the intra copying technique, to further improve the coding efficiency for screen content. This mode first divides a prediction block horizontally or vertically into 1-pixel-wide lines and then operates intra copying line-by-line from the reconstructed pixels in the current frame. It shares some parallels with the notion of string matching widely used for lossless data compression. It, however, is more compliant to the current HEVC design and is parallel-friendly. This paper shall detail its various design issues, including the design of a fast algorithm based on hashing techniques and the impact of search window size on its performance and complexity trade-off. Experimental results show that the proposed mode can offer 2.7-12.9% of BD-rate reductions, with 26% increase of encoding runtime while keeping the decoding runtime unchanged, when integrated into the SCM-1.0 test model.\",\"PeriodicalId\":231382,\"journal\":{\"name\":\"Signal and Information Processing Association Annual Summit and Conference (APSIPA), 2014 Asia-Pacific\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Signal and Information Processing Association Annual Summit and Conference (APSIPA), 2014 Asia-Pacific\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/APSIPA.2014.7041533\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Signal and Information Processing Association Annual Summit and Conference (APSIPA), 2014 Asia-Pacific","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APSIPA.2014.7041533","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
This paper presents an intra line copy mode, which introduces a finer-granularity block partitioning structure for the intra copying technique, to further improve the coding efficiency for screen content. This mode first divides a prediction block horizontally or vertically into 1-pixel-wide lines and then operates intra copying line-by-line from the reconstructed pixels in the current frame. It shares some parallels with the notion of string matching widely used for lossless data compression. It, however, is more compliant to the current HEVC design and is parallel-friendly. This paper shall detail its various design issues, including the design of a fast algorithm based on hashing techniques and the impact of search window size on its performance and complexity trade-off. Experimental results show that the proposed mode can offer 2.7-12.9% of BD-rate reductions, with 26% increase of encoding runtime while keeping the decoding runtime unchanged, when integrated into the SCM-1.0 test model.