Abstract
Hough Transform[has become a common method in the usage of line detection because of its robustness. It is important in computer vision and image analysis. Usually, the standard Hough transform method (SHT) transform the points in image space into parameter space and vote for all the possible patterns passing through that point. But, there are two serious problems in the standard method of line detection. The first is the high computation complexity and the second is the large storage requirements .In order to solve the two problems, this paper raise a fast-Hough transform algorithm base on pyramid algorithm. First of all we need to desample the primitive binary image with n times; and execute the Hough transform in the nth level image to get the parameter of straight line in this image, which is used in the n-1 level image. Finally we can get the parameter of lines in the primitive image. Experiments show that this method can extremely reduces the computational time.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
