## 摘要

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(n^{1+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(n^{2+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*n^{2+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*n^{3}) processors.

原文 | 英語 |
---|---|

頁（從 - 到） | 1-15 |

頁數 | 15 |

期刊 | Computing |

卷 | 52 |

發行號 | 1 |

DOIs | |

出版狀態 | 已發佈 - 1994 3月 |

對外發佈 | 是 |

## ASJC Scopus subject areas

- 軟體
- 理論電腦科學
- 數值分析
- 電腦科學應用
- 計算機理論與數學
- 計算數學