An O(1) Time Parallel Algorithm for the Dominance Counting and 3D Block-Based Medial Axis Transform on AROB

Authors:
Shih-Ying Lin;Shi-Jinn Horng;Tzong-Wann Kao;Yuh-Rau Wang
Affiliations:
Lan Yang Institute of Technology, I-Lan, Taiwan.;National Taiwan University of Science and Technology, Taipei, Taiwan.;Northern Taiwan Institute of Science and Technology, Taipei, Taiwan;St. John's and St. Mary's University of Technology, Taipei, Taiwan.
Venue:
PDCAT '05 Proceedings of the Sixth International Conference on Parallel and Distributed Computing Applications and Technologies
Year:
2005

Citing 0
Cited 2

3D Block-Based Medial Axis Transform and Chessboard Distance Transform on the CREW PRAM

ICA3PP '08 Proceedings of the 8th international conference on Algorithms and Architectures for Parallel Processing
3D block-based medial axis transform and chessboard distance transform based on dominance

Image and Vision Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a constant time algorithm for solving three dimensional block-based medial axis transform (3D BB-MAT, for short) on the array with reconfigurable optical buses (AROB). The main contribution of this work is to exploit the dominance counting method for solving the 3D BB-MAT that was never done previously in the literature. With the advantages of both optical transmission and electronic computation on the AROB model, the constant algorithm is proposed for the medial axis transform of a 3D N x Nx N binary image on a 4D AROB using N^4 processors. To the best of our knowledge, this presented result of the dominance counting technique for medial axis transform of block-based is the best O(1) time algorithm known.