Multiple description transform coding: robustness to erasures using tight frame expansions

Vivek K Goyal, M. Vetterli, J. Kovacevic
{"title":"Multiple description transform coding: robustness to erasures using tight frame expansions","authors":"Vivek K Goyal, M. Vetterli, J. Kovacevic","doi":"10.1109/ISIT.1998.709013","DOIUrl":null,"url":null,"abstract":"We propose the use of a tight frame expansion for generalized multiple description coding. This method is conceptually very similar to using a block channel code, except it is done on continuous-valued data prior to quantization. A sketch of the distortion analysis is given.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"116","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.1998.709013","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 116

Abstract

We propose the use of a tight frame expansion for generalized multiple description coding. This method is conceptually very similar to using a block channel code, except it is done on continuous-valued data prior to quantization. A sketch of the distortion analysis is given.
多重描述变换编码:使用紧框架展开对擦除的鲁棒性
我们提出使用紧框架展开广义多重描述编码。这种方法在概念上与使用块信道代码非常相似,除了它是在量化之前对连续值数据进行的。给出了畸变分析的示意图。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信