IntroductiontoJPEG,MPEG12,andH.261H.263.ppt

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

Introduction to JPEG, MPEG 1/2, and H.261/H.263 Chuan-Yu Cho Outline Video/Image Compression Still Image Compression JPEG/ JPEG 2000 Joint Photographic Experts Group‘ Video Compression H.261, H.263, H.263+, MPEG-1, MPEG-2, MPEG-4, MPEG-7, MPEG-21. Still Image Coding JPEG, JPEG2000 Image/Video Redundancy Spatial redundancy Transform coding Encoder Decoder Block-Based Coding Why divide to blocks? Image-Blocks Example of JPEG Coding(Encoder) Example of JPEG Coding(decoder) Transform coding Encoder Decoder Transform Basis of Transform Basis vectors{v1,v2,…,vn} Orthogonal : (vi)·(vj) = 0 if i!=j Normalized : (vi)·(vi) = 1 Orthonormal : orthogonal and normalized eg. orthonormal : {(0,1),(1,0)} Orthogonal : {(1,1),(-1,1)} Why DCT is used for image compressing KLT(Karhunen-Loeve transform): Statistically optimal transform: minimal MSE for any specific bandwidth reduction KLT depends on the type of signal statistics No fast algorithm DCT approaches KLT for highly correlated signals: sample values typically vary slowly from point to point across an image =Highly correlated signals Fast algorithm(but not optimal) DCT-basis DCT :Discrete Cosine Transform Example of JPEG Coding(Encoder) Transform coding Encoder Decoder Quantization 目的:提高壓縮倍率 缺點:還原後的值會有誤差 原則:希望還原後的值,與原值差距較小 Quantization(con’t) DC term:Uniform quantization AC terms Example of JPEG Coding(Encoder) Example of JPEG Coding(Encoder) Transform coding Encoder Decoder Zigzag Scan 2D-1D Example of JPEG Coding(Encoder) Transform coding Encoder Decoder Entropy Coding (Variable-Length Coding) Huffman coding Run-length coding Arithmetic coding Huffman Coding 設法讓”出現次數最多”的字(word),使用最短的代碼(code) DPCM : Differential PCM 若連續出現重複字(word)或相近字的機率很高,則coding”差值”會比個別coding每個字效果好 例如‘AAFFFFFCCC’ PCM =’65,65,70,70,70,70,70,67,67,67’or ‘0,0,5,5,5,5,5,2,2,2’ DPCM =’0,0,5,0,0,0,0,-3,0,0’ Run-Length Coding Video Coding MPEG I/II, H.261/H.263 Main Ideas of Still Image Coding (Intra Coding) Block-based coding Transform coding

文档评论(0)

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

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

1亿VIP精品文档

相关文档