In this work we present two new algorithms for the detection of circles and ellipses which use the FHT algorithm as a basis: Fast Circle Hough Transform (FCHT) and Fast Ellipse Hough Transform (FEHT). The first stage of these two algorithms, devoted to obtaining the centers of the figures, is computationally the most costly. With the objective of improving the execution times of this stage it h...

We introduce a novel formulation of the Circle Hough Transform that we call the Coherent Circle Hough Transform. The technique uses phase to code for radii of circles. The usual simplifications of the Circle Hough Transform (CHT) are used in which lines pointing away from edge points are plotted rather than circles. Intersections of these "spokes" accumulate edge magnitude, or edge "energy", ne...

The objective of this paper is to investigate a number of circle detection methods which are based on variations of the Hough Transform. The methods considered include the standard Hough Transform, the Fast Hough Transform of Li et al, two space saving approaches which are bused on those devised by Gerig and Klein and a twostage method. We experimentally compare the performance of the methods a...

This paper proposes a two-step circle detection algorithm using pairs of chords. It is shown how a pair of two intersecting chords locates the center of the circle. Based on this idea, in the ®rst step, a 2D Hough transform (HT) method is employed to ®nd the centers of the circles in the image. In the second step, a 1D radius histogram is used to compute the radii. The experimental results demo...

The main drawbacks of the Hough transform (HT) are the heavy requirement of computation and storage. To improve the drawbacks of the HT, the randomized Hough transform (RHT) was proposed. But the RHT is not suitable for detecting the pattern with the complex image because the probability is too low. In this paper, we propose a fast randomized Hough transform for circle/circular arc detection. W...

Circle detection has been widely applied in image processing applications. Hough transform, the most popular method of shape detection, normally takes a long time to achieve reasonable results, especially for large images. Such performance makes it almost impossible to conduct real-time image processing with sequential algorithms on community computers. Recently, NVIDIA developed CUDA programmi...

-In this work we present two new algorithms for the detection of circles and ellipses which use the FHT algorithm as a basis: Fast Circle Hough Transform (FCHT) and Fast Ellipse Hough Transform (FEHT). The first stage of these two algorithms, devoted to obtaining the centers of the figures, is computationally the most costly. With the objective of improving the execution times of this stage it ...

This paper examines the possibility of implementing the Hough transform for line and circle detection on arrays with reconfigurable optical buses (AROBs). It is shown that the Hough transform for line and circle detection in an N N image can be implemented in a constant number of steps. The costs of the two algorithms are O(Np) and O(Np), respectively, where p is the magnitude of one dimension ...

This paper examines the possibility of implementing the Hough transform for line and circle detection on arrays with reconngurable optical buses (AROBs). The AROB combines some of the advantages and characteristics of reconngurable meshes and meshes with optical pipelined buses. It is shown that the Hough transform for line and circle detection in an N N image can be implemented optimally in a ...

This paper represents algorithm for recognition of the coins of different denomination. The proposed system first uses a canny edge detection to generate an edge map, then uses CHT (Circular Hough transform) to recognize the coins and further find the radii of them. Based on the radius of the coin, the coins of different denomination are classified. The experimental result shows that the Hough ...