DC 欄位 |
值 |
語言 |
DC.contributor | 電機工程學系 | zh_TW |
DC.creator | 林學良 | zh_TW |
DC.creator | Hsueh-Liang Lin | en_US |
dc.date.accessioned | 2006-10-30T07:39:07Z | |
dc.date.available | 2006-10-30T07:39:07Z | |
dc.date.issued | 2006 | |
dc.identifier.uri | http://ir.lib.ncu.edu.tw:444/thesis/view_etd.asp?URN=93521033 | |
dc.contributor.department | 電機工程學系 | zh_TW |
DC.description | 國立中央大學 | zh_TW |
DC.description | National Central University | en_US |
dc.description.abstract | 解交錯的技術是將交錯的影像轉換成循序掃描的方式,這技術被使用於液晶電視,循序掃描類比電視,和背投影電視等。在過去的幾年,在這領域有很多研究文獻被提出。其中最熱門的方法是動像調適性解交錯法。這個方法的優點在於它的運算量不大,而且容易硬體實現,並被現今多數產品所採用。假設你想提升這個方法所得到的影像品質,有不少的研究提出利用動態補償的方法去取代動像調適性解交錯法中的圖場間內插法。雖然動態補償法可以得到更好的影像品質,但是它所需要的運算量,還有硬體的花費都是你所在意的。為了去降低動態補償法所帶來的高複雜度的運算量,我們提出了區塊模式決定的機制去區分這個區域的點是屬於動態的點,邊緣的點或是動態補償的點。由於我們使用區塊模式決定這機制,我們可以避免在一些不適用動態補償法的區域去使用它。而且經由區塊模式決定機制的選擇,我們可以在最適合的點用最適合的內插法去做插入的動作.不像動像調適性解交錯法,當影像輸入時,對於每個輸入點都同時去做了圖場內內插法和圖場間內插法的動作,在影像輸出前才去決定用那一種內插法。跟先前所提出的演算法相比,我們的演算法不但可以降低運算的複雜度,更可以對影像品質有所提升。我們更使用ATEME公司所推出的IEKC64x的模擬平台去做演算法的模擬。藉此,我們可以證明我們演算法是低運算量的。在實驗的結果上,我們可以發現我們的演算法大概可以節省接近80%的運算量又可以得到更好的影像品質。 | zh_TW |
dc.description.abstract | De-interlacing converts interlaced video sequences into progressive ones for displaying on progressive devices such as LCD, Progressive CRT, and Projection TV. In previous years, many de-interlacing algorithms are published. The most popular de-interlacing algorithm of them is motion adaptive (MA) method. The advantage of this method is low computational complexity and easy to implement in many products. If you want to get better video quality by using MA method, many searches find: using motion compensation (MC) method to replace the inter-field method of MA method is a good solution. Although MC method can get better video quality, the main concerns of MC method are computational complexity and hardware cost. In order to reduce the computational complexity of MC method, we attempt to use block type decision to distinguish the pixel into stationary, texture, and MC pixel which can help us to avoid us MC method for non-adaptive area. Base on the type of the pixel, we can use the most adaptive interpolation method for every pixel. Not as MA method, when video sequence inputs, every pixel is interpolated by intra-field and inter-field method. Compare to other de-interlacing algorithms, our proposed algorithm not only has low computational complexity but also gets better video quality. We use IEKC64x platform for real time simulation to proof our proposed algorithm is low complexity. Experimental result shows that the proposed algorithm can save nearly 80% computational power and get better video quality. | en_US |
DC.subject | 解交錯 | zh_TW |
DC.subject | deinterlace | en_US |
DC.subject | deinterlaing | en_US |
DC.title | 基於低複雜度和高效能考量之內容調適性解交錯設計 | zh_TW |
dc.language.iso | zh-TW | zh-TW |
DC.title | A Content Adaptive De-interlacing Design with Low Complexity and High Performance Considerations | en_US |
DC.type | 博碩士論文 | zh_TW |
DC.type | thesis | en_US |
DC.publisher | National Central University | en_US |