基于H.264/AVC的低秩矩阵补全的帧内预测

Jin Wang, Yunhui Shi, Wenpeng Ding, Baocai Yin
{"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}
引用次数: 5

摘要

帧内预测在减少H.264/AVC帧内编码的空间冗余方面起着重要的作用。为了提高预测效率,本文提出了一种基于低秩矩阵补全的图像内预测方法。根据低秩矩阵补全理论,在较温和的条件下,低秩矩阵可以在相当有限的样本中以高概率精确地恢复出来。经过适度的重排和组织,图像块可以表示为低秩或近似低秩矩阵。然后可以将内部预测公式化为矩阵补全问题,因此可以从有限的样本中以非常高的精度推断未知像素。具体而言,我们将与当前块相似的编码块进行新颖的重新排列,生成观测矩阵,通过求解低秩最小化问题得到预测。实验结果表明,与标准H.264/AVC相比,该方案可实现CIF序列的平均比特率节约5.39%,QCIF序列的平均比特率节约4.21%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信