The problem of detecting lines in an image withNedge pixels on mesh connected computers withNprocessors is considered, and four new and efficient algorithms which detect lines by performing a Hough transform are presented. The first algorithm runs inO(N½+n) time on a 2D (2 dimensional) mesh, wherenis the number of θ values considered. The second algorithm runs inO((N/n)½+n) time on a 3D mesh. The third algorithm runs inO(log(N/n)+n) time on a mesh plus tree, and the fourth algorithm runs inO(nlogN/logn) time on a mesh with reconfigurable buses. All of the algorithms presented in the paper have smaller time complexities than the known results in the literature.