Time complexity evaluation of algorithms for the Hough transform on mesh connected computers
Maria Grazia Albanesi · 2002
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.>