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 |
id |
ndltd-TW-094NTUST428126 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-094NTUST4281262015-10-13T11:39:45Z http://ndltd.ncl.edu.tw/handle/46409814088495122443 A Fast and Efficient Architecture for Circular Hough Transform on FPGAs 快速圓形霍氏轉換FPGA架構 Chu-Huai Chan 詹祖懷 碩士 國立臺灣科技大學 電子工程系 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 Mon-Chau Shie 許孟超 2005 學位論文 ; thesis 54 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立臺灣科技大學 === 電子工程系 === 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
|
author2 |
Mon-Chau Shie |
author_facet |
Mon-Chau Shie Chu-Huai Chan 詹祖懷 |
author |
Chu-Huai Chan 詹祖懷 |
spellingShingle |
Chu-Huai Chan 詹祖懷 A Fast and Efficient Architecture for Circular Hough Transform on FPGAs |
author_sort |
Chu-Huai Chan |
title |
A Fast and Efficient Architecture for Circular Hough Transform on FPGAs |
title_short |
A Fast and Efficient Architecture for Circular Hough Transform on FPGAs |
title_full |
A Fast and Efficient Architecture for Circular Hough Transform on FPGAs |
title_fullStr |
A Fast and Efficient Architecture for Circular Hough Transform on FPGAs |
title_full_unstemmed |
A Fast and Efficient Architecture for Circular Hough Transform on FPGAs |
title_sort |
fast and efficient architecture for circular hough transform on fpgas |
publishDate |
2005 |
url |
http://ndltd.ncl.edu.tw/handle/46409814088495122443 |
work_keys_str_mv |
AT chuhuaichan afastandefficientarchitectureforcircularhoughtransformonfpgas AT zhānzǔhuái afastandefficientarchitectureforcircularhoughtransformonfpgas AT chuhuaichan kuàisùyuánxínghuòshìzhuǎnhuànfpgajiàgòu AT zhānzǔhuái kuàisùyuánxínghuòshìzhuǎnhuànfpgajiàgòu AT chuhuaichan fastandefficientarchitectureforcircularhoughtransformonfpgas AT zhānzǔhuái fastandefficientarchitectureforcircularhoughtransformonfpgas |
_version_ |
1716847592987426816 |