This paper proposes a novel algorithm called the sparse Hough transform, which is shown to have better performances than the standard Hough transform for sparse input data collected from a laser on a mobile robot. In the context of laser sensing and perception for autonomous ground robots, this paper studies performances of the sparse Hough transform and compares it with other segmentation and ...

Kanade [1] proposed a heuristic for interpreting shape from contour. To apply his heuristic, skewed symmetries have to be found. In this paper, an algorithm for finding skewed symmetries in a planar point set is proposed. The method requires a simple rotation and midpoint finding, followed by a Hough transform. A variant of the Hough transform is reported. It is based on interpreting it as a ro...

image recognition is one of the most important field in image processing that in recent decades had much attention .due to expansion of related fields with image processing and various application of this science in machine vision, military science, geography, aerospace and artificial intelligence and lots of other aspects, out stand the importance of this subject.one of the most important aspe...

We discuss Hough Transform, some of its key properties, a scheme of fast and complete calculation of the Hough Transform (similar to the Fast Fourier Transform), and an efficient implementation of this scheme on SIMD processors. We also demonstrate an application of the Fast Hough Transform in computer vision by the example of an automatic page orientation detection unit incorporated in an inte...

Convex hulls are fundamental geometric tools used in a number of algorithms. This paper presents a fast, simple to implement and robust Smart Convex Hull (S-CH) algorithm for computing the convex hull of a set of points in . This algorithm is based on “spherical” space subdivision. The main idea of the S-CH algorithm is to eliminate as many input points as possible before the convex hull constr...

This paper pursues a statistical study of the Hough transform; the celebrated computer vision algorithm used to detect the presence of lines in a noisy image. We first study asymptotic properties of the Hough transform estimator, whose objective is to find the line that “best” fits a set of planar points. In particular, we establish strong consistency, rates of convergence and characterize the ...

Hough transform based methods for object detection work by allowing image features to vote for the location of the object. While this representation allows for parts observed in different training instances to support a single object hypothesis, it also produces false positives by accumulating votes that are consistent in location but inconsistent in other properties like pose, color, shape or ...

In this paper, we study properties of general closed convex sets that determine the closed-ness and polyhedrality of the convex hull of integer points contained in it. We first present necessary and sufficient conditions for the convex hull of integer points contained in a general convex set to be closed. This leads to useful results for special class of convex sets such as pointed cones, stric...

A convex hull is a polygon which encloses all given set of points.Euler number or Euler characteristic of an image has proven to be an important feature in many image analyses and visual inspection applications. This paper presents an algorithm for fast computing the convex hull of a planar scattered point set, which pre-strike an initial convex hull boundary, remove internal points in the boun...

Inthispaper, (L,M)-fuzzy domain finiteness and (L,M)-fuzzy restricted hull spaces are introduced, and several characterizations of the category (L,M)-CS of (L,M)-fuzzy convex spaces are obtained. Then, (L,M)-fuzzy stratified (resp. weakly induced, induced) convex spaces are introduced. It is proved that both categories, the category (L,M)-SCS of (L,M)-fuzzy stratified convex spaces and the cate...