查詢結果分析
來源資料
相關文獻
- Constant-Time Algorithms for the Area and Perimeter of Image Components on Processor Arrays with Reconfigurable Bus Systems
- 個人電腦影像處理技術應用於即時車輛面式偵測
- Constant-Time Algorithms for the Minimum Circle-Cover Problem on Circular-Arc Graphs
- 彩色切片影像之自動影像分析系統:鴨肝切片
- 類神經網路(Neural Networks)的種類及其在影像處理上的應用
- 影像處理技術應用於造艦工程之探討
- 建物遮蔽區域影像摘取作業模式之研究
- 影像處理應用於二維流體化床氣泡行為之研究
- 新的路口車輛偵測演算法之研究--以光流理論為基礎
- 中醫望診系統(2):舌診影像系統在上消化道病症之研究
頁籤選單縮合
題 名 | Constant-Time Algorithms for the Area and Perimeter of Image Components on Processor Arrays with Reconfigurable Bus Systems=可重組態匯流排系統之處理器陣列上求影像元件面積及周長的常數時間演算法 |
---|---|
作 者 | 林順喜; | 書刊名 | 師大學報 |
卷 期 | 40 1995.06[民84.06] |
頁 次 | 頁135-155 |
分類號 | 312.1 |
關鍵詞 | 影像元件面積及周長; 計算模型; 影像處理; 平行處理; 可重組態匯流排系統; Area and perimeter of image components; Computation model; Image processing; Parallel processing; Reconfigurable bus system; |
語 文 | 英文(English) |
中文摘要 | 在本論文中,我們提出0(1時間的演算法,以求出一n*n影像每一個元 件的面積及周長。此問題以前從沒有在0(1)時間內被解決過,即使是在極理想的 CRCWPRAM計算模型上。就大型的問題而言,我們需要快速的硬體方案。我們 的演算法乃使用可重組態匯流排系統之處理器陣列(簡稱PARES),它含有一處理 器陣列以及一可重組態匯流排系統。為了能以常數時間之複雜度解決此問題,我 們先利用Iterative-PARES的設計觀念[13),類似循序程式語言中的FOR迴圈,使 處理中的資料能夠迴繞數次(固定次數),我們可將之視為一種硬體的副程式。根 據這種特別的架構,我們得以在PARES上發展出常數時間的平行演算法。 |
英文摘要 | In this paper, we present 0(1) time algorithms to determine the area and theperimeter of each component of an n*n image. This problem has not been solved inO(1) time before, even in the idealistic CRCW PRAM model. For large-sized problems,it is desirable to have fast hardware solutions. Our algorithms are based on the processor arrays with a reconfigurable bus system (abbreviated as PARES) that consists of aprocessor array and a reconfigurable bus system. In order to solve this problem withconstant time complexity, we first propose the concept of iterative- PARBS [13], which issimilar to the FOR-loop construct in sequential programming languages. The iterativePARBS is a building block in which the processing data can be routed through itselfseveral times. We can think of it as a "hardware subroutine". Based on this novelscheme, we are able to explore constant-time parallel algorithms on PARBS. The following new results are derived in this study:(1) The area of each component of an n*n image with p components can be computed in O(1) time on a PARBS with 0(p*n2+ε ) processors for any fixed ε >0.(3) The perimeter of each component of an n*n image with p components can be computed in 0(1) time on a PARBS with0( maxn,p*n2+ε ) processors for any fixedε >0. |
本系統中英文摘要資訊取自各篇刊載內容。