Constant-time hough transform on the processor arrays with reconfigurable bus systems

研究成果: 雜誌貢獻文章

6 引文 斯高帕斯(Scopus)

摘要

We develop constant-time algorithms to compute the Hough transform on a processor array with a reconfigurable bus system (abbreviated to PARBS). The PARBS is a comptuation model which consists of a processor array and a reconfigurable bus system. It is a very powerful computation model in that many problems can be solved efficiently. In this paper, we introduce the concept of iterative-PARBS which is similar to the FOR-loop construct in sequential programming languages. The iterative-PARBS is a building block in which the processing data can be routed through it several times. We can think it as a "hardware subroutine". Based on this scheme, we are able to explore constant-time Hough transform algorithms on PARBS. The following new results are derived in this study: 1) The sum of n bits can be computed in O(1) times on a PARBS with O(n1+e{open}) processors for any fixed e{open}>0. 2) The weights of each simple path of an n*n image can be computed in O(1) time on a 3-D PARBS with O(n2+e{open}) processors for any fixed e{open}>0. 3) The p angle Hough transform of an n*n image can be computed in O(1) time on a PARBS with O(p*n2+e{open}) processors for any fixed e{open}>0 with p copies of the image pretiled. 4) The p angle Hough transform of an n*n image can be computed in O(1) time on a PARBS with O(p*n3) processors.

原文英語
頁(從 - 到)1-15
頁數15
期刊Computing
52
發行號1
DOIs
出版狀態已發佈 - 1994 三月 1

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Numerical Analysis
  • Computer Science Applications
  • Computational Theory and Mathematics
  • Computational Mathematics

指紋 深入研究「Constant-time hough transform on the processor arrays with reconfigurable bus systems」主題。共同形成了獨特的指紋。

引用此