Constant-Time Hough Transform on a 3D Reconfigurable Mesh Using Fewer Processors
نویسنده
چکیده
The Hough transform has many applications in image processing and computer vision, including line detection, shape recognition and range alignment for moving imaging objects. Many constant-time algorithms for computing the Hough transform have been proposed on recon gurable meshes [1, 5, 6, 7, 9, 10]. Among them, the ones described in [1, 10] are the most e cient. For a problem with an N N image and an n n parameter space, the algorithm in [1] runs in a constant time on a 3D nN N N recon gurable mesh, and the algorithm in [10] runs in a constant time on a 3D n N N recon gurable mesh. In this paper, a more e cient Hough transform algorithm on a 3D recon gurable mesh is proposed. For the same problem, our algorithm runs in constant time on a 3D n logN N N recon gurable mesh.
منابع مشابه
An improved constant-time algorithm for computing the Radon and Hough transforms on a reconfigurable mesh
The Hough transform is an important problem in image processing and computer vision. Recently, an efficient algorithm for computing the Hough transform has been proposed on a reconfigurable array [12]. For a problem with an p N p N image and an n n parameter space, the algorithm runs in a constant time on a threedimensional (3-D) n n N reconfigurable mesh where the data bus is N1=c-bit wide. To...
متن کاملConstant Time Algorithms for Computational Geometry on the Reconfigurable Mesh
The reconfigurable mesh consists of an array of processors interconnected by a reconfigurable bus system. The bus system can be used to dynamically obtain various interconnection patterns among the processors. Recently, this model has attracted a lot of attention. In this paper, we show O(1) time solutions to the following computational geometry problems on the reconfigurable mesh: all-pairs ne...
متن کاملJing-fu Jenq
We develop parallel algorithms to compute the Hough transform on a reconfigurable mesh with buses (RMESH) multiprocessor. The p angle Hough transform of an N×N image can be computed in O (plog(N/p)) time by an N×N RMESH, in O ((p/N)logN) time by an N×N 2 RMESH with N copies of the image pretiled, in O ((p/√ N )logN) time by an N 1.5×N 1.5 RMESH, and in O ((p /N)logN) time by an N 2×N 2 RMESH.
متن کاملReconfigurable Mesh Algorithms For Fundamental Data Manipulation Operations
Recently, several similar reconfigurable mesh (RMESH) architectures have been proposed [MILL88abc, LI89ab, BEN90]. It has been demonstrated that these architectures are often very easy to program and that in many cases it is possible to obtain constant time algorithms that use a polynomial number of processors for problems that are not so solvable using the PRAM model [BEN90, MILL88a, JENQ91b, ...
متن کاملOptimal Parallel Algorithms for Computer Vision Problems
The computational model on which the algorithms are developed is the arrays with reconfigurable optical buses (abbreviated to AROB). It integrates the advantages of both optical transmission and electronic computation. In this paper, instead of using the radix-2 system, a radix-x system can be used to represent the numbers of the intermediate results of algorithms. We first design two Oð1Þ time...
متن کامل