网站大量收购独家精品文档,联系QQ:2885784924

[工学]LectureNotes3.pdf

  1. 1、本文档共36页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
[工学]LectureNotes3

Principal Multimedia Signal Processing Techniques Prof. Lu Yu Institute of Information and Communication Engineering Zhejiang University 2005. 9 Multimedia Communication Outline of multimedia processing techniques Compression Watermaking Organization, storage and retrieval Multimedia processor Multimedia Communication Yu, Lu, 2005 2 Outline of compression Entropy coding Prediction coding Inter frame Intra frame Transform DCT Transform integer transform Hybrid coding Multimedia Communication Yu, Lu, 2005 3 Entropy of a Memoryless Source Let a memoryless source be characterized by an ensemble U0 with: Alphabet { a 0 ,a 1 ,a 2 , ... ,a K-1 } Probabilities { P(a 0 ), P(a 1 ), P(a 2 ), ..., P(a K-1 )} Shannon: information conveyed by message “a ” k I(a k ) = -log(P(a k )) “Entropy of the source” is the average information contents: H(U 0 ) = E{I(a k )} = -P(a k )*log (P(a k )) For „log“ = „log 2 “ the unit is bits/symbol Multimedia Communication Yu, Lu, 2005 4 Entropy and Bit-Rate Properties of entropy: H(U 0 ) = 0 max { H(U 0 )}=logK with P(a j )=P(a k ) for all j, k The entropy H(U 0 ) is a lower bound for the average word length l av of a decodable variable length code

文档评论(0)

ipbohn97 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档