A Fast and Efficient Architecture for Circular Hough Transform on FPGAs
碩士 === 國立臺灣科技大學 === 電子工程系 === 93 === The Hough Transform (Hough, 1962) has been used to characterize analytic features. It was first applied to the recognition of straight lines, and later extended to circles, ellipses and arbitrary shaped objects. Its main disadvantage is the computational and stor...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2005
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/46409814088495122443 |
| Summary: | 碩士 === 國立臺灣科技大學 === 電子工程系 === 93 === The Hough Transform (Hough, 1962) has been used to characterize analytic features. It was first applied to the recognition of straight lines, and later extended to circles, ellipses and arbitrary shaped objects. Its main disadvantage is the computational and storage requirements increase as a power of the dimensionality of the curve. Many researchers have devoted themselves to the modifications of HT to detect circles and ellipses more efficiently, therefore.
It is not difficult to implement Circular Hough Transform (CHT) algorithm on modern personal computer. However, we intend to use FPGA or ASIC to perform CHT in this article. Modern FPGAs are capable of performing high speed operation and have large amount of embedded memory. The whole CHT circuitry with accumulator array excluded can be fitted into Altera® Stratix® 1S25 chip which has more than 1Mb RAM embedded
|
|---|