๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An Efficient Randomized Algorithm for Detecting Circles

โœ Scribed by Teh-Chuan Chen; Kuo-Liang Chung


Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
444 KB
Volume
83
Category
Article
ISSN
1077-3142

No coin nor oath required. For personal study only.

โœฆ Synopsis


Detecting circles from a digital image is very important in shape recognition. In this paper, an efficient randomized algorithm (RCD) for detecting circles is presented, which is not based on the Hough transform (HT). Instead of using an accumulator for saving the information of the related parameters in the HT-based methods, the proposed RCD does not need an accumulator. The main concept used in the proposed RCD is that we first randomly select four edge pixels in the image and define a distance criterion to determine whether there is a possible circle in the image; after finding a possible circle, we apply an evidence-collecting process to further determine whether the possible circle is a true circle or not. Some synthetic images with different levels of noises and some realistic images containing circular objects with some occluded circles and missing edges have been taken to test the performance. Experimental results demonstrate that the proposed RCD is faster than other HT-based methods for the noise level between the light level and the modest level. For a heavy noise level, the randomized HT could be faster than the proposed RCD, but at the expense of massive memory requirements.


๐Ÿ“œ SIMILAR VOLUMES


An Efficient Algorithm for Minimum-Weigh
โœ J. Keijsper; R. Pendavingh ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 280 KB

Given a directed graph D=(V, A) and a set S V, a bibranching is a set of arcs B A that contains a v&(V "S) path for every v # S and an S&v path for every v # V "S. In this paper, we describe a primal dual algorithm that determines a minimum weight bibranching in a weighted digraph. It has running ti

An efficient algorithm for parallel inte
โœ Benjamin Singer; George Saon ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 67 KB

In this paper we propose an efficient algorithm to implement parallel integer multiplication by a combination of parallel additions, shifts and reads from a memoryresident lookup table dedicated to squares. Such an operator called PIM (parallel integer multiplication) is in fact microprogrammed at t

An efficient adaptive algorithm for edge
โœ A. De Santis; D. Iacoviello ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 653 KB

## Abstract The edge detection problem in blurred and noisy 2โ€D signals is dealt with. An adaptive signal processing algorithm is proposed which marks edge points according to an hypothesis test which compares the likelihoods of two models describing the local signal behaviour in the two cases of a