Abstract
Abstract Detecting lines in images using pyramid architecture is the main subject of this paper. The approach is based on the parallel calculation of Hough transform. A pyramid architecture of size n is a fine-grain architecture with a mesh base of size √n ∗ √n processors each holding a single pixel of the image. The pyramid operates in an SIMD mode. Two algorithms for computing the Hough transform are explained. The first algorithm initially uses different angles, θj's, and its complexity is O(k + log2n) with O(m) storage requirement. The second algorithm computes the Hough transform in a pipeline fashion for each angle θj at a time. This method produces results in O(k∗ log 2 n) time with O(1) storage, where k is the number of θj angles, m is the number of ρi normal distances from the origin, and n is the number of pixels. A simulation program is also described.
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.
