Algorithmic Theory of Universal Source Coding with a Fidelity Criterion and Related Topics

具有保真度准则的通用源编码的算法理论及相关主题

• 批准号: 9508282
• 负责人: Zhen Zhang
• 金额: $ 38.64万
• 依托单位: University of Southern California
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 1995
• 资助国家: 美国
• 起止时间: 1995-09-01 至 1999-08-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9508282&HistoricalAwards=false
• 关键词: Algorithmic; Theory; Universal; Source; Coding

ABSTRACT: NCR-9508282, University of Southern California, "Algorithmic Theory of Universal Source Coding with a Fidelity Criterion and Related Topics", PI-Zhang: This project addresses the question "Can one design an on-line universal sequential source coding algorithm for lossy source coding?" What is meant by an on-line universal sequential lossy algorithm is that such an algorithm is sequential, achieves in one pass the rate-distortion limit, and has a short delay, good adaptivity, and relatively low coding complexity, so that it is suitable for on-line implementation. It will be necessary to study the basic properties of a universal lossy source coding algorithm, and this will require the development of systematic methods for algorithm analysis such as the analysis of the redundancy of an algorithm, the analysis of the robustness and coding complexity of an algorithm and other topics.*****************************************************************************Aubrey M. BushProgram Director, Acting Deputy Divison DirectorDivision of Networking and Communications Research and InfrastructureNational Science Foundation

摘要：NCR-9508282，南加州大学，“具有保真标准的通用源编码算法理论及相关主题”，PI-Zhang：该项目解决了“能否为有损源编码设计一种在线通用顺序源编码算法？”所谓在线通用序贯损耗算法，就是指该算法是连续的，一次通过即可达到率失真极限，并且具有较短的延迟、较好的自适应能力和较低的编码复杂度，适合在线实现。有必要研究通用有损源编码算法的基本性质，这将需要开发系统的算法分析方法，如算法冗余分析，算法的鲁棒性和编码复杂性分析等主题。***************************************************************************** 奥布里·m·BushProgram导演,代理副分工和DirectorDivision网络和通信研究和InfrastructureNational科学基金会