Results 141 to 150 of about 1,992 (180)
Some of the next articles are maybe not open access.
Fast mapping using the log-Hough transformation
Proceedings. 1998 IEEE/RSJ International Conference on Intelligent Robots and Systems. Innovations in Theory, Practice and Applications (Cat. No.98CH36190), 2002Environment mapping is a very complex procedure that requires high CPU performance. For the last few years, laser scanners have become more and more important for mobile robots. Using their data requires many transformations between different coordinate systems.
Björn Giesler +3 more
openaire +1 more source
Fast Hough Transform On A Mesh Connected Processor Array
SPIE Proceedings, 1988zbMATH Open Web Interface contents unavailable due to conflicting licenses.
C. S. Kannan, Henry Y. H. Chuang
openaire +2 more sources
Fast Hough Transform on Multiprocessors: A Branch and Bound Approach
Journal of Parallel and Distributed Computing, 1997zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nicolás Guil, Emilio L. Zapata
openaire +1 more source
A Fast Efficient Parallel Hough Transform Algorithm on LARPBS
The Journal of Supercomputing, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ling Chen 0005 +3 more
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
On a Fast Hough Transform Method PLHT Based on Piecewise‐Linear Hough Function
Systems and Computers in Japan, 1990AbstractBy replacing the calculation of the trigonometric functions sin and cos in the Hough transform with the piecewise‐linear Hough function (PLH), the number of multiplication and trigonometric calculations are reduced. The PLH function is derived from the standard Hough function in a straightforward manner. The PLH‐based transformation retains the
Hiroyasu Koshimizu, Munetoshi Numada
openaire +1 more source
Use Of Overlap In The Hough And Fast Hough Transforms
SPIE Proceedings, 1989The article addresses the application of the Hough and fast Hough (FHT) transforms for finding lines in sets of coordinate pairs. The backprojection of the Hough transform is known to be a strip. The backprojection of the FHT is shown to be a Haired strip. The flair can be made insignificant by adjusting a scale factor. Overlapping the strips is useful
openaire +1 more source
Fast Hough transform for multidimensional signal processing
ICASSP '86. IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005The recently developed Fast Hough Transform algorithm [3,4] alleviated the traditional exponential growth in computing complexity and storage of the Hough transform at a factor of several orders of magnitude thus enlightened the possibility of serving as a fundamental algorithm for multidimensional signal processing.
openaire +1 more source
Improved Hough transform for fast Iris detection
2010 2nd International Conference on Signal Processing Systems, 2010Objectives: an important part of digital image processing is recognition of patterns. Iris recognition is an important application of the same. As a result of the fact that CHT lacks speed due to its high time complexity, it is useful to recognize valid regions and make these regions the only regions to process. Extracting a valid region from the image
Nitin Bhatia, Megha Chhabra
openaire +1 more source
Fast Hough transform for automatic bridge extraction
SPIE Proceedings, 2007In this paper, a new method to recognize bridge in the complicated background is presented. The algorithm takes full advantages of the characteristics of the bridge image. Firstly, the image is preprocessed and the object edges are extracted. Then according to the limitations of traditional Hough transform (HT), the extraction method of the image line ...
Qiwei Hao +3 more
openaire +1 more source