請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/48236
完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.advisor | 顧孟愷 | |
dc.contributor.author | Wei-Chung Chang | en |
dc.contributor.author | 張維中 | zh_TW |
dc.date.accessioned | 2021-06-15T06:49:46Z | - |
dc.date.available | 2012-03-12 | |
dc.date.copyright | 2011-03-12 | |
dc.date.issued | 2011 | |
dc.date.submitted | 2011-02-21 | |
dc.identifier.citation | Reference
[1] D.A. Huffman, 'A Method for the Construction of Minimum-Redundancy Codes', Proceedings of the I.R.E., September 1952, pp 1098–1102. [2] K.L Chung, ”Efficient Huffman decoding,” Information Processing Letters 61, pp 97-99, 1997. [3] H.C. Chen, Y.L. Wang and Y.F. Lan, ”A memory-efficient and fast Huffman decoding algorithm,” Information Processing Letters, vol. 69, no. 3, pp. 119-122, 1999. [4] R. Hashemian, “Memory efficient and high-speed search Huffman coding,” IEEE Trans. Commun., vol. 43, no. 10, pp. 2576–2581, Oct, 1995. [5] H.C. Chen, Y.L. Wang and Y.F. Lan, ”A memory-efficient and fast Huffman decoding algorithm,” Information Processing Letters, vol. 69, no. 3, pp. 119-122, 1999. [6] S. B. Choi and M. H. Lee, “High speed pattern matching for a fast Huffman decoder,” IEEE Trans. Consumer Electron., vol. 41, no. 1, pp. 97–103, Feb. 1995. [7] Han-Chang Ho,Sheau-Fang Lei.” Fast Huffman decoding algorithm by multiple-bit length search scheme for MPEG-2/4 AAC”, IEEE Proceedings of 2010 IEEE International Symposium on Circuits and Systems, 2010, pp. 2844 – 2847. [8] Nikar J, Vassiliadis S, Takala J, et al. ”Multiple-Symbol Parallel Decoding for Variable Length Codes,” IEEE Trans. VLSI Systems, 2004, 12(7), pp. 676-685. [9] B.-J. Shieh, Y.-S. Lee, and C.-Y. Lee. “A new approach of group-based VLC codec system with full table programmability”. IEEE Trans. Circuits Syst. Video Technol., 11(2):210–221, Feb. 2001. [10] J. Nikara, S. Vassiliadis, J. Takala, M. Sima, and P. Liuha, “Parallel multiple-symbol variable-length decoding,” in Proc. IEEE Int. Conf.Comput. Design, Freiburg, Germany, Sept. 16–18, 2002, pp. 126–131. [11] KTA Reference Software, http://iphome.hhi.de/suehring/tml/kta/. [12] Y. Ye and M. Karczewicz, “Improved Intra Coding”, ITU-T Q.6/SG16 VCEG, VCEG-AG11, Shenzhen, China, October 2007. [13] TK Tan, G. Sullivan, and T. Wedi, “Recommended Simulation Common Conditions for Coding Efficiency Experiments Revision 1,” ITU-T Q.6/SG16 VCEG, VCEG-AE10r1, Marrakech, Morocco, January 2007. [14] S. Srinivasan, C. Tu, S.L. Regunathan, and G.J. Sullivan, “HD Photo: a new image coding technology for digital photography,” Proc. SPIE, vol. 6696, 2007. [15] B. Zeng and J. J. Fu, “Directional discrete cosine transforms- a new framework for image coding”, IEEE Trans. CSVT, vol. 18, pp. 305-313, March 2008. [16] C. L. Chang and B. Girod, “Direction-adaptive partitioned block transform for image coding”, IEEE International Conference on Image Processing (ICIP08), pp.145-148, Oct. 2008. [17] Chuo-Ling Chang; Makar, M.; Tsai, S.S.; Girod, B.; ”Direction-Adaptive Partitioned Block Transform for Color Image Coding” IEEE Transactions onImage Processing, page(s): 1740-1755, July 2010. [18] Parfieniuk, M. “A directional extension of the JPEG image codec” Proceedings of 2010 IEEE International Symposium on Circuits and Systems (ISCAS), page 2872-2875, May 30 2010-June 2 2010. [19] Testoni, V.; Costa, M.H.M.; Kirovski, D.; Malvar, H.S.; “On The Adaptive Coefficient Scanning of JPEG XR / HD Photo”, Data Compression Conference (DCC) 2010, 24-26 March 2010, pp. 69 – 78. [20] Yang Tao; Yuxing Peng; Zhiming Liu; “More scanning patterns for entropy coding for H.264”, International Symposium on Intelligent Signal Processing and Communication Systems 2007, pp490-493. [21] Li Zhang, Wen Gao, Qiang Wang, Debin Zhao; “Macroblock-Level Adaptive Scan Scheme for Discrete Cosine Transform Coefficient”, IEEE International Symposium on In Circuits and Systems, 2007; pp. 537-540. [22] R.Reininger and J.Gibson: “Distributions of the Two Dimensional DCT Coefficients for Images”, IEEE Trans. Commun., Vol. COM-31, pp. 835–839, 1983. [23] E. Y. Lam and J. W. Goodman: “A Mathematical Analysis of the DCT Coefficient Distributions for Images”, IEEE Trans. Image Processing, Vol. 9, No. 10, pp. 1661-1666, 2000. [24] Xiang Li, Lingzhi Liu, Nam Ling, Jianhua Zheng, Philipp Zhang. “Predictive Adaptive Transform Coefficients Scan Ordering for Inter-Frame Coding”, Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG11. | |
dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/48236 | - |
dc.description.abstract | 隨著網路世界的蓬勃發展,人們擷取資訊的方式已經從傳統的報章雜誌以及書籍轉變為利用多媒體以影像、視訊或者聲音方式進行。但是多媒體訊息的資料量往往遠大於傳統的文字。為了增加傳輸多媒體訊息的能力,對其進行壓縮乃是必要之途徑。
“壓縮”是指一個有效降低檔案大小的方法。被壓縮檔案的來源可以是各式各樣的形式,如文字、聲音、影像等等。在現今生活中,能給予人們最大感官刺激與效果最佳的傳輸媒介莫過於影像。所以在過去數十年中,各種研究不斷致力於改善並找出最佳的影像壓縮演算法,讓我們可以在有限的頻寬下傳遞更多的訊息。 變長碼是各種壓縮技巧中很重要的一環。與固定長度的編碼方式相比較(如ASCII code),變長碼可以用更少的位元數來表示一段訊息。 在這篇論文中,我們研究變長碼在現今壓縮標準中扮演的角色。然後在第一個部分,我們提出一個對於霍夫曼碼可以在一個回合中解碼多個符號的資料結構。實驗的結果顯示提出的方法可以有效提昇解碼的速度。 在這篇論文的第二部分,我們研究zigzag scan對於變長碼效能之影響。在影像壓縮標準中,我們先對離散餘弦變換後的係數做zigzag scan,所得的結果再經過量化(quantization)與run-length coding後最終被編成變長碼的形式。Zigzag scan的方式決定了run-length pair的entropy bound,然後決定了變長碼所能得到的最佳效能。因此,我們研究並提出數個改善zigzag 模式的方式。將這些演算法與模式應用在影像上可以進一步改良壓縮的效果。實驗顯示最多可以有1%在壓縮率上之提升。 | zh_TW |
dc.description.abstract | Multimedia is the computer information that combines several communication media such as audio, video, text, etc. With the growing up of Internet, people are used to acquire information in electronic formats instead of traditional forms. To increase the capacity for current communication channel, data compression is a necessary tool.
Compression is a method to reduce the file size of source data. The source data could be in various kinds of formats. Since we are living in a world full of multimedia information now, the most popular forms of multimedia message are images or videos. In the past few years, many image (video) compression standards had been developed to reduce the size of source data. Hence we could carry more information on a transmission channel with fixed bandwidth. One of the most important techniques in image (video) compression is variable length coding. Compared with fix length code, the variable length coding scheme requires smaller number of bits to represent a given message. In this thesis, we survey the role of variable length code in modern codec. Then in the first part, we propose a new data structure which facilitates to decode multiple symbols in a lookup step. The experimental result shows it could speed up the decoding process efficiently. In the second part, we study the relationship between zigzag scan and variable length coding. Since the result of zigzag scan decides the lowest entropy of the run-length pairs so as to the efficiency of the variable length coding hereafter, we could further improve the compression ratio by choosing customized zigzag patterns for specific images (videos). As the result, we develop a new zigzag scanning scheme for this purpose. Experimental results show we could reduce at most 1% with only little computational cost. | en |
dc.description.provenance | Made available in DSpace on 2021-06-15T06:49:46Z (GMT). No. of bitstreams: 1 ntu-100-R97922153-1.pdf: 4851056 bytes, checksum: 6ac2dfa18a80f5d9a2dbccceccab8f3e (MD5) Previous issue date: 2011 | en |
dc.description.tableofcontents | TABLLE OF CONTENTS
Abstract…………Xiii 1、1Introduction……………………………………………………………………1 1.1 Video coding concept ………………………………………………2 2、A multiple symbol decodable algorithm for Huffman code........................4 2.1 Introduction ………………………………………………………5 2.2 Data structure of SGH tree…………………………………………8 2.3 Encode multiple code-words at first level…………………………11 2.4 A hybrid strategy for Huffman code………………………………37 2.5 Conclusion…………………………………………………………38 3、New zigzag scheme for variable length coding ............................................41 3.1 Introduction…………………………………………………………42 3.2 Review to the role of zigzag scan scheme…………………………43 3.3 A Viterbi-like algorithm for finding optimal scanning pattern …...45 3.4 Multiple scanning patterns to improve the compression ratio …....55 3.5 The criterion to choose multiple scanning patterns …………….....82 3.6 Conclusion ………………………………………………………....85 4、Conclusion and future works………………………………………………....91 4.1 Conclusion ………………………………………………………….92 4.2 Future works …………………………………………………………92 Appendix A…………………………………………………………………………94 Appendix B…………………………………………………………………………102 Reference……………………………………………………………………………105 | |
dc.language.iso | en | |
dc.title | 編碼技巧於變長碼之應用與改進 | zh_TW |
dc.title | Application and improvement of coding techniques for variable length code | en |
dc.type | Thesis | |
dc.date.schoolyear | 99-1 | |
dc.description.degree | 碩士 | |
dc.contributor.oralexamcommittee | 廖俊睿,楊佳玲,洪士灝 | |
dc.subject.keyword | Huffman code,Video compression,zigzag scanning,variable length code, | zh_TW |
dc.subject.keyword | 霍夫曼碼,影像壓縮,鋸齒狀掃描法,變長碼, | en |
dc.relation.page | 108 | |
dc.rights.note | 有償授權 | |
dc.date.accepted | 2011-02-21 | |
dc.contributor.author-college | 電機資訊學院 | zh_TW |
dc.contributor.author-dept | 資訊工程學研究所 | zh_TW |
顯示於系所單位: | 資訊工程學系 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-100-1.pdf 目前未授權公開取用 | 4.74 MB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。