Time complexity evaluation of algorithms for the Hough transform on mesh connected computers

M.G Albanesi

doi:10.1109/cmpeur.1991.257392

Time complexity evaluation of algorithms for the Hough transform on mesh connected computers

M.G Albanesi

https://doi.org/10.1109/cmpeur.1991.257392

Copy DOI

Publication Date: May 13, 1991

Citations: 4

#Mesh Connected Computers #Different Implementations Of Algorithms + Show 8 more

Abstract
Full-Text
Similar Papers

Abstract

The problem of evaluating the time complexity of parallel algorithms for the Hough transform (HT) is addressed. A possible method of analysing several proposals in the literature is presented, referring to different implementations of algorithms on mesh-connected computers. The methodology is based on some assumptions which are motivated by memory and architectural constraints of the HT implementation on meshes and by VLSI requirements for an efficient integration. >

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 call

Similar Papers

Paper Title

Journal

Date

Author

View more papers

Disclaimer: 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.