Showing papers on "Scale-invariant feature transform published in 1989"

Computing the Hough transform on a scan line array processor (image processing)

Abstract: A parallel algorithm for a line-finding Hough transform that runs on a linearly connected, SIMD (single-instruction, multiple-data-stream) vector of processors is described. The authors show that a high-precision transform, usually considered to be an expensive global operation, can be performed efficiently, in two to three times real time, with only local, communication on a long vector. The algorithm also illustrates a decomposition principle that has wide application in algorithm design for large linear arrays. A review of straight-line Hough transform implementations is also presented. >

A comparison of Hough transform methods

Abstract: An important aspect of any scientific discipline is the objective and independent comparison of algorithms which perform common tasks. In image analysis this problem has been neglected. In this paper we present the results and conclusions of a comparison of four Hough Transform, HT, based line finding algorithms on a range of realistic images from the industrial domain. We introduce the line detection problem and show the role of the Hough Transform in it. The basic idea underlying the Hough Transform is presented and is followed by a brief description of each of the four HT based methods considered in our work. The experimental evaluation and comparison of the four methods is given and a section offers our conclusions on the merits and deficiencies of each of the four methods.

Improving parameter space for Hough transform

Abstract: The letter presents an improved representation for the parameter space to be used in the Hough transform with normal parameterisation. This representation can improve considerably the performance of the Hough transform, and be used for other parameterisations and variations of the Hough transform.

Global feature extraction using efficient Hough transform

Abstract: Novel Hough transform schemes are presented to provide two kinds of function expected of a global feature extractor. While the Hough transform was originally no more than a line segment detector, more complicated pattern features can be extracted by more intensive investigation of the Hough parameter space and/or more hierarchical usage of the Hough transform. As a typical example, a method to extract convex hulls and other related features from the transform space is introduced. In order to reduce the computing cost, a few efficient algorithms are introduced. A family of the functions applicable to the Houghlike feature extractor, the extended Hough transform, is proposed. As an example of hierarchical usage, the Hough transform is applied to the feature points of the Hough space. >

Segmentation and grouping of object boundaries

Abstract: A method is presented to detect curvilinear structures in 2D images. The approach is based on a generalization of the Hough transform that is different from its traditional, template-based generalizations. With this method, global interaction of edge elements is reduced through the use of the Delaunay graph in utilizing the Hough transform. The algorithm as it is currently implemented needs to be extended. One suggested extension is to perform a connected component analysis of the groups obtained from current algorithm and use the distribution of the set of bins in Hough space to further group these larger components. Another extension would be to use the Hough space information to perform contour completion for occluded objects. >

Parametrization of the Hough Transform

Abstract: The Hough transform is used in picture processing for detecting linear structures in binary images. It associates to each line running through the image the integral along this line of the gray value function. There are many different possibilities for parametrizing lines in the plane and, depending on the applications under consideration, there exist many approaches for parametrization having different properties. The aim of this paper is to give a unified theoretical framework for the parametrization of the Hough transform. On the basis of this theoretical work it becomes possible to compare different parametrizations proposed so far and to construct parametrizations having desirable properties.