查詢結果分析
來源資料
頁籤選單縮合
題名 | 影像之邊緣偵測與漸進式傳輸--線性交錯式二元樹編碼法之應用=Edge Detection and Progressive Transmission Based on Linear Interpolation-Based Bintree |
---|---|
作者姓名(中文) | 侯永昌; 楊森雄; | 書刊名 | 電腦學刊 |
卷期 | 9:3 1997.09[民86.09] |
頁次 | 頁24-41 |
分類號 | 312.1 |
關鍵詞 | 線性交錯式二元樹; 邊緣偵測; 漸進式傳輸; Linear interpolation-based bintree; Edge detection; Progressive transmission; |
語文 | 中文(Chinese) |
中文摘要 | 線性交錯式二元樹編碼法(Linear Interpolation-Based Bintree, LIBB)是一套新的網格 式空間資料表示法,它結合了二元樹與交錯式編碼之特性。LIBB表示法已經被證明具有提 昇運算效率的潛能,即使與結構相類似之IBB表示法相比,LIBB表示法對空間之需求也較 小【侯永昌 民85a】。本研究以LIBB表示法為基礎開發了三個運算,即影像之邊綠偵測、 影像增強與漸進式傳輸。其中,邊綠偵測運算可在O(BlogB)時間內找出影像中所有的邊緣 (B代表影像串列之總節點數)。對於套色不均勻的影像,應用影像增強的運算,可以更容 易找出影像的邊緣,其時間複雜為Max{O(B),O(C)}(C表顏色總數)。而漸進式傳輸運算則 是利用LIBB編碼法之基本特性所開發出來的一個簡單應用,其時間複雜度為O(B)。由實 作結果可知,對比較單純影像而言,漸進式傳輸運算的確能有效減輕網路負荷,並加快影像 之辨識速度。 |
英文摘要 | Linear Interpolation-Based Bintree (LIBB) is a way to represent raster images. It combines the features of linear bintree and interpolation-based codes to save the storage requirement of raster images and to improve the performance of operations manipulating on them. In this research, we represent some fast algorithms for edge detection, image enhancement, and progressive transmission for gray-level images. The edge detection operation can be performed in O(BlogB) time, where B is the node number of the bincode; the image enhancement operation can be performed in Max(O(B), O(C)) time, where C is the gray-level of image; and the progressive transmission can be performed in O(B) time. The implementation of these methods are performed on some actual gray-level images and are shown to be very simple and efficient. |
本系統之摘要資訊系依該期刊論文摘要之資訊為主。