θ(1) time quadtree algorithm and its application for image geometric properties on a mesh connected computer (MCC)

Quadtree and octree decomposition of multicolored images is often used to solve problems of image processing. This paper describes a θ(1) time algorithm for the decomposition of the images into quadtree and octree on a mesh connected computer. Images will be stored in the MCC of the same size, at one pixel per processing element (PE). Certain applications of the algorithm are also described namely, the computation of such geometric properties as the area and perimeter. The complexity of these algorithms depends on the hierarchical data structure. They are carried out in O(log2 m + log m) times on an n × n MCC, where m = n/k, and k is the size of the smallest homogeneous quadrant in the image.

[1]  Tsuneo Yoshikawa,et al.  Manipulability of Robotic Mechanisms , 1985 .

[2]  Bidyut Baran Chaudhuri.  Applications of Quadtree, Octree, and Binary Tree Decomposition Techniques to Shape Analysis and Pattern Recognition , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3]  T. Shamir,et al.  Repeatability of redundant manipulators: mathematical solution of the problem , 1988 .

[4]  T. Shamir,et al.  The Singularities of Redundant Robot Arms , 1990, Int. J. Robotics Res..

[5]  Charles A. Klein,et al.  Review of pseudoinverse control for use with kinematically redundant manipulators , 1983, IEEE Transactions on Systems, Man, and Cybernetics.

[6]  Shaheen Ahmad,et al.  Predicting the drift motion for kinematically redundant robots , 1992, IEEE Trans. Syst. Man Cybern..

[7]  Charles A. Klein.  The Lie bracket condition as a test of stable, drift-free pseudoinverse trajectories , 1993, IEEE Trans. Robotics Autom..

[8]  Hanan Samet,et al.  Computing Geometric Properties of Images Represented by Linear Quadtrees , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[9]  David S. Wise.  Parallel Decomposition of Matrix Inversion Using Quadtrees , 1986, ICPP.

[10]  Charles A. Klein,et al.  The nature of drift in pseudoinverse control of kinematically redundant manipulators , 1989, IEEE Trans. Robotics Autom..

[11]  Shamim Ahmed.  Issues in the repeatability of redundant manipulator control : pseudoinverse drift and algorithmic singularities / , 1992 .

[12]  John Baillieul,et al.  Kinematic programming alternatives for redundant manipulators , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.

[13]  Daniel E. Whitney,et al.  Resolved Motion Rate Control of Manipulators and Human Prostheses , 1969 .

[14]  S. Sitharama Iyengar,et al.  Parallel Processing of Quadtrees on a Horizontally Reconfigurable Architecture Computing System , 1986, ICPP.

[15]  Russ Miller,et al.  Mesh Computer Algorithms for Computational Geometry , 1989, IEEE Trans. Computers.

[16]  Azriel Rosenfeld,et al.  Parallel Region Property Computation by Active Quadtree Networks , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[17]  Dragomir N. Nenchev,et al.  Redundancy resolution through local optimization: A review , 1989, J. Field Robotics.

[18]  Simon Kasif.  Optimal parallel algorithms for quadtree problems , 1994 .

[19]  Azriel Rosenfeld,et al.  Parallel processing of regions represented by linear quadtrees , 1988, Comput. Vis. Graph. Image Process..

[20]  Mark A. Z. Dippé,et al.  An adaptive subdivision algorithm and parallel architecture for realistic image synthesis , 1984, SIGGRAPH.

[21]  Anthony A. Maciejewski,et al.  Nearest optimal repeatable control strategies for kinematically redundant manipulators , 1992, IEEE Trans. Robotics Autom..

[22]  Wentai Liu,et al.  Parallel Processing for Quadtree Problems , 1986, ICPP.

[23]  Neville Hogan,et al.  Solving kinematic redundancy with impedance control: a class of integrable pseudoinverses , 1989, Proceedings, 1989 International Conference on Robotics and Automation.