视频编码采用三维DCT和动态码选择

M. Bauer, K. Sayood
{"title":"视频编码采用三维DCT和动态码选择","authors":"M. Bauer, K. Sayood","doi":"10.1109/DCC.1995.515561","DOIUrl":null,"url":null,"abstract":"Summary only given. We address the quality issue, and present a method for improved coding of the 3D DCT coefficients. Performance gain is achieved through the use of dynamically selected multiple coding algorithms. The resulting performance is excellent giving a compression ratio of greater than to 100:1 for image reproduction. The process consists of stacking 8 frames and breaking the data into 8/spl times/8/spl times/8 pixel cubes. The three dimensional DCT is applied to each cube. Each cube is then scanned in each dimension to determine if significant energy exists beyond the first two coefficients. Significance is determined with separate thresholds for each dimension. A single bit of side information is transmitted for each dimension of each cube to indicate whether more than two coefficients will be transmitted. The remaining coefficients of all cubes are reordered into a linear array such that the elements with the highest expected energies appear first and lower expected energies appear last. This tends to group coefficients with similar statistical properties for the most efficient coding. Eight different encoding methods are used to convert the coefficients into bits for transmission. The Viterbi algorithm is used to select the best coding method. The cost function is the number of bits that need to be sent. Each of the eight coding methods is optimized for a different range of values.","PeriodicalId":107017,"journal":{"name":"Proceedings DCC '95 Data Compression Conference","volume":"5 3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Video coding using 3 dimensional DCT and dynamic code selection\",\"authors\":\"M. Bauer, K. Sayood\",\"doi\":\"10.1109/DCC.1995.515561\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Summary only given. We address the quality issue, and present a method for improved coding of the 3D DCT coefficients. Performance gain is achieved through the use of dynamically selected multiple coding algorithms. The resulting performance is excellent giving a compression ratio of greater than to 100:1 for image reproduction. The process consists of stacking 8 frames and breaking the data into 8/spl times/8/spl times/8 pixel cubes. The three dimensional DCT is applied to each cube. Each cube is then scanned in each dimension to determine if significant energy exists beyond the first two coefficients. Significance is determined with separate thresholds for each dimension. A single bit of side information is transmitted for each dimension of each cube to indicate whether more than two coefficients will be transmitted. The remaining coefficients of all cubes are reordered into a linear array such that the elements with the highest expected energies appear first and lower expected energies appear last. This tends to group coefficients with similar statistical properties for the most efficient coding. Eight different encoding methods are used to convert the coefficients into bits for transmission. The Viterbi algorithm is used to select the best coding method. The cost function is the number of bits that need to be sent. Each of the eight coding methods is optimized for a different range of values.\",\"PeriodicalId\":107017,\"journal\":{\"name\":\"Proceedings DCC '95 Data Compression Conference\",\"volume\":\"5 3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-03-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings DCC '95 Data Compression Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DCC.1995.515561\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings DCC '95 Data Compression Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCC.1995.515561","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

仅给出摘要。我们解决了质量问题,并提出了一种改进的3D DCT系数编码方法。性能增益是通过使用动态选择的多种编码算法实现的。由此产生的性能非常出色,压缩比大于100:1用于图像再现。该过程包括堆叠8帧并将数据分解为8/spl次/8/spl次/8个像素立方体。将三维DCT应用于每个立方体。然后在每个维度上扫描每个立方体,以确定在前两个系数之外是否存在显著的能量。显著性是用每个维度单独的阈值来确定的。为每个立方体的每个维度传输单个位的侧信息,以指示是否要传输两个以上的系数。所有立方体的剩余系数被重新排序成一个线性数组,这样期望能量最高的元素首先出现,期望能量较低的元素最后出现。这倾向于将具有相似统计属性的系数分组,以获得最有效的编码。使用八种不同的编码方法将系数转换成比特进行传输。采用Viterbi算法选择最佳编码方法。cost函数是需要发送的比特数。八种编码方法中的每一种都针对不同的值范围进行了优化。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Video coding using 3 dimensional DCT and dynamic code selection
Summary only given. We address the quality issue, and present a method for improved coding of the 3D DCT coefficients. Performance gain is achieved through the use of dynamically selected multiple coding algorithms. The resulting performance is excellent giving a compression ratio of greater than to 100:1 for image reproduction. The process consists of stacking 8 frames and breaking the data into 8/spl times/8/spl times/8 pixel cubes. The three dimensional DCT is applied to each cube. Each cube is then scanned in each dimension to determine if significant energy exists beyond the first two coefficients. Significance is determined with separate thresholds for each dimension. A single bit of side information is transmitted for each dimension of each cube to indicate whether more than two coefficients will be transmitted. The remaining coefficients of all cubes are reordered into a linear array such that the elements with the highest expected energies appear first and lower expected energies appear last. This tends to group coefficients with similar statistical properties for the most efficient coding. Eight different encoding methods are used to convert the coefficients into bits for transmission. The Viterbi algorithm is used to select the best coding method. The cost function is the number of bits that need to be sent. Each of the eight coding methods is optimized for a different range of values.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Multiplication-free subband coding of color images Constraining the size of the instantaneous alphabet in trellis quantizers Classified conditional entropy coding of LSP parameters Lattice-based designs of direct sum codebooks for vector quantization On the performance of affine index assignments for redundancy free source-channel coding
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1