J. Illingworth and J. Kittler, Survey: A survey of the Hough transform, Comput. Vision, Graphics, Image Process. 44, 1988, 87--116.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....faster than the proposed RCD, but at the expense of massive memory requirements. c 2001 Academic Press Key Words: circle detection; Hough transform; randomized algorithm. I. INTRODUCTION Detecting circles from a digital image is very important in shape recognition [5] Hough transform (HT) [11, 16] is the most well known method for circle detection. Let (x, y)be an edge pixel on a circle with center coordinates (a, b) and radius r; then the circle can be expressed as a) y b) 1) Corresponding author. E mail: klchung cs.ntust.edu.tw. Supported by NSC89 2218 E011 017. 172 ....

....the edge pixels lying on the circle are taken out of the set of current edge pixels which leads to speeding up the detection of the next circle. The circle detection work is performed iteratively until the given stopping criterion is reached. The readers are suggested to refer to the references [11, 13, 16, 23] on the comprehensive overview and comparison between the CHT and RHT. In this paper, we present a new randomized circle detection algorithm called the RCD. The proposed non HT based RCD first randomly selects four edge pixels in the image and defines a distance criterion to determine whether ....

J. Illingworth and J. Kittler, Survey: A survey of the Hough transform, Comput. Vision, Graphics, Image Process. 44, 1988, 87--116.

....the most likely values of ae and , see Figure 3. Hough space cells Line in Image Least squares fitting q q r r Figure 3: Schematic of the Hough Transform Process Formulated in this way, the Hough transform technique is a partially robust method with good resistance to noise and occlusion [IK88] This is because the method uses global information concentrated at single possible solutions. It is also a very general method, being applicable to any curves for which parametric forms are available and can be generalised (at the expense of computational complexity) to any representable object ....

J. Illingworth and J. Kittler. SURVEY: A Survey of the Hough Transform. CVGIP, 44:87--116, 1988.

....Conference detector by instantiating with the relevant operators and composing successive operations together. 2. 3 Hough Transform: Global Image Transformation The Hough transform is a technique for detecting patterns in data by accumulating points which are characteristic of a given pattern [7]. This is one example of a range of transforms that may be performed on images, another example is the discrete Fourier transform. In these transformations the entire input image may be required to calculate one value in the output transformation space. We have studied the Hough transform and have ....

J. Illingworth and J. Kittler. SURVEY: A Survey of the Hough Transform. CVGIP, 44:87--116, 1988.

....this can be achieved by quantising (ae; and using a voting system to determine the most likely values of ae and , see Fig. 2. Formulated in this way, the Hough transform technique is a reasonably robust method in that it has good resistance to noise and can work with high levels of occlusion (Illingworth and Kittler, 1988). This is because the method uses global information concentrated at single possible solutions. It is also a very general method, being applicable to any curves for which parametric forms are available and can be generalised (at the expense of computational complexity) to any representable object ....

J. Illingworth and J. Kittler. SURVEY: A Survey of the Hough Transform. CVGIP, 44:87--116, 1988.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC