For the computational model where only additions are allowed, the Ω(n log n) lower bound on operations count with respect to image size n × n is obtained for two types of the discrete Radon transform implementations: the fast Hough transform and a generic strip pattern class which includes the classical Hough transform, implying the fast Hough transform algorithm asymptotic optimality. The proo...

This work focusses on boundary detection of target objects by extracting conngurations of straight lines. Hough transformation is used as basic voting technique for extracting the image lines. To nd the appropriate peaks in the bin array of the Hough transform and thus estimating the line parameters a three-step procedure is involved. First, the Hough transform is constrained appropriately by t...

The objective of this report is to explore the algorithmic and architectural optimization of the Hough Transform. The design of proposed Hough Transform algorithm will particularly suit small and mobile systems like tiny robots. Comparisons with ordinary point to point Hough Transform will be made and it will be shown that the proposed method produces accurate and faster results where memory co...

In this paper, an effective and reliable skew estimation technique for machine printed documents and photos using radon transform is proposed and is compared with other methods used for skew estimation such as Fast Fourier Transform (FFT), Hough Transform (HT), combination of Horizontal Projection Profile (HPP) and Hough Transform, combination of Gabor filter and Radon transform, combination of...

In this paper, the polar Hough transform (PHT) is considered as a track initiator in a track before detect (TBD) system. The study is performed in the presence of impulse interference. The algorithm under study includes a parametric CFAR detector, which works successfully in conditions of impulse interference and uses the polar Hough transform. The proposed Hough detector improves the detection...

ii ACKNOWLEDGEMENTS iii APPROVAL SHEET iv SUBMISSION SHEET v DECLARATION vi LIST OF TABLES x LIST OF FIGURES xi LIST OF ABBREVIATIONS xiii CHAPTER 1.0 INTRODUCTION 1 1.1 Background 1 1.2 Motivation 2 1.3 Scope of Work 3 1.4 Objective 4 1.5 Thesis Outline 5 2.0 LITERATURE REVIEW 7 2.1 Image Preprocessing 7 2.1.1 Iris Localization 8 2.1.1.1 Integro-differential operator 8 2.1.1.2 Hough Transform ...

The sliding window approach has been widely used for object detection because it provides a simple way to apply object recognition techniques to the detection task. Despite its effectiveness, though, the exhaustive search makes the approach inefficient in the case of a non-trivial classifier. The branch and bound techniques [3, 4] have been proposed in recent years to avoid the exhaustive searc...

The Hough transform is an important problem in image processing and computer vision. Recently, an efficient algorithm for computing the Hough transform has been proposed on a reconfigurable array [12]. For a problem with an p N p N image and an n n parameter space, the algorithm runs in a constant time on a threedimensional (3-D) n n N reconfigurable mesh where the data bus is N1=c-bit wide. To...