Results 181 to 190 of about 56,657 (221)
Some of the next articles are maybe not open access.
A probabilistic Hough transform
Pattern Recognition, 1991Abstract The Hough Transform for straight line detection is considered. It is shown that if just a small subset of the edge points in the image, selected at random, is used as input for the Hough Transform, the performance is often only slightly impaired, thus the execution time can be considerably shortened.
N. Kiryati, Y. Eldar, A.M. Bruckstein
openaire +1 more source
A combinatorial Hough transform
Pattern Recognition Letters, 1990Abstract A new algorithm for computing the Hough transform is presented. It calculates the parameters associated with all possible combinations of two-point line segments among the feature points in the image, rather than calculating all possible values of one of the parameters searched.
Ben-Tzvi, D., Sandler, M. B.
openaire +1 more source
Fast generalized Hough transform
Pattern Recognition Letters, 1990Abstract A fast algorithm for the generalized Hough transform (GHT) based on the use of a hierarchical processing scheme and the inverse generalized Hough operation is proposed. By reducing the size of the image portion which need be processed in the proposed fast GHT, not only the computation time but also the number of processing elements for ...
Jeng, Sheng-Ching, Tsai, Wen-Hsiang
openaire +1 more source
Hierarchical generalized Hough transforms and line-segment based generalized Hough transforms
Pattern Recognition, 1982Abstract Generalized Hough transforms are fast point pattern matching algorithms which have applications in image processing. Two extensions to generalized Hough transforms are described. The first allows for matching hierarchically organized point patterns. An example concerning image registration using hierarchical point patterns is described.
openaire +1 more source
Probabilistic Convergent Hough Transform
2008 International Conference on Information and Automation, 2008To reduce the computational complexity, a novel method of standard Hough transform (SHT), named probabilistic convergent Hough transform (PCHT), is proposed in this paper. PCHT avoids unnecessary cost of SHT in computation by intermittently detecting several points of a line through fast convergence and in memory by using a one-dimensional accumulator.
null Lei Zhu, null Zhaoqi Chen
openaire +1 more source
Antialiasing the Hough transform
CVGIP: Graphical Models and Image Processing, 1991Abstract The discretization of the Hough transform parameter plane is considered. It is shown that the popular accumulator method implies sampling of a nonbandlimited signal. The resultant aliasing accounts for several familiar difficulties in the algorithm. Bandlimiting the parameter plane would allow Nyquist sampling, thus aliasing could be avoided.
N Kiryati, A.M Bruckstein
openaire +1 more source
2019
The Hough Transform is widely used to detect parametrically described curves in an image that can contain noise or partial occlusion. It is shown how a two dimensional linear Hough Transform can be used to identify track candidates within the CMS tracker.
openaire +1 more source
The Hough Transform is widely used to detect parametrically described curves in an image that can contain noise or partial occlusion. It is shown how a two dimensional linear Hough Transform can be used to identify track candidates within the CMS tracker.
openaire +1 more source
Proceedings of IEEE International Conference on Application Specific Array Processors (ASSAP'94), 2002
The Hough transform is the choice technique for identifying straight lines through digital images, with applications to high energy physics and computer vision. Classical methods for implementing the Hough transform of a N/spl times/N binary image require to compute N/sup 3/ additions over n=log/sub 2/(N) bits integers, hence nN/sup 3/ bit operations ...
openaire +1 more source
The Hough transform is the choice technique for identifying straight lines through digital images, with applications to high energy physics and computer vision. Classical methods for implementing the Hough transform of a N/spl times/N binary image require to compute N/sup 3/ additions over n=log/sub 2/(N) bits integers, hence nN/sup 3/ bit operations ...
openaire +1 more source

