{"title":"基于H.264/AVC的低秩矩阵补全的帧内预测","authors":"Jin Wang, Yunhui Shi, Wenpeng Ding, Baocai Yin","doi":"10.1109/MMSP.2011.6093848","DOIUrl":null,"url":null,"abstract":"Intra prediction plays an important role in reducing the spatial redundancy for intra frame encoding in H.264/AVC. In this paper, we propose a low-rank matrix completion based intra prediction to improve the prediction efficiency. According to the low-rank matrix completion theory, a low-rank matrix can be exactly recovered from quite limited samples with high probability under mild conditions. After moderate rearrangement and organization, image blocks can be represented as low-rank or approximately low-rank matrix. The intra prediction can then be formulated as a matrix completion problem, thus the unknown pixels can be inferred from limited samples with very high accuracy. Specifically, we novelly rearrange the encoded blocks similar to the current block to generate an observation matrix, from which the prediction can be obtained by solving a low-rank minimization problem. Experimental results demonstrate that the proposed scheme can achieve averagely 5.39% bit-rate saving for CIF sequences and 4.21% for QCIF sequences compared with standard H.264/AVC.","PeriodicalId":214459,"journal":{"name":"2011 IEEE 13th International Workshop on Multimedia Signal Processing","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"A low-rank matrix completion based intra prediction for H.264/AVC\",\"authors\":\"Jin Wang, Yunhui Shi, Wenpeng Ding, Baocai Yin\",\"doi\":\"10.1109/MMSP.2011.6093848\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Intra prediction plays an important role in reducing the spatial redundancy for intra frame encoding in H.264/AVC. In this paper, we propose a low-rank matrix completion based intra prediction to improve the prediction efficiency. According to the low-rank matrix completion theory, a low-rank matrix can be exactly recovered from quite limited samples with high probability under mild conditions. After moderate rearrangement and organization, image blocks can be represented as low-rank or approximately low-rank matrix. The intra prediction can then be formulated as a matrix completion problem, thus the unknown pixels can be inferred from limited samples with very high accuracy. Specifically, we novelly rearrange the encoded blocks similar to the current block to generate an observation matrix, from which the prediction can be obtained by solving a low-rank minimization problem. Experimental results demonstrate that the proposed scheme can achieve averagely 5.39% bit-rate saving for CIF sequences and 4.21% for QCIF sequences compared with standard H.264/AVC.\",\"PeriodicalId\":214459,\"journal\":{\"name\":\"2011 IEEE 13th International Workshop on Multimedia Signal Processing\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE 13th International Workshop on Multimedia Signal Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MMSP.2011.6093848\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE 13th International Workshop on Multimedia Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MMSP.2011.6093848","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A low-rank matrix completion based intra prediction for H.264/AVC
Intra prediction plays an important role in reducing the spatial redundancy for intra frame encoding in H.264/AVC. In this paper, we propose a low-rank matrix completion based intra prediction to improve the prediction efficiency. According to the low-rank matrix completion theory, a low-rank matrix can be exactly recovered from quite limited samples with high probability under mild conditions. After moderate rearrangement and organization, image blocks can be represented as low-rank or approximately low-rank matrix. The intra prediction can then be formulated as a matrix completion problem, thus the unknown pixels can be inferred from limited samples with very high accuracy. Specifically, we novelly rearrange the encoded blocks similar to the current block to generate an observation matrix, from which the prediction can be obtained by solving a low-rank minimization problem. Experimental results demonstrate that the proposed scheme can achieve averagely 5.39% bit-rate saving for CIF sequences and 4.21% for QCIF sequences compared with standard H.264/AVC.