查詢結果分析
相關文獻
- 線性交錯式二元樹之快速編碼法
- 影像之邊緣偵測與漸進式傳輸--線性交錯式二元樹編碼法之應用
- 線性交錯式二元樹及其在地理資訊系統上之應用
- 摺疊式超立方體上完全二元樹嵌入的性質
- Image Representation Using Binary Space Partitioning (BSP) Trees
- 具金鑰交換的群體導向鑑別機制之遞迴式協定設計
- Reset Warrants: Design and Valuation
- 資料隱藏偽裝技術之研究
- 動態壓縮方法在國軍文書資料壓縮上之應用
- The Study of Embedding Complete d-ary Trees into Recursive Circulant
頁籤選單縮合
題 名 | 線性交錯式二元樹之快速編碼法=A Fast Coding Scheme of Linear Interpolation-Base Bintree |
---|---|
作 者 | 侯永昌; 陳永順; | 書刊名 | 技術學刊 |
卷 期 | 13:1 1998.03[民87.03] |
頁 次 | 頁157-166 |
分類號 | 312.9 |
關鍵詞 | 二元樹; 線性交錯式二元樹; 編碼法; Bintree; Linear interpolation-based bintree; Coding; |
語 文 | 中文(Chinese) |
中文摘要 | 隨著資訊科技快速發展,對於影響資料的運用需求愈來愈廣泛,但是影像資料無 論在儲存空間或處理時間上,往往無法達到令人滿意的要求,因此學術上發展出許多將影像 資料編碼壓縮後加以儲式處理的方式,以提高執行效率。本研究針對影像資料的編碼壓縮, 以線性交錯式二元樹編碼法為基礎,發展一套無失真(lossless)的編碼演算法,本編碼演 算法是以區塊分割的觀念,先假設區塊為同色像元所組成,因而可以形成為一個較大的區塊 ,當繼續讓取到像元產3色不同時,才對區塊做分割。以這種區塊分割的觀念,改善了傳統 上利用像元合併的作法,使得編碼演算法可以達到與像元總數成正比的執行時間複雜度,在 效率上有大幅度的改進。 |
英文摘要 | With the rapid advancement in the development of information technology, the usage of image data has increased dramatically. However, the requirements of storage space and processing time for an image are usually enormous. Hence, finding an efficient encoding for images has been a very important research issue due to the high demand in the fields of computer vision. Pattern recognition, geographical information systems and computer graphics. Quadtree and bintree are two of the widely used hierarch cal data structures to present raster images. The traditional algorithm inserts each pixel separately and then checks for a possible merge with the processed nodes to form a larger node. Once a merge occurs, it has to check if another merge is possible. The process is time consuming. In this research, we present an algorithm that uses the concept of block decomposition, thus avoiding the necessity of merging. For each pixel in the image, if the pixel is the same color as the appropriate active node, this pixel has already been incorporated into some larger active node. Hence, nothing will be performed. Otherwise, the appropriate active node is split and the largest possible bincode that takes this pixel as its base (i.e., lower leftmost ) pixel is then inserted into the set of active nodes. Because we avoid the recursive merging and backtracking, our algorithm can construct a linear bintree from a raster image stored on disk in time proportional to the number of pixels in the image. |
本系統中英文摘要資訊取自各篇刊載內容。