MPEG-4 形狀編碼之快速演算法及架構設計

以作者查詢圖書館館藏

、以作者查詢臺灣博碩士

、以作者查詢全國書目

、勘誤回報

、線上人數：35

、訪客IP：3.145.166.7

姓名

陳嘉彬(Chia-Pin Chen) 查詢紙本館藏

畢業系所

電機工程學系

論文名稱

MPEG-4 形狀編碼之快速演算法及架構設計
(Fast Algorithm and Architecture Design for MPEG-4 Shape Coding)

相關論文

★ 即時的SIFT特徵點擷取之低記憶體硬體設計	★ 即時的人臉偵測與人臉辨識之門禁系統
★ 具即時自動跟隨功能之自走車	★ 應用於多導程心電訊號之無損壓縮演算法與實現
★ 離線自定義語音語者喚醒詞系統與嵌入式開發實現	★ 晶圓圖缺陷分類與嵌入式系統實現
★ 語音密集連接卷積網路應用於小尺寸關鍵詞偵測	★ G2LGAN: 對不平衡資料集進行資料擴增應用於晶圓圖缺陷分類
★ 補償無乘法數位濾波器有限精準度之演算法設計技巧	★ 可規劃式維特比解碼器之設計與實現
★ 以擴展基本角度CORDIC為基礎之低成本向量旋轉器矽智產設計	★ JPEG2000靜態影像編碼系統之分析與架構設計
★ 適用於通訊系統之低功率渦輪碼解碼器	★ 應用於多媒體通訊之平台式設計
★ 適用MPEG 編碼器之數位浮水印系統設計與實現	★ 適用於視訊錯誤隱藏之演算法開發及其資料重複使用考量

檔案

[Endnote RIS 格式]

[Bibtex 格式]

[相關文章]

[文章引用]

[完整記錄]

[館藏目錄]

[檢視]

[下載]

本電子論文使用權限為同意立即開放。
已達開放權限電子全文僅授權使用者為學術研究之目的，進行個人非營利性質之檢索、閱讀、列印。
請遵守中華民國著作權法之相關規定，切勿任意重製、散佈、改作、轉貼、播送，以免觸法。

摘要(中)

本論文提出了一個適用於MPEG-4形狀編碼的快速演算法及其架搆設計。根據二元連續串列的特性，本論文提出一個更為有效的搜尋區域，其搜尋方式符合直觀的搜尋想法。藉由此一快速演算法可大量減少搜尋點數，進而改善MPEG-4形狀編碼的整體運算時間。由模擬結果可得知，在相同的編碼品質下此快速演算法可減少95%以上的搜尋點數。此快速演算法在結合鑽石形的搜尋方法之後，更可減少99%以上的搜尋點數。在影像壓縮率方面，本論文提出一個新的誤差估計法，可得到與絕對誤差和(SAD)相似甚至更佳的壓縮率。我們將此一演算法實現於積體電路上，並完成一個適用於MPEG-4形狀編碼的硬體架構。此形狀編碼器可減少電路運算的時間。此晶片以台積電0.35um 1P4M製程設計，其晶片面積為3.3×3.3平方公釐。而當其操作在21.5MHz時便可完成CIF(352×288)影像格式之即時編碼。

摘要(英)

In this thesis, a fast algorithm and architecture design for MPEG-4 shape coding is proposed. Based on the properties of binary shape information, a boundary mask for efficient search positions can be generated. Therefore, a large number of search positions can be skipped. Simulation results show that the proposed algorithm combined with diamond shaped zones takes similar even less bits in the same quality but reduces the number of search positions marvelously in binary motion estimation to 0.8% compared with full search algorithm, which is described in MPEG-4 verification mode. Based on the new algorithm, an architecture design using proposed BME algorithm is developed, and it can reduce the memory access and processing cycles.
A prototyping chip is implemented to verify the proposed architecture in 3.3×3.3mm2 die area, and the clock frequency is 40MHz. For real-time applications, the proposed encoder can deal with CIF(352×288) sequence when operating at 21.5 MHz.

關鍵字(中)

★ 形狀編碼
★ 二元移動估計

關鍵字(英)

★ binary motion estimation
★ shape coding
★ MPEG-4

論文目次

1.1 MPEG-4 Overview 2
1.2 Motivation 3
1.3 Thesis Organization 5
Chapter 2 Overview of MPEG-4 Shape Coding 6
2.1 Background 6
2.2 BAB Coding Mode 8
2.3 Binary Motion Estimation (BME) 10
2.4 Size Conversion 12
2.5 Context Based Arithmetic Encoding (CAE) 14
Chapter 3 Speed Improved Method for MPEG-4 Shape Coding 16
3.1 Analysis of Binary Alpha Plane 16
3.2 Proposed Boundary Search Algorithm 18
3.2.1 Definition of Boundary Pixel 18
3.2.2 Boundary Search (BS) 19
3.3 Diamond Boundary Search (DBS) 22
3.4 Weighted SAD (WSAD) 24
3.5 Simulation Results 27
Chapter 4 Architecture Design for MPEG-4 Shape Coding 32
4.1 Binary Motion Estimator 33
4.1.1 Redundant Search Range Elimination 33
4.1.2 Architecture of Binary Motion Estimator 34
4.1.3 Boundary Pixel Detector 34
4.1.4 Architecture of PE Array and CAS 36
4.1.5 Performance Analysis 38
4.2 Size Conversion 40
4.3 Context Based Arithmetic Encoder 41
4.4 Implementation Results 42
Chapter 5 Conclusions 45
Reference 46

參考文獻

[1]ISO/IEC JTC1/SC29/WG11 N 3908, “MPEG-4 Video Verification Model version 18.0,” Jan. 2001.
[2]Noel Brady, “MPEG-4 standardized methods for the compression of arbitrarily shaped video objects,” IEEE Trans. Circuits Syst. Video Technol., vol. 9, pp. 1170-1189, Dec. 1999.
[3]Hao-Chieh Chang, Yung-Chi Chang, Yi-Chu Wang, Wei-Ming Chao, and Liang-Gee Chen, “VLSI architecture design for MPEG-4 shape coding,” IEEE Trans. Circuits Syst. Video Technol., vol. 12, pp. 741-751, Sept. 2002.
[4]ISO/IEC 13818-2, “Information technology-Generic coding of moving pictures and associated audio information-Video,” 1994.
[5]Recommendation H.263: Video coding for low bit-rate communication, ITU-T H.263, 1998.
[6]Krit Panusopone, and Xuemin Chen, “A fast motion estimation method for MPEG-4 arbitrarily shaped objects,” IEEE Int. Conf. Image Processing, vol. 3, pp. 624-627, 2000.
[7]Donghoon Yu, Sung Kyu Jang, and Jong Beom Ra, “A fast motion estimation algorithm for MPEG-4 shape coding,” IEEE Int. Conf. Image Processing, vol. 1, pp. 876-879, 2000.
[8]L.-K. Liu, and E. Feig, “A block-based gradient descent search algorithm for block motion estimation in video coding,” IEEE Trans. Circuits Syst. Video Technol., vol. 6, pp. 419-422, Aug. 1996.
[9]Alexis M. Tourapis, Oscar C. Au, and Ming L. Liou, “Highly efficient predictive zonal algorithms for fast block-matching motion estimation,” IEEE Trans. Circuits Syst. Video Technol., vol. 12, pp. 934-947, Oct. 2002.
[10]Ostermann J., “Coding of arbitrarily shaped objects with binary and greyscale alpha-maps: what can MPEG-4 do for you?” IEEE International Symposium on Circuits and Systems (ISCAS '98), Vol. 5, pp. 273 –276, Jun 1998.
[11]T. Chen, C. Swain, and B. Haskell, “Coding of sub-regions for content-based scalable video,” IEEE Trans. Circuits Syst. Video Technol., vol. 7, pp. 256-260, Feb. 1997.
[12]P. Gerken, “Object-based analysis-synthesis coding of image sequences at very low bit rates,” IEEE Trans. Circuits Syst. Video Technol., vol. 4, pp. 228-235, June. 1994.
[13]T. Kaneko, and M. Okudaira, “Encoding of arbitrary curves based on the chain code representation,” IEEE Trans. Commun., vol.33, July. 1985.
[14]Yin-Tsung Hwang, Yun-Chiang Wang, and Shi-Shen Wang “Novel algorithm and architecture designs for MPEG-4 shape coding” 2001.
[15]Noboru Yamaguchi, Takashi Ida, and Toshiaki Watanabe, “A binary shape coding method using modified MMR,” IEEE Int. Conf. Image Processing, vol. 1, pp. 504 -507, Oct. 1997.
[16]E. Shusterman, and M. Feder, “Image compression via improved quadtree decomposition algorithms,” IEEE Trans. Image Processing, vol. 3, pp. 207 -215, Mar. 1994.
[17]Mei-Juan Chen, Yuan-Pin Hsieh, and Yu-Pin Wang, “Multi-resolution shape coding algorithm for MPEG-4,” IEEE Transactions on Consumer Electronics, vol.46, pp. 505-513, Aug. 2000.
[18]N. Brady, F. Bossen, and N. Murphy, “Context-based arithmetic encoding of 2D shape sequences,” Special session on shape coding (ICIP '97), vol. 1, pp. 29-32, 1997.
[19]Jo Yew Tham, Surendra Ranganath, Maitreya Ranganath, and Ashraf Ali Kassim, “A novel unrestricted center-biased diamond search algorithm for block motion estimation,” IEEE Trans. Circuits Syst. Video Technol., vol. 8, pp. 169-177, Aug. 1998.
[20]Sun-Hyoung Han, Sung-Woo Kwon, Tae-Young Lee, and Moon-Key Lee, “Low power motion estimation algorithm based on temporal correlation and its architecture,” IEEE Internal Symposium on Signal Processing and its Applications (ISSPA), vol. 2, pp.647-650, Aug. 2001.
[21]Santanu Dutta and Wayne Wolf, “A flexible parallel architecture adapted to block-matching motion estimation algorithms,” IEEE Trans. Circuits Syst. Video Technol., vol. 6, no 1, pp. 74-86, Feb. 1996.
[22]T. Komarek and P. Pirsch, “Array architectures for block-matching algorithms,” IEEE Trans. Circuits Syst., vol. 36, pp.1301-1308, Oct. 1989.
[23]Tzu-Ming Liu, Bai-Jue Shieh and Chen-Yi Lee, “An efficient modeling codec architecture for binary shape coding,” IEEE International Symposium on Circuits and Systems (ISCAS2002), vol. 2, pp. 316 -319, 2002.

指導教授

蔡宗漢(Tsung-Han Tsai)

審核日期

2003-7-14

推文