By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Elmesbahi, J. ; Fac. of Sci., Ain Chock Hassan II Univ., Casablanca, Morocco ; Bouattane, O. ; Benabbou, Z.

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 are 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

Published in:

Systems, Man and Cybernetics, IEEE Transactions on  (Volume:25 ,  Issue: 12 )