| We describe an algorithm for the detection of ellipse shapes in images, using the Randomized Hough Transform. The algorithm is compared to a standard implementation of the Hough Transform, and the Probabilistic Hough Transform. Tests are performed using both noise-free and noisy images, and several real-world images. The algorithm was found to give improvements in accuracy, and a reduction in...

The Hough transform is a popular method for detecting complex forms in digital images. However, the technique is not very robust since several parameters that determine the scope of the detection results, such as quantization thresholds and intervals, must first be defined. In the present paper, we propose to enhance shape detection with the Hough transform through fuzzy analysis. One chief dra...

In this paper we consider an aggregation technique introduced by Yıldıran [45] to study the convex hull of regions defined by two quadratic inequalities or by a conic quadratic and a quadratic inequality. Yıldıran [45] shows how to characterize the convex hull of open sets defined by two strict quadratic inequalities using Linear Matrix Inequalities (LMI). We show how this aggregation technique...

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...

A space-efficient algorithm is one in which the output is given in the same location as the input and only a small amount of additional memory is used by the algorithm. We describe four space-efficient algorithms for computing the convex hull of a planar point set.

In the paper, a hybrid image processing approach – the adaptive morphological Hough transform AMHT – is developed and applied to detect straight line tracks in the volumetrical images produced by particle collisions in the ATLAS detector. The approach combines components of the adaptive Hough transform (i.e. the resolution refinement of the parameter space) and the morphological Hough transform...

The convex hull describes the extent or shape of a set of data and is used ubiquitously in computational geometry. Common algorithms to construct the convex hull on a finite set of n points (x,y) range from O(nlogn) time to O(n) time. However, it is often the case that a heuristic procedure is applied to reduce the original set of n points to a set of s < n points which contains the hull and so...