Constant-time algorithm for the Euclidean distance transformon reconfigurable meshes

Journal of Parallel and Distributed Computing

Volumn 61, Issue 10, 2001, Pages 1439-1455

  Datta, Amitava ^a   Soundaralakshmi, Subbiah ^a  

^a UNIVERSITY OF WESTERN AUSTRALIA   (Australia)

Author keywords

AT2 bound; Binary image; Constant time algorithm; Euclidean distance transform; Reconfigurable mesh

Indexed keywords

EID: 0035180507     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.2000.1684     Document Type: Article

References (20)

1. A width-independent fast thinning algorithm
2. Computing Voronoi diagrams in digital pictures
3. Hierarchical chamfer matching: A parametric edge matching algorithm
4. An efficient algorithm for complete Euclidean distance transform on mesh-connected SIMD
5. An optimal parallel algorithm for the Euclidean distance maps of 2-D binary images
6. Constant time algorithms for computational geometry on the reconfigurable mesh
7. A fast algorithm for computing a histogram on reconfigurable mesh
8. Reconfigurable mesh algorithms for image shrinking, expanding, clustering and template matching
9. Fast computation of the Euclidean distance maps for binary images
10. Parallel computation of the Euclidean distance transform on the mesh of trees and the hypercube computer
11. A reconfigurable processor array with routing LSIs and general purpose DSPs
12. Polymorphic-torus network
13. Parallel computations on reconfigurable meshes
14. Sorting n numbers on n × n reconfigurable meshes with buses
15. Constant-time algorithm for computing the Euclidean distance maps of binary images on 2D meshes with reconfigurable buses
16. Distance function on digital pictures
17. Sequential operators in digital picture processing
18. Parallel computation of distance transforms
19. Complete Euclidean distance transformation by parallel operation