A pipelined cellular architecture for Euclidean distance transform

The Euclidean distance transform (EDT) is an important tool in image analysis and machine vision. It is compute-intensive and real-time applications call for highly parallel solutions. A new linear-time parallel algorithm for EDT is proposed in this paper. The algorithm readily maps to hardware. A pipelined cellular architecture is presented. The architecture is modular and cascadable. Preliminary results of FPGA implementation indicate that the proposed architecture can compute EDT at speeds much higher than the video rate using only a small percentage of the chip (components) for fairly large image sizes.

[1]  Daniel P. Huttenlocher,et al.  Comparing Images Using the Hausdorff Distance , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[2]  K. Sridharan,et al.  Efficient computation of Euclidean distance transform for applications in image processing , 1998, Proceedings of IEEE TENCON '98. IEEE Region 10 International Conference on Global Connectivity in Energy, Computer, Communication and Control (Cat. No.98CH36229).

[3]  Per-Erik Danielson A new shape factor , 1978 .

[4]  Hinnik Eggers,et al.  Two Fast Euclidean Distance Transformations in Z2Based on Sufficient Propagation , 1998, Comput. Vis. Image Underst..

[5]  Azriel Rosenfeld,et al.  Sequential Operations in Digital Picture Processing , 1966, JACM.

[6]  David W. Paglieroni,et al.  Distance transforms: Properties and machine vision applications , 1992, CVGIP Graph. Model. Image Process..