Space multiplexing of waveguides in optically interconnected multiprocessor systems
The Computer Journal - Special issue on object-oriented programming
Pipelined communications in optically interconnected arrays
Journal of Parallel and Distributed Computing
Serial and Parallel Algorithms for the Medial Axis Transform
IEEE Transactions on Pattern Analysis and Machine Intelligence
Optically interconnected processor arrays with switching capability
Journal of Parallel and Distributed Computing
New algorithm for medial axis transform of plane domain
Graphical Models and Image Processing
IEEE Transactions on Parallel and Distributed Systems
Linear array with a reconfigurable pipelined bus system—concepts and applications
Information Sciences: an International Journal - special issue on parallel and distributed processing
Computing the Medial Axis Transform in Parallel With Eight Scan Operations
IEEE Transactions on Pattern Analysis and Machine Intelligence
A cost optimal parallel algorithm for weighted distance transforms
Parallel Computing
Parallel Computing Using Optical Interconnections
Parallel Computing Using Optical Interconnections
Digital Picture Processing
Time-Division Optical Communications in Multiprocessor Arrays
IEEE Transactions on Computers
Quicksort on a Linear Array with a Reconfigurable Pipelined Bus System
ISPAN '96 Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks
Models and Algorithms for Optical and Optoelectronic Parallel Computers
ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
IEEE Transactions on Parallel and Distributed Systems
Image Analysis and Mathematical Morphology
Image Analysis and Mathematical Morphology
An efficient O(1) time 3D all nearest neighbor algorithm from image processing perspective
Journal of Parallel and Distributed Computing
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
3D block-based medial axis transform and chessboard distance transform based on dominance
Image and Vision Computing
| Hi-index | 0.00 |
The block-based medial axis transform (BB_MAT, for short) of a 3D (2D) binary image, denoted 3D_BB_MAT (2D_BB_MAT), is defined as the problem to find a minimal set of upright 1-cubes (1-squares) whose union corresponds exactly to the 1-voxels (1-pixels) in the binary image. Many parallel algorithms have been proposed for computing the 2D_BB_MAT, almost all proposed approaches are unable to extend to a solution of the 3D_BB_MAT problem. In this paper, we first propose a novel O(1) time algorithm for solving the 3D_BB_MAT (2D_BB_MAT) problem of a binary image of size NxNxN (NxN) on a linear array with a reconfigurable pipelined bus system (LARPBS, for short) by peeling the 3D (2D) corner shell of each 1-voxel (1-pixel) of the image and revealing some properties of the 3D_BB_MAT (2D_BB_MAT). The 3D (2D) chessboard distance transform problem, denoted 3D_CDT (2D_CDT), is the problem for each 0-voxel (0-pixel) of a 3D (2D) binary image to find its nearest 1-voxel (1-pixel) in the binary image based on chessboard distance metric. In this paper, we also solve the 3D_CDT (2D_CDT) based on the computed 3D_BB_MAT (2D_BB_MAT). All the proposed algorithms are very innovative although they look like ''straightforward''. To the best of our knowledge, the proposed 2D_BB_MAT (2D_CDT) algorithm is the first algorithm that can extend to a solution of the 3D_BB_MAT (3D_CDT) problem in parallel, and the 3D_BB_MAT (3D_CDT) algorithm is the first parallel algorithm proposed for solving the 3D_BB_MAT (3D_CDT) problem.