Parallelizing the Hough transform computation

被引：37

作者：

Satzoda, R. K. ^{[1
]}

Suchitra, S. ^{[1
]}

Srikanthan, T. ^{[1
]}

机构：

[1] Ctr High Performance Embedded Syst, Singapore 637553, Singapore

来源：

IEEE SIGNAL PROCESSING LETTERS | 2008年 / 15卷

关键词：

Hough transform; image processing; parallelism;

D O I：

10.1109/LSP.2008.917804

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

The Hough transform, a widely used operation in image processing, suffers from being computationally intensive. In this letter, we propose a method called additive Hough transform (AHT) to accelerate Hough transform computation. It is based on parallel processing of k(2) points, obtained by dividing the edge map into uniform blocks using a k x k grid. It has been shown that AHT on verification gives the same Hough profile as the conventional Hough transform. Further, AHT reduces the total computation time by at least k(2) times as compared to existing Hough transform architectures.

引用

页码：297 / 300

页数：4

共 7 条

[1]

Andraka R., 1998, FPGA'98. ACM/SIGDA International Symposium on Field Programmable Gate Arrays, P191, DOI 10.1145/275107.275139

[2]

Ballard D.H., 1982, Computer Vision

[3]

Chern MY, 2005, 11th International Conference on Parallel and Distributed Systems Workshops, Vol II, Proceedings,, P42

[4]

DENG DDS, 2001, P PAN SYDN AR WORKSH, P51

[5] HOUGH TRANSFORM USING CORDIC METHOD [J].

TIMMERMANN, D ;

HAHN, H ;

HOSTICKA, BJ .

ELECTRONICS LETTERS, 1989, 25 (03) :205-206

[6]

Zhou F., 1995, HIGH SPEED HOUGH TRA

[7]

ZHOU F, 1995, P INT C VLSI DIG SIG, P482

← 1 →