Parallel distance transforms on a linear array architecture

Authors:
Tsorng-Lin Chia;Kuang-Bor Wang;Zen Chen;Der-Chyuan Lou
Affiliations:
Department of Information Management, Ming Chuan University, Taoyuan, Taiwan;Department of Electrical Engineering, Chung Cheng Institute of Technology, Taoyuan, Taiwan;Institute of Computer Science and Information Engineering, National Chiao Tung University, Hsinchu, Taiwan;Department of Electrical Engineering, Chung Cheng Institute of Technology, Taoyuan, Taiwan
Venue:
Information Processing Letters
Year:
2002

Citing 12
Cited 0

Distance transformations in digital images

Computer Vision, Graphics, and Image Processing
Computing Voronoi diagrams in digital pictures

Pattern Recognition Letters
Computing distance transformations in convex and non-convex domains

Pattern Recognition
An Efficient Uniform Cost Algorithm Applied to Distance Transforms

IEEE Transactions on Pattern Analysis and Machine Intelligence
Partial Shape Classification Using Contour Matching in Distance Transformation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Parallel distance transforms on pyramid machines: theory and implementation

Signal Processing
Best simple octagonal distances in digital geometry

Journal of Approximation Theory
Generating skeletons and centerlines from the distance transform

CVGIP: Graphical Models and Image Processing
The Euclidean distance transform in arbitrary dimensions

Pattern Recognition Letters
A unified distance transform algorithm and architecture

Machine Vision and Applications
Digital Picture Processing

Digital Picture Processing
Collision Avoidance and Path Finding through Constrained Distance Tranceformation in Robot State Space

Intelligent Autonomous Systems, An International Conference

Quantified Score

Hi-index	0.89

Visualization

Abstract

Distance transformation (DT) has been widely used for image matching and shape analysis. In this paper, a parallel algorithm for computing distance transformation is presented. First, it is shown that the algorithm has an execution time of 6N - 4 cycles, for an N × N image using a parallel architecture that requires [N/2] parallel processors. By doing so, the real time requirement is fulfilled and its execution time is independent of the image contents. In addition, a partition method is developed to process an image when the parallel architecture has a fixed number of processing elements (PEs); say two or more. The total execution time for an N × N image by employing a fixed number of PEs is 2[N2/M + 2(M -1)], when M is the fixed number of PEs.