A Swift and Memory Efficient Hough Transform for Systems with Limited Fast Memory

Authors:
Muhammad U. Khan;Abdul Bais;Khawaja M. Yahya;Ghulam M. Hassan;Rizwana Arshad
Affiliations:
NWFP University of Engineering and Technology, Peshawar, Pakistan;Sarhad University of Science and Information Technology, Peshawar, Pakistan;NWFP University of Engineering and Technology, Peshawar, Pakistan;NWFP University of Engineering and Technology, Peshawar, Pakistan;NWFP University of Engineering and Technology, Peshawar, Pakistan
Venue:
ICIAR '09 Proceedings of the 6th International Conference on Image Analysis and Recognition
Year:
2009

Citing 9
Cited 1

Extracting straight lines

IEEE Transactions on Pattern Analysis and Machine Intelligence
An extension to the randomized Hough transform exploiting connectivity

Pattern Recognition Letters
Some remarks on the straight line Hough transform

Pattern Recognition Letters
Use of the Hough transformation to detect lines and curves in pictures

Communications of the ACM
A Parallel Pipelined Hough Transform

Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing-Volume II
Local lines: a linear time line detector

Pattern Recognition Letters
A simple and robust line detection algorithm based on small eigenvalue analysis

Pattern Recognition Letters
Memory Efficient Vision Based Line Feature Extraction for Tiny Mobile Robots

ICIAR '09 Proceedings of the 6th International Conference on Image Analysis and Recognition
An improved constant-time algorithm for computing the Radon and Hough transforms on a reconfigurable mesh

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans

Resource-efficient FPGA architecture and implementation of hough transform

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper focuses on implementation of a speedy Hough Transform (HT) which considers the memory constraints of the system. Because of high memory demand, small systems (DSPs, tiny robots) cannot realize efficient implementation of HT. Keeping this scenario in mind, the paper discusses an effective and memory-efficient method of employing the HT for extraction of line features from a gray scale image. We demonstrate the use of a circular buffer for extraction of image edge pixels and store the edge image in a manner that is different from the conventional way. Approximation of the two dimensional Hough Space by a one dimensional array is also discussed. The experimental results reveal that the proposed algorithm produces better results, on small and large systems, at a rapid pace and is economical in terms of memory usage.