Jing-Fu Jenq

Learn More
Computing the configuration space obstacles is an important problem in spatial planning for robotics applications. In this paper, we present parallel algorithm for computing the configuration space obstacles by using hypercube multiprocessors. The digitized images of the obstacles and the robot are stored in an N x N image plane. An algorithm for handling(More)
Parallel reconfigurable mesh algorithms are developed for the following image processing problems: shrinking, expanding, clustering, and template matching. Our N×N reconfigurable mesh algorithm for the q-step shrinking and expansion of a binary image takes O (1) time. One pass of the clustering algorithm for N patterns and K centers can be done in O (MK +(More)
We develop reconfigurable mesh (RMESH) algorithms for window broadcasting, data shifts, and consecutive sum. These are then used to develop efficient algorithms to compute the histogram of an image and to perform histogram modification. The histogram of an N×N image is computed by an N×N RMESH in O (√ B log√ B (N/√ B ) for B < N, Ο(√ N ) for B = N, and Ο(√(More)
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(More)