一個使用赫夫曼編碼和最長前置碼編碼的行無損畫面壓縮器

簡易檢索 / 詳目顯示

回結果列表

研究生：	陳思靜 Chen, Sze Ching
論文名稱：	一個使用赫夫曼編碼和最長前置碼編碼的行無損畫面壓縮器 A Line-Based Lossless Display Frame Compressor Using Huffman Coding and Longest Prefix Match Coding
指導教授：	林永隆 Lin, Youn Long
口試委員:	黃稚存 Huang, Chih Tsun 王家祥 Wang, Jia Shung
學位類別：	碩士 Master
系所名稱：	電機資訊學院 - 資訊工程學系 Computer Science
論文出版年：	2016
畢業學年度：	104
語文別：	英文
論文頁數：	44
中文關鍵詞：	HEVC 、畫面間壓縮器、無損壓縮演算法
外文關鍵詞：	HEVC, Display Frame Compressor, Lossless Compression Algorithm
相關次數：	點閱：3 下載：0
分享至:	分享至facebook 分享至twitter

查詢本校圖書館目錄查詢臺灣博碩士論文知識加值系統勘誤回報

我們提出了一個針對影像畫面間壓縮的無損演算法，其中包含了字典編碼方法、赫夫曼演算法以及三個方式以達到更高的壓縮率。我們藉由分析當前像素和其週遭像素間差值的分佈，發現了當此差值的絕對值越低其比率越高，根據前述差值分佈數據，我們可以計算出當使用不同數量編碼時候的資料壓縮率，並且發現了使用越多數量的編碼壓縮比率會越高但是會趨於平緩。考慮到記憶體的使用，在此論文中，我們選出了一個適合的編碼數量並且以赫夫曼演算法的方式來產生編碼，畫面間的像素能夠使用相對應的編碼應用合稱為兩階段驗證方式的字典編碼法以及字首最長匹配法的方式壓縮，接下來我們會在APBT中選出每組像素在字首最長匹配法中最佳的截斷度，我們會再將編碼使用首碼壓縮法的方式壓縮。藉由指定並且使用數量更多的編碼，相對於之前提出的相似演算法，可以達到平均約0.5%的縮率的改善，並且相較於使用最大的字典編碼，壓縮率的差距只0.96%而已。

We propose a lossless video frame compression algorithm employing a dictionary coding method, the Huffman coding method and three schemes to achieve high compression ratio. We observe the smaller the absolute value of the differentials between the current pixel and its neighbors the higher the probability is by analyzing the distribution of this differentials. According to this distribution, we compute the data reduction ratio (DRR) for cases using different numbers of code words and find the more code words used the higher the DRR which approached a plateau. Considering memory usage, we choose a suitable number of code words for Huffman encoding. We employ a two-staged classification (TC) scheme consisting of the dictionary coding method and a longest prefix match (LPM) method. The LPM method we choose for each pixel group a best truncation length (BTL) using an adaptive prefix bit truncation (APBT) scheme. We further compress the code words by a head code compression (HCC) scheme. Due to large numbers of code words used, we can achieve about 0.5% more bit rate reduction compared to previous proposed algorithm and only 0.96% bit rate reduction less than using the maximum dictionary size.

Abstract ............................................................................................................................. iii
Contents ............................................................................................................................. iv
List of Figures .................................................................................................................... iv
List of Tables ..................................................................................................................... vi
Chapter 1 Introduction ..................................................................................................... 1
Chapter 2 Previous Work ................................................................................................. 4
2.1 Block-Based Lossless Compression Algorithm ................................................... 4
2.2 Line-Based Lossless Compression Algorithm ..................................................... 5
2.3 Summary of Previous Work ................................................................................. 6
Chapter 3 Analysis of Differentials Between Neighboring Pixels ................................. 7
3.1 Fixed Location Neighbor ..................................................................................... 7
3.2 Median of a Group of Neighbors ....................................................................... 12
3.3 Summary of Differentials Between Neighboring Pixels ................................... 14
Chapter 4 Proposed Algorithm ....................................................................................... 16
4.1 Overview ............................................................................................................ 16
4.2 Reference Neighbor Selection ........................................................................... 18
4.3 Two-Stage Classification Scheme ..................................................................... 20
4.4 Adaptive Prefix Bit Truncation Scheme ............................................................ 23
4.5 Code Word Assignment ..................................................................................... 24
4.6 Head Code Compression .................................................................................... 27
4.7 An Illustrative Example ..................................................................................... 29
Chapter 5 Experimental Results ..................................................................................... 31
5.1 Environment ....................................................................................................... 31
5.2 Data Reduction Ratio Result .............................................................................. 33
Chapter 6 Conclusions and Future Work ..................................................................... 39
References ......................................................................................................................... 41
                                

[1] “Information Technology – Coding of Moving Pictures and Associated Audio for
Digital Storage Media at up to About 1.5Mbit/s, Part3: Audio (ISO/IEC
JTC1/SC29/WG11 MPEG, IS11172-3),” 1992.
[2] MPEG-2 Video Group, “Information Technology – Generic Coding of Moving
Pictures and Associated Audio: Part2 – Video (ISO/IEC 13818-2),” International
Standard, 1995.
[3] MPEG-4 Video Group, “Generic Coding of Audio – Visual Objects: Part 2 – Visual
(ISO/IEC JTC1/SC29/WG11 N1902, FDIS of ISO/ IEC 14496-2),” Nov. 1998.
[4] Advanced Video Coding for Generic Audio-Visual Services, ITU-T Rec. H.264 and
ISO/IEC 14496-10 (AVC), ITU-T and ISO/IEC JTC 1, May. 2003 (and subsequent
editions).
[5] K. McCann et al., “High Efficiency Video Coding (HEVC) Test Model 9 Encoder
Description”, in JCT-VC of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG11,
JVTVC-K1002, 11th Meeting: China, 2012.
[6] H. T. Yang, J. W. Chen, H. C. Kuo, and Y. L. Lin, “An Effective Dictionary-Based
Display Frame Compressor,” in Proc. IEEE/ACM/ IFIP 7th Workshop Embedded Syst.
Real-Time Multimedia, Grenoble, France, 2009, pp. 28-34.
[7] H. C. Kuo, J. W. Chen, and Y. L. Lin, “A High-Performance Low-Power H.264/AVC
Video Decoder Accelerator for Embedded Systems,” in Proc. IEEE/ACM/IFIP 7th
Workshop Embedded Syst. Real-Time Multimedia, Grenoble, France, 2009, pp. 1-8.
42
[8] Y. Lee, C. E. Rhee, and H. J. Lee, “A New Frame Recompression Algorithm
Integrated with H.264 Video Compression,” in Proc. IEEE Int. Symp. Circuit Syst.,
New Orleans, LA, 2007, pp. 1621-1624.
[9] W. Y. Chen, L. F. Ding, P. K. Tsung, and L. G. Chen, “Architecture Design of High
Performance Embedded Compression for High Definition Video Coding,” in Proc.
IEEE Int. Conf. Multimedia Expo., Hannover, Germany, 2008, pp. 825-828.
[10] Y. V. Ivanov and D. Moloney, “Reference Frame Compression Using
EmbeddedReconstruction Patterns for H.264/AVC Decoders,” in Proc. 3rd Int. Conf.
Digital Telecommun., Bucharest, Romania, 208, pp. 168-173.
[11] L. Song, D. Zhou, X. Jin, S. Goto, and P. Liu, “An Adaptive Bandwidth Reduction
Scheme for Video Coding,” in Proc. IEEE Int. Symp. Circuit Syst., Paris, France, 2010,
pp. 401-404.
[12] C. H. Son, J. W. Kim, S. G. Song, S. M. Park, and Y. M. Kim, “Low Complexity
Embedded Compression Algorithm for Reduction of Memory Size and Bandwidth
Requirements in the JPEG2000 Encoder,” IEEE Trans. Consum. Electron., vol. 56,
no. 4, pp. 2421-2429, Nov. 2010.
[13] A. D. Gupte, B. Amrutur, M. M. Mehendale, A. V. Ran, and M. Budagavi, “Memory
Bandwidth and Power Reduction Using Lossy Reference Frame Compression in
Video Encoding,” IEEE Trans. Circuit Syst. Video Technol., vol. 21, no. 2, pp.225-
230, Feb. 2011.
[14] T. Song and T. Shimamoto, “Reference Frame Data Compression Method for
H.264/AVC,” IEICE Electron. Exp., vol. 4, no. 3, pp. 121-126, Feb. 2007.
[15] S. H. Lee, M. K. Chung, S. M. Park and C. M. Kyung, “Lossless Frame Memory
Recompression for Video Codec Preserving Random Accessibility of Coding Unit,”
IEEE Trans. Consum. Electron., vol. 55, no. 4, pp. 2105-2113, Nov. 2009.
43
[16] X. Bao, D. Zhou, and S. Goto, “A Lossless Frame Recompression Scheme for
Reducing DRAM Power in Video Encoding,” in Proc. IEEE Int. Symp. Circuit Syst,
Paris, France, pp. 677-680, 2010.
[17] J. Kim and C. M. Kyung, “A Lossless Embedded Compression Using Significant Bit
Truncation for HD Video Coding,” IEEE Trans. Circuit Syst. Video Technol., vol. 20,
no. 7, pp.848-860, Jun.2010.
[18] H. C. Kuo, and Y. L. Lin, “A Hybrid Algorithm for Effective Lossless Compression
of Video Display Frames”, IEEE Trans. Multimedia Expo., vol. 14, no. 3, pp. 500-
509, June. 2012.
[19] K. V. Arya, and N. Tato, “A Lossless Compression Algorithm for Video Frames”,
International Conference on Industrial and Information Systems (ICIIS), Gwalior,
India, pp. 1-5, Dec. 2014.
[20] D.A. Huffman, “A Method for the Construction of Minimum-Redundancy Codes”,
Proceedings of the I.R.E, pp 1098-1102, Sep. 1952.
[21] JCT-VC, “Reference software of HEVC Test Model (HM-9.2)”, [Online]. Available:
https://hevc.hhi.fraunhofer.de/svn/svn_HEVC Software/tags/HM-9.2/
[22] SVT, “park_joy”, [Video podcast]. Retrieved from https://media.xiph.org/video/derf/
vqeg.its.bldrdoc.gov/HDTV/SVT_MultiFormat/SVT_MultiFormat_v10.pdf
[23] “dinner”, [Video podcast]. Retrieved from http://www.hdgreetings.com/other/ecardsvideo/
video-1080p.aspx
[24] Blender Foundation, “sintel_trailer”, [Video podcast]. Retrieved from http://www.
sintel.org
44
[25] NTIA/ITS, “Aspen”, [Video podcast]. Retrieved from ftp://vqeg.its.bldrdoc.gov
/HDTV/NTIA_source/
[26] NTIA/ITS, “SnowMnt”, [Video podcast]. Retrieved from ftp://vqeg.its.bldrdoc.gov
/HDTV/NTIA_source/
[27] NTIA/ITS, “WestWindEasy”, [Video podcast]. Retrieved from ftp://vqeg.its.
bldrdoc.gov/HDTV/NTIA_source/

全文公開日期本全文未授權公開 (校內網路)
全文公開日期本全文未授權公開 (校外網路)
全文公開日期本全文未授權公開 (國家圖書館：臺灣博碩士論文系統)

簡易檢索 / 詳目顯示

相關論文