跳到主要內容

臺灣博碩士論文加值系統

(3.235.120.150) 您好!臺灣時間:2021/08/03 06:35
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

我願授權國圖
: 
twitterline
研究生:徐浩航
研究生(外文):Hao-Hang Hsu
論文名稱:新的巢狀搜尋演算法用於區塊移動預估
論文名稱(外文):A New Cellular Search Algorithm for Block-Matching Estimation
指導教授:李建德李建德引用關係
指導教授(外文):Jinna-De Lee
學位類別:碩士
校院名稱:長庚大學
系所名稱:電機工程研究所
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2005
畢業學年度:93
語文別:中文
論文頁數:53
中文關鍵詞:區塊移動預估
外文關鍵詞:block-matcing estimation
相關次數:
  • 被引用被引用:0
  • 點閱點閱:162
  • 評分評分:
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
移動預估(Motion Estimation)是一種在視訊影像編碼上降低鄰近畫面間累贅(inter-frame redundancy)的有效方法。一般而言,移動預估技術均是利用與先前的影像比對尋求一適當的替代影像資訊,是一個不斷重複且大量的區塊比對運算過程。區塊匹配的移動預估法是簡單且有效率的方法,為了想要獲得好的影像品質及減少搜尋量的前提下,有許多的演算法被提出來用以減少移動估測的高計算複雜度。
在本論文中,我們提出一種區塊匹配演算法,稱之為新的巢狀搜尋演算法。此演算法利用特定的搜尋圖示HCSP和VCSP來搜尋需要比較的點與欲處理的區塊做匹配。此外,我們依據峰值訊號雜訊比(peak signal to noise ratio ; PSNR) 、平均搜尋點數(Average Points)及MSE(Mean Square Error)三種客觀的效能和效率量測法,將我們所提出的影像移動預估法與全區域搜尋演算法(FS)、三步搜尋演算法(TSS)、巢狀搜尋演算法(CS)、快速巢狀搜尋演算法(FCS)等演算法做一些效能的比較。經由實驗結果得知,我們所提出的方法在搜尋點數方面都比其他的演算法好,在PSNR方面,跟TSS的差距不大。應屬在可以接受的範圍內。
Motion estimation is an efficient method to reduce redundant information among successive frames in video compression applications. Generally speaking, the blocks in the current frame can be replaced with the neighboring blocks in the spatial directions in the previous frame with small errors. Many types of motion estimation methods such as Block matching algorithm are widely used to take a balance between a good image quality and the computation complexity.
In this thesis, a block matching algorithm which is named as New Cellular Search Algorithm is proposed. This algorithm utilizes two particular search patterns: HCSP and VCSP, in the horizontal and vertical directions to search the best motion vector. In the experiments, three performance measurements including peak signal to noise ratio, average points and mean square error are used to compare this new search algorithm with some major motion estimations like Full Search algorithm, Three-step Search algorithm, Cellular Search algorithm and Fast Cellular Search algorithm. In simulation study, this new algorithm has the comparable PSNR with fewer search points in the small search range case, i.e. it reduces the computation time and maintains the image quality within an acceptable range.
第一章 緒論…………………………………………………………………1
1.1 前言…………………………………………………………………1
1.2 動作補償之預測編碼…………………………………………………3
1.2.1 移動估測……………………………………………………………4
1.2.2 移動補償……………………………………………………………6
1.3研究動機與目的……………………………………………………...6
1.4論文架構……………………………………………………………......7
第二章 移動預估演算法………………………………………………….....8
2.1 區塊匹配演算法………………………………………………………8
2.2 區塊匹配的測量標準………………………………………………..11
2.3 各種移動預估演算法介紹…………………………………………..13
2.3.1 全區域搜尋演算法………………………………………………...13
2.3.2 三步搜尋演算法…………………………………………………...15
2.3.3 鑽石型搜尋演算法………………………………………………...17
2.3.4 巢狀型搜尋演算法………………………………………………...20
2.3.5 快速巢狀搜尋演算法……………………………………………...23
第三章 新的巢狀搜尋演算法……………………………………………...26
第四章 實驗結果…………………………………………………………...33
第五章 結論………………………………………………………………...50
參考文獻……………………………………………………………………...51
[1]ISO/IEC JTC1/SC29/WG11, “ISO/IEC CD 11172:information technology,” MPEG-1 Committee Draft, Dec. 1991.
[2]ISO/IEC JTC1/SC29/WG11, “ISO/IEC CD 13818:information technology,” MPEG-2 Committee Draft, Dec. 1993.
[3]International Telecommunication Union, “Video coding for audiovisual services at px64kbits,” ITU-T Recommendation H.261, Mar. 1993.
[4]International Telecommunication Union. “Video coding for low bitrate communication,” ITU-T Recommendation H.263, July 1995.
[5]ISO/IEC Committee Draft 14496, International Organisation for Standardisation Organisation International de Normalisation ISOO/IEC JTC1/SC29/WG11 Coding of Moving Pictures and Audio.
[6] K. R. Rao and J. J. Hwang, Techniques and standards for image, video and audio coding, Prentice Hall, 1996.
[7] H. M. Jong, L. G. Chen, and T. D. Chiueh, “Parallel architecture for 3-step hierarchical search block-matching algorithm,” IEEE Transactions on Circuits and System, for Video Technology, vol. 4, no. 4, pp. 407-416, 1994.
[8] Shan Zhu and K. –K. Ma, “A new diamond search algorithm for fast block-matching motion estimation,” IEEE Trans. Image Processing, vol. 9, no. 2, pp. 287-290, 2000.
[9] J. Hung, H. S. Wong, and J. H. Wang, “A novel cellular search algorithm for block-matching estimation,” Proceedings of International Conf. on Information Technology: Coding and Computing, pp. 629-633, Apr. 2001.

[10] Su-Yen Wang,Fast cellular search algorithm for motion estimation, Master Thesis, Chang Gung University, 2003.
[11] B. Furht, J. Greenberg, and R. Westwater,Motion estimation algorithm for video compression Kluwer Academic Publishers, 1999.
[12] L. M. L. Teixeira, and A. P. Alves, “Block matching algorithms in MPEG video coding,” IEEE Proceedings of ICPR, pp. 934-938, 1996.
[13] J. Lu and M. Liou, “A simple and efficient search algorithm for block –matching motion estimation,” IEEE Trans. On Circuits and Systems for Video Technology, vol. 7, no. 2, pp. 429-433, Apr. 1997.
[14] J.-N. Kim and T.-S. Choi,“A fast three-step search algorithm with minimum checking points using unimodal error surface assumption,”IEEE Trans. on Consumer Electronics, vol. 44, no. 3, pp. 638-648, Aug. 1998.
[15] L.k. Liu and E. Feig, “A block-based gradient descent search algorithm for block motion estimation in video coding,” IEEE Trans. on Circuits and Systems for Video Technology, vol. 6, no. 4, pp. 419-423, Aug. 1996.
[16] J. Y. Tham, S. Ranganath, M. Ranganath, and A.A.Kassim, “A novel unrestricted center-biased diamond search algorithm for block motion estimation,” IEEE Transactions on Circuits and Systems for Video Technology , vol. 84 , pp. 369 –377, Aug. 1998.
[17] C. Zhu, X. Lin, and L-P Chau,“Hexagon based search pattern for fast block motion estimation,”IEEE Trans. on Circuits and System for Video Technology, vol. 12, pp. 349-355, May. 2002.
[18] C. H. Cheung and L. M. Po,“A novel small-cross-diamond search algorithm for fast video coding and videoconferencing applications,” Proceddings of International Conf. on Image Processing, vol. 1, pp. 681-684, Sept. 2002.
[19] Y. C. Lim, K.Y. Min, and J.W. Chong,“A pentagonal fast block matching algorithm for motion estimation using adaptive search range,”IEEE International Conf. on Acoustics, Speech, and Signal Processing, vol. 3, pp. 669-672, April. 2003.
[20] C. Zhu, X. Lin, L. P. Chau, and H. A. Ang,“Efficient inner search for faster diamond search,” Signal Processing, vol. 84, pp. 527-533, March. 2004.
[21] L. P. Chau, and C. Zhu,“A fast octagon-based search algorithm for motion estimation,”Singal Processing, vol. 83, pp. 671-675, March. 2003.
[22] C. Zhu, X. Lin, and L.M. Po,“Enhanced hexagonal search for fast block motion estimation,”IEEE Trans. on Circuits and System for Video Technology, vol. 14, pp. 1210-1214, Oct. 2004.
[23] H. So, J. Kim, W.-K. Cho, and Y.-S. Kim,“Fast motion estimation using modified diamond search patterns,”Electronics Letters. vol. 41, pp. 62-63, Jan. 2005.
[24] X. Jing and L.P. Chau, “An efficient three-step search algorithm for block motion estimation,” IEEE Trans. on Multimedia, vol. 6, no. 3, pp. 435-438, June. 2004.
[25] H. Jia and L. Zhang,“A new cross diamond search algorithm for block motion estimation,”Proceedings of IEEE International Conf. on Acoustics, Speech, and Signal Processing, vol. 3, pp. 17-21, May. 2004.
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top
無相關論文