Results 1  10
of
1,480
Progressive Probabilistic Hough Transform
, 1998
"... In the paper we present the Progressive Probabilistic Hough Transform (PPHT). Unlike the Probabilistic Hough Transform [4] where Standard Hough Transform is performed on a preselected fraction of input points, PPHT minimises the amount of computation needed to detect lines by exploiting the dif ..."
Abstract

Cited by 32 (0 self)
 Add to MetaCart
In the paper we present the Progressive Probabilistic Hough Transform (PPHT). Unlike the Probabilistic Hough Transform [4] where Standard Hough Transform is performed on a preselected fraction of input points, PPHT minimises the amount of computation needed to detect lines by exploiting
Parallelizing Hough transform computation
 IEEE Signal Process. Lett
, 2008
"... Abstract—The Hough transform, a widely used operation in image processing, suffers from being computationally intensive. In this letter, we propose a method called additive Hough transform (AHT) to accelerate Hough transform computation. It is based on parallel processing of 2 points, obtained by di ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Abstract—The Hough transform, a widely used operation in image processing, suffers from being computationally intensive. In this letter, we propose a method called additive Hough transform (AHT) to accelerate Hough transform computation. It is based on parallel processing of 2 points, obtained
On the Inverse Hough Transform
 In IEEE Transactions on pattern and machine intelligence, Vol
, 1999
"... AbstractÐIn this paper, an Inverse Hough Transform algorithm is proposed. This algorithm reconstructs correctlythe original image, using onlythe data of the Hough Transform space and it is applicable to anybinaryimage. As a first application, the Inverse Hough Transform algorithm is used for straigh ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
AbstractÐIn this paper, an Inverse Hough Transform algorithm is proposed. This algorithm reconstructs correctlythe original image, using onlythe data of the Hough Transform space and it is applicable to anybinaryimage. As a first application, the Inverse Hough Transform algorithm is used
The Cascaded Hough Transform
 In Proceedings of ICIP
, 1998
"... When using the original slopeintercept parameterisation for the Hough transform, the resulting parameter space actually corresponds to the dual space. Indeed, lines are transformed into points, and for every point there is also a corresponding line. This paper presents a way of exploiting this spec ..."
Abstract

Cited by 23 (0 self)
 Add to MetaCart
When using the original slopeintercept parameterisation for the Hough transform, the resulting parameter space actually corresponds to the dual space. Indeed, lines are transformed into points, and for every point there is also a corresponding line. This paper presents a way of exploiting
Progressive Probabilistic Hough Transform
"... In the paper we present the Progressive Probabilistic Hough Transform (PPHT). Unlike the Probabilistic Hough Transform [4] where Standard Hough Transform is performed on a preselected fraction of input points, PPHT minimises the amount of computation needed to detect lines by exploiting the differ ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In the paper we present the Progressive Probabilistic Hough Transform (PPHT). Unlike the Probabilistic Hough Transform [4] where Standard Hough Transform is performed on a preselected fraction of input points, PPHT minimises the amount of computation needed to detect lines by exploiting
Computing Hough Transforms
"... Efficient algorithms to compute the Hough transform on MI1\lD and SI1\1D hypercube multicomputers are developed. Our algorithms can compute p angles of the Hough transform of an N x N image, P 5 N 1 in O(p + log N) time on both ~1I~'1D and SIlv1D hypercubes. These algorithms require O(N2) proce ..."
Abstract
 Add to MetaCart
Efficient algorithms to compute the Hough transform on MI1\lD and SI1\1D hypercube multicomputers are developed. Our algorithms can compute p angles of the Hough transform of an N x N image, P 5 N 1 in O(p + log N) time on both ~1I~'1D and SIlv1D hypercubes. These algorithms require O(N2
APPLICATION OF THE HOUGH TRANSFORM by
, 2006
"... In this paper, I set out to implement the Hough algorithm in C. The Hough Transform is a line detection algorithm by Paul Hough. This algorithm was developed from slopeintercept parameters. The Generalized Hough Algorithm using angleradius was developed by Duda and Hart. In this paper, both the Cla ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In this paper, I set out to implement the Hough algorithm in C. The Hough Transform is a line detection algorithm by Paul Hough. This algorithm was developed from slopeintercept parameters. The Generalized Hough Algorithm using angleradius was developed by Duda and Hart. In this paper, both
FUNCTIONAL PEARL The Hough transform
"... Suppose you are given a number of points in a plane and want to have those lines that each contain a large number of the given points. The Hough transform is a computerized procedure for that task. It was invented by Paul Hough (1962), originally to find the trajectories of subatomic particles in a ..."
Abstract
 Add to MetaCart
Suppose you are given a number of points in a plane and want to have those lines that each contain a large number of the given points. The Hough transform is a computerized procedure for that task. It was invented by Paul Hough (1962), originally to find the trajectories of subatomic particles in a
Digital or Analog Hough Transform?
"... A variation of the Hough Transform that is aimed at detecting digital lines has been recently suggested. Other Hough algorithms are intended to detect straight lines in the analog preimage. These approaches arc analyzed and compared in terms of the relation between the achievable resolution and the ..."
Abstract
 Add to MetaCart
A variation of the Hough Transform that is aimed at detecting digital lines has been recently suggested. Other Hough algorithms are intended to detect straight lines in the analog preimage. These approaches arc analyzed and compared in terms of the relation between the achievable resolution
The coherent circle Hough transform
 in: British Machine Vision Conference, BMVA
, 1993
"... We introduce a novel formulation of the Circle Hough Transform that we call the Coherent Circle Hough Transform. The technique uses phase to code for radii of circles. The usual simplifications of the Circle Hough Transform (CHT) are used in which lines pointing away from edge points are plotted rat ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
We introduce a novel formulation of the Circle Hough Transform that we call the Coherent Circle Hough Transform. The technique uses phase to code for radii of circles. The usual simplifications of the Circle Hough Transform (CHT) are used in which lines pointing away from edge points are plotted
Results 1  10
of
1,480