A Fast Parallel Algorithm for Convex Hull Problem of Multi-Leveled Images

Authors:
O. Bouattane;J. Elmesbahi;A. Rami
Affiliations:
B.P 1151, La Coline Mohammedia, Morocco/ e-mail: bouattan@iam.net.ma;B.P 1151, La Coline Mohammedia, Morocco;B.P 1151, La Coline Mohammedia, Morocco
Venue:
Journal of Intelligent and Robotic Systems
Year:
2002

Citing 8
Cited 1

Mesh Computer Algorithms for Computational Geometry

IEEE Transactions on Computers
Polymorphic-Torus Architecture for Computer Vision

IEEE Transactions on Pattern Analysis and Machine Intelligence
Image Computations on Meshes with Multiple Broadcast

IEEE Transactions on Pattern Analysis and Machine Intelligence
Meshes with reconfigurable buses

Proceedings of the fifth MIT conference on Advanced research in VLSI
Parallel Computations on Reconfigurable Meshes

IEEE Transactions on Computers
Effective classification of planar shapes based on curve segment properties

Pattern Recognition Letters
An O((log log n)2) Time Algorithm to Compute the Convex Hull of Sorted Points on Reconfigurable Meshes

IEEE Transactions on Parallel and Distributed Systems
Efficient Parallel Processing of Image Contours

IEEE Transactions on Pattern Analysis and Machine Intelligence

θ(1) Time Algorithm for Structural Characterization of Multi-Leveled Images and its Applications on a Reconfigurable Mesh Computer

Journal of Intelligent and Robotic Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a parallel algorithm to solve the convex hull problem for an (n×n) multi-leveled image using a reconfigurable mesh connected computer of the same size as a computational model. The algorithm determines parallely the convex hull of all the connected components of the multileveled image. It is based on some geometric properties and a top-down strategy. The complexity of the algorithm is O(log n) times. Using some approximations on the component contours, this complexity is reduced to O(log m) times where m is the number of the vertices of the convex hull of the biggest component of the image.This complexity is reached thanks to the polymorphic properties of the mesh where all the components are simultaneously and separately processed.